{"as_of":"2026-08-06T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c64053b24339288c2362ca0abe2b0a44301e871e4a7a24b4e47911e9bda815f0","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:50:38.432807Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.12586/citation-record","integrity":"/paper/2602.12586/integrity","json":"/paper/2602.12586/citation-record.json","paper":"/paper/2602.12586"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:50:32.928162Z","title":"S., Gokaslan, A., Yang, Z., Qi, Z., Han, J., Chiu, J","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-02T23:50:30.882987Z","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":1,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:32.928162Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:fa9b0ae1dad676bfdde491632d29a50dec705491d9a23310db23ed828c01478b","observation_id":"831fee69-3b83-4b4f-a65a-e617ca7ee58d","resolution":{"observed_at":"2026-08-02T23:50:32.928162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-02T23:50:33.012475Z","title":"Program synthesis with large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":2,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.012475Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:75746c067720b05041854dd62b21e64393dbb9c1bcd261e51cc7af459b1de4da","observation_id":"a9630e16-6dea-437c-86ca-049c6205b046","resolution":{"observed_at":"2026-08-02T23:50:33.012475Z","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-02T23:50:33.095473Z","title":"A markovian decision process","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":3,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.095473Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:acda54c3e31907dd9a13ab9217a51b3dad346d49d3fa5aa08fbd1cadaa5b8912","observation_id":"b6290762-290f-4830-84b3-94570580d770","resolution":{"observed_at":"2026-08-02T23:50:33.095473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.24857","last_updated":"2025-05-30T17:52:55Z","snapshot_observed_at":"2026-07-06T21:33:50.814913Z","submitted_at":"2025-05-30T17:52:55Z","title":"Accelerated Sampling from Masked Diffusion Models via Entropy Bounded Unmasking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.24857","snapshot_observed_at":"2026-08-02T23:50:33.176435Z","title":"Accelerated sampling from masked diffusion models via entropy bounded unmasking","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-02T23:50:30.882987Z","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":4,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.176435Z"},"links":{"cited_paper":"/paper/2505.24857","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:ea0780bdc9b0bd839e4958a6d230ab37b8d3110ae0f99009d9208df1289bc088","observation_id":"1cc2f3d0-d7a6-4bad-9f97-d1e1e35c8c31","resolution":{"observed_at":"2026-08-02T23:50:33.176435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.15745","last_updated":"2025-12-24T03:46:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-12-10T09:26:18Z","title":"LLaDA2.0: Scaling Up Diffusion Language Models to 100B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.15745","snapshot_observed_at":"2026-08-02T23:50:33.240614Z","title":null,"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-02T23:50:30.882987Z","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":5,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.240614Z"},"links":{"cited_paper":"/paper/2512.15745","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:45558010c939867cda5417443118a3df74b1392155f6054e4ea104bd83c465fe","observation_id":"920562e6-a34f-4846-ac6d-8f1285e32232","resolution":{"observed_at":"2026-08-02T23:50:33.240614Z","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-02T23:50:33.313717Z","title":"B., Powley, E., Whitehouse, D., Lucas, S","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":6,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.313717Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:db74f6072dc8e2af01db177f92ab501075d9fe02f1808cb23f13886db0e69de6","observation_id":"dd726144-7c01-4f10-8f70-286c836f5edf","resolution":{"observed_at":"2026-08-02T23:50:33.313717Z","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-02T23:50:33.392886Z","title":"M.-B., Winands, M","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":7,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.392886Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:e2b99a45da8b28d51962b6cdd08ba534e1fed7eecde4a0afd1c63d11d1b79151","observation_id":"5e638a1e-6243-4dec-a421-0bbb994fd4a1","resolution":{"observed_at":"2026-08-02T23:50:33.392886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-02T23:50:33.451776Z","title":"Evaluating large language models trained on code","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":8,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.451776Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:ceeb52315ec2f5eb2144be17f1e5ddb42458128adbdcbd93f52edfd680e60689","observation_id":"273f4f26-c76c-468f-9b34-c40580c5c4b1","resolution":{"observed_at":"2026-08-02T23:50:33.451776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-02T23:50:33.528517Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":9,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.528517Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:8824d5aed7badf8e96133e4f91eda8f028cc8a6a65aaa97c8c8c5f7eef3ab614","observation_id":"b8a8de1f-ee2c-4122-bacc-e420e37a0774","resolution":{"observed_at":"2026-08-02T23:50:33.528517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-04T15:46:25.710484Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-02T23:50:33.597043Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":10,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.597043Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:4074f7133ebfc8e8ed18c83489fd8ea69aa831422d0952273f4a19b6fb50fb38","observation_id":"c194c9a8-805c-4a8c-9b98-e47dab77b040","resolution":{"observed_at":"2026-08-02T23:50:33.597043Z","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-02T23:50:33.668876Z","title":"Efficient selectivity and backup operators in monte-carlo tree search","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":11,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.668876Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:ca070740e25e2b2d679ac334023d419965ec79dfcf3b0b512e84f1ef1f095361","observation_id":"d6160c05-fe7e-49c6-bfdd-476192cb3f12","resolution":{"observed_at":"2026-08-02T23:50:33.668876Z","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-02T23:50:33.733836Z","title":"From bits to rounds: Parallel decoding with exploration for diffusion language models","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-02T23:50:30.882987Z","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":12,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.733836Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:c019bbe4c25a08530a0fae92b29d056f389f532b10490c24b61c181279648f15","observation_id":"258df9c3-458c-41ed-bc82-d3ea40d698d8","resolution":{"observed_at":"2026-08-02T23:50:33.733836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01707","last_updated":"2024-12-25T13:32:54Z","snapshot_observed_at":"2026-07-06T19:26:22.646942Z","submitted_at":"2024-10-02T16:15:31Z","title":"Interpretable Contrastive Monte Carlo Tree Search Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01707","snapshot_observed_at":"2026-08-02T23:50:33.793445Z","title":"Interpretable contrastive monte carlo tree search reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":13,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.793445Z"},"links":{"cited_paper":"/paper/2410.01707","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:e9190a06362f3973337f2b8a52a39c8d0ed69b884a00399b0a862a32b94e2a8f","observation_id":"db98a0bc-d578-4c47-a5f5-569be680b8c5","resolution":{"observed_at":"2026-08-02T23:50:33.793445Z","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-02T23:50:33.882369Z","title":"Scaling diffusion language models via adaptation from autoregressive models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":14,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.882369Z"},"links":{"cited_paper":"/paper/2410.17891","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:4d6b8949de9a579e1d63160d5061dbb4dc1a9ad35891cfefdd4271cb01d5701a","observation_id":"ebfb2cab-6965-452c-a9cd-480d96018771","resolution":{"observed_at":"2026-08-02T23:50:33.882369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20639","last_updated":"2025-06-26T15:46:40Z","snapshot_observed_at":"2026-08-01T20:24:21.885586Z","submitted_at":"2025-06-25T17:35:47Z","title":"DiffuCoder: Understanding and Improving Masked Diffusion Models for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.20639","snapshot_observed_at":"2026-08-02T23:50:33.939670Z","title":"Diffucoder: Understanding and improving masked diffusion models for code generation","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-02T23:50:30.882987Z","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":15,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:33.939670Z"},"links":{"cited_paper":"/paper/2506.20639","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:19b0e64e71b6d0fd723c0a7d0cc01657156bc391cd3f3edf3f79a99543b7a7c2","observation_id":"25bab7dd-04e8-481d-810f-ac3cc2f2310d","resolution":{"observed_at":"2026-08-02T23:50:33.939670Z","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-02T23:50:34.019650Z","title":"R., Beck, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":16,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:34.019650Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:ce8fefc55822d79f58dcdf60efd448fd8f71f377799c96c77d6e2cbb7e1f1391","observation_id":"f099214c-80dc-4e56-9b78-ec2f9a4f34e5","resolution":{"observed_at":"2026-08-02T23:50:34.019650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04519","last_updated":"2025-01-08T14:12:57Z","snapshot_observed_at":"2026-08-04T20:57:22.329262Z","submitted_at":"2025-01-08T14:12:57Z","title":"rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04519","snapshot_observed_at":"2026-08-02T23:50:34.097649Z","title":"L., Liu, Y., Shang, N., Sun, Y., Zhu, Y., Yang, F., and Yang, M","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-02T23:50:30.882987Z","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":17,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:34.097649Z"},"links":{"cited_paper":"/paper/2501.04519","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:a19057cf922280d98d958c843cd9beaa00b54a582d3d2f0e054b747ce3a9acf3","observation_id":"45829dcc-6a81-4821-b00a-25494ece48f0","resolution":{"observed_at":"2026-08-02T23:50:34.097649Z","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-02T23:50:34.181885Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":18,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:34.181885Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:742e6a0da6de4c51e83a7864ad8fa24483d2fc19d2579ef0205583a2ef71f4f5","observation_id":"71ffd370-7eb6-48c5-87c3-93bc80a5cf05","resolution":{"observed_at":"2026-08-02T23:50:34.181885Z","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-02T23:50:34.263319Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":19,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:34.263319Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:3c5de7f99cb0954a1328e2e6e063673e9797b773ebcfdb9dfa1c83e95a445f0e","observation_id":"78d42dae-4d5f-4148-a97f-f895718e8414","resolution":{"observed_at":"2026-08-02T23:50:34.263319Z","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-07-06T20:34:11.407726Z","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-02T23:50:30.882987Z","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:11615ee16e9c0e268a8c112de1abaa339030288845184d314d36b74f8a7337a6","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:50:35.827743Z","title":"and Szepesv \\'a ri, C","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":21,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:35.827743Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:5aca3b2b19b197d71b8c37efd3b2300062549ec94116e3cd388883a34c5b636b","observation_id":"e4892970-1138-4ae1-968e-3e099490f2b6","resolution":{"observed_at":"2026-08-02T23:50:35.827743Z","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-02T23:50:35.988385Z","title":"S., Reid, M., Matsuo, Y., and Iwasawa, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":22,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:35.988385Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:2b7279dbc841c34cdd8f8318b55861e196cf8731d79b2627c5e9810dd1940dcc","observation_id":"5d4ddadd-39ae-4ad6-9f88-4ed68d0e4a2a","resolution":{"observed_at":"2026-08-02T23:50:35.988385Z","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-02T23:50:36.092922Z","title":null,"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-02T23:50:30.882987Z","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":23,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.092922Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:351ea47d40011e9932136f2093d97b5bb801a7ae1f8c71b8c0cf6b636ae7f682","observation_id":"5e7c3e09-b832-45a6-bdeb-3a190e99df53","resolution":{"observed_at":"2026-08-02T23:50:36.092922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21787","last_updated":"2026-07-13T17:35:56Z","snapshot_observed_at":"2026-08-05T14:00:04.090559Z","submitted_at":"2025-08-29T17:03:47Z","title":"PiCSAR: Probabilistic Confidence Selection And Ranking for Reasoning Chains","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.21787","snapshot_observed_at":"2026-08-02T23:50:36.151220Z","title":null,"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-02T23:50:30.882987Z","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":24,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.151220Z"},"links":{"cited_paper":"/paper/2508.21787","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:cae640d01e68cb1ccc137b659670303b802ae995c29c7fae166f2885fb120efc","observation_id":"139f9dd6-83a6-44c7-93dc-d1aef4779fe6","resolution":{"observed_at":"2026-08-02T23:50:36.151220Z","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-02T23:50:36.228755Z","title":"Refusion: A diffusion large language model with parallel autoregressive decoding","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-02T23:50:30.882987Z","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":25,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.228755Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:8cc9ee23c0d639c8429040fde44da508c13c05353c1730c6648d37aac21f4223","observation_id":"34e12ecc-4b00-4b92-ac5c-2eae2af95781","resolution":{"observed_at":"2026-08-02T23:50:36.228755Z","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":"10.24963/ijcai.2023/750","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"X., and Wen, J","venue":null,"work_id":"99663eea-704c-4449-b5a1-33a378506eeb","year":2023},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":26,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.321582Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:e092e19b17af7a66bb8d27ac3b4e59ca6ab8c31cd6a534adf787f7de4c7e52d1","observation_id":"3c6106b0-ffba-4356-8476-939110b580ae","resolution":{"observed_at":"2026-08-02T23:53:24.372204Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-02T23:50:36.372365Z","title":"Deepseek-v3 technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":27,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.372365Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:a5dde682c34038cfadaa95dd3d9ccfc467f8bc3f4d6d788b90b7a8bb74e5f1a5","observation_id":"2af15af7-6ce3-4836-bfa3-f6fbfaefef5f","resolution":{"observed_at":"2026-08-02T23:50:36.372365Z","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-02T23:50:36.425710Z","title":"Faithful chain-of-thought reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":28,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.425710Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:827e8d82b4c2327718f1ba51b5f2105d68c46d53c80cb49f5526445ea08c233c","observation_id":"a9cdd754-8ce3-4abd-970f-7b7cfc0cdcaf","resolution":{"observed_at":"2026-08-02T23:50:36.425710Z","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-02T23:50:36.505682Z","title":"Large language diffusion models","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-02T23:50:30.882987Z","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":29,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.505682Z"},"links":{"cited_paper":"/paper/2502.09992","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:25c06ff68df3fd7dbed6fb9e5f90ee674e29bfced50fbdb9f93ba13a4ec53f66","observation_id":"4bb2bd42-1da3-4f77-a915-7046722d8323","resolution":{"observed_at":"2026-08-02T23:50:36.505682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22660","last_updated":"2025-06-27T17:25:28Z","snapshot_observed_at":"2026-07-06T21:32:23.537939Z","submitted_at":"2025-05-28T17:59:37Z","title":"Maximizing Confidence Alone Improves Reasoning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22660","snapshot_observed_at":"2026-08-02T23:50:36.590400Z","title":"Maximizing confidence alone improves reasoning","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-02T23:50:30.882987Z","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":30,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.590400Z"},"links":{"cited_paper":"/paper/2505.22660","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:c2dea991ef66157dd642f2b2f13cd843c0bb01e7ed4062c3eeaa3c7b1b054877","observation_id":"b9719a30-cfbc-42c4-8bad-17f8153865cb","resolution":{"observed_at":"2026-08-02T23:50:36.590400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03164","last_updated":"2025-09-06T17:12:52Z","snapshot_observed_at":"2026-08-04T13:19:08.533134Z","submitted_at":"2025-05-24T19:13:29Z","title":"Test-Time Scaling of Diffusion Models via Noise Trajectory Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03164","snapshot_observed_at":"2026-08-02T23:50:36.643314Z","title":"and Mardani, M","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-02T23:50:30.882987Z","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":31,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.643314Z"},"links":{"cited_paper":"/paper/2506.03164","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:fe011bc9348d5dc97181eec9ed0cf8ed59fd96f935282981a330cd206ee3b9fe","observation_id":"8308d123-605f-4ff2-8bd0-a1954d5bd568","resolution":{"observed_at":"2026-08-02T23:50:36.643314Z","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-02T23:50:36.695921Z","title":"L., Stickland, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":32,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.695921Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:b9e132e547e62af9948ad8d7d47aa083a81086714555661cf2302a574aff8590","observation_id":"93266487-a8c8-4ec8-97c0-6925987ca4ca","resolution":{"observed_at":"2026-08-02T23:50:36.695921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01928","last_updated":"2026-08-05T00:02:32Z","snapshot_observed_at":"2026-08-06T17:56:42.868316Z","submitted_at":"2025-06-02T17:47:27Z","title":"Esoteric Language Models: A Family of Any-Order Diffusion LLMs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01928","snapshot_observed_at":"2026-08-02T23:50:36.786718Z","title":"S., Yang, Z., Akhauri, Y., Liu, J., Singh, D., Cheng, Z., Liu, Z., Xing, E., Thickstun, J., and Vahdat, A","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-02T23:50:30.882987Z","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":33,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.786718Z"},"links":{"cited_paper":"/paper/2506.01928","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:a550210303070178a8e7b4198ba51ad1ec153c266032a29b5db663b7e87fe5c1","observation_id":"d1eabddf-5ea9-4e00-8bfc-a4a9fe9e51e7","resolution":{"observed_at":"2026-08-02T23:50:36.786718Z","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-02T23:50:36.842450Z","title":"Mastering atari, go, chess and shogi by planning with a learned model","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":34,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.842450Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:358ab4347da85ff4466327b9880a4029fc71742c6dc1eb0ff56896d21d112b6d","observation_id":"a4c5ff5e-48e5-40ec-bd26-e839ec4c17dd","resolution":{"observed_at":"2026-08-02T23:50:36.842450Z","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-02T23:50:36.919826Z","title":"Confident adaptive language modeling","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":35,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.919826Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:9cf1854c0315f34c7b826250eff75a072fba44eb8513b1feb27902938d92f805","observation_id":"3ae584a0-0b56-400a-b64c-3cb02404691a","resolution":{"observed_at":"2026-08-02T23:50:36.919826Z","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-02T23:50:36.976336Z","title":"Mastering the game of Go without human knowledge","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":36,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:36.976336Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:14b061b531ba26d1cda0f12ee31c56df39651a778d3df52bd458135fc9f9737a","observation_id":"cd9a8cbe-8f49-4ba6-9951-5c6ca0b89cbf","resolution":{"observed_at":"2026-08-02T23:50:36.976336Z","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-02T23:50:37.048098Z","title":"P., Kumar, A., Ermon, S., and Poole, B","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":37,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.048098Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:c4cf7ab4ecebb6719eec10f24669359a3fad9856653d15910703e3010b8692ea","observation_id":"5942dc92-96c3-457c-985f-6ffc4a495e32","resolution":{"observed_at":"2026-08-02T23:50:37.048098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-02T23:50:37.120595Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":38,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.120595Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:4b06058d8196f480bc4447e1c1c7e18d2ac7b6c7b49ed890b35b41d7977c7bf3","observation_id":"085b97d4-a42d-488e-9095-4ce405b730b7","resolution":{"observed_at":"2026-08-02T23:50:37.120595Z","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-02T23:50:37.175711Z","title":"Neurosymbolic diffusion models","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-02T23:50:30.882987Z","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":39,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.175711Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:87c494dfc21da9986dd6d192cb3d562b1b8153dfbb27a27bad36f4bb34ea9270","observation_id":"381e937c-09ea-4e15-8457-11b6aa6f6f70","resolution":{"observed_at":"2026-08-02T23:50:37.175711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12468","last_updated":"2026-05-27T05:13:38Z","snapshot_observed_at":"2026-07-06T20:38:20.545914Z","submitted_at":"2025-02-18T02:55:48Z","title":"MCTS-Judge: Test-Time Scaling in LLM-as-a-Judge for Code Correctness Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12468","snapshot_observed_at":"2026-08-02T23:50:37.256423Z","title":"Mcts-judge: Test-time scaling in llm-as-a-judge for code correctness evaluation","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-02T23:50:30.882987Z","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":40,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.256423Z"},"links":{"cited_paper":"/paper/2502.12468","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:d7bae8ee17e0e485d77ba64d9d924fe2f0115dafc8800e26a04baecdf99a2540","observation_id":"0b249095-fb61-459f-8d5e-0940487ef7c8","resolution":{"observed_at":"2026-08-02T23:50:37.256423Z","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-02T23:50:37.315576Z","title":"H., Le, Q","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":41,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.315576Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:6809c9a1b7e2453fea15fba575a2b8e1703dae60e37f124135e5fa8221aae182","observation_id":"60ad7355-eeeb-49e1-841d-71e24ca0b694","resolution":{"observed_at":"2026-08-02T23:50:37.315576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18478","last_updated":"2025-06-02T14:26:19Z","snapshot_observed_at":"2026-08-01T15:54:44.693739Z","submitted_at":"2024-11-27T16:19:00Z","title":"Beyond Examples: High-level Automated Reasoning Paradigm in In-Context Learning via MCTS","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18478","snapshot_observed_at":"2026-08-02T23:50:37.403405Z","title":"Beyond examples: High-level automated reasoning paradigm in in-context learning via mcts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":42,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.403405Z"},"links":{"cited_paper":"/paper/2411.18478","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:5c577d6b101e0d412793f35015ee312e34a6437328e1156da259bd1e0861042e","observation_id":"e0269569-8b09-46a6-aec1-d9632582d72d","resolution":{"observed_at":"2026-08-02T23:50:37.403405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00451","last_updated":"2024-06-17T22:11:49Z","snapshot_observed_at":"2026-07-06T18:08:09.361079Z","submitted_at":"2024-05-01T11:10:24Z","title":"Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00451","snapshot_observed_at":"2026-08-02T23:50:37.479610Z","title":"P., Kawaguchi, K., and Shieh, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":43,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.479610Z"},"links":{"cited_paper":"/paper/2405.00451","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:de2b9910475e27dce11b91cea036b3693a7e8889273ade5e7cdcb8d28b01253e","observation_id":"1427f7f5-f06b-4302-885a-0aeb295ecd74","resolution":{"observed_at":"2026-08-02T23:50:37.479610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-02T23:50:37.581338Z","title":"Qwen3 technical report","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-02T23:50:30.882987Z","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":44,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.581338Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:5e5c43be42b5b00dacb1b55bb409af017a5782da792c8b3403ea500bba6b38d3","observation_id":"4a8173bf-d2b2-4b58-b09e-770493cc9ff2","resolution":{"observed_at":"2026-08-02T23:50:37.581338Z","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-02T23:50:37.725988Z","title":"Markov chain of thought for efficient mathematical reasoning","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-02T23:50:30.882987Z","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":45,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.725988Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:c04ab7e7199535598b7c138a3783a21c5a82920919f8d6c516e74c0b219ead18","observation_id":"79148512-a3d3-46f4-bb69-01b9f2aa00e4","resolution":{"observed_at":"2026-08-02T23:50:37.725988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.15487","last_updated":"2025-08-21T12:09:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-21T12:09:58Z","title":"Dream 7B: Diffusion Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.15487","snapshot_observed_at":"2026-08-02T23:50:37.836659Z","title":"Dream 7b: Diffusion large language models","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-02T23:50:30.882987Z","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":46,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.836659Z"},"links":{"cited_paper":"/paper/2508.15487","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:610bdf6062416c298690ee24bff0a3e377cc08ea0b7a221975464a9853f739b6","observation_id":"0983324b-6b27-4bf6-b2bf-4526746ad8a6","resolution":{"observed_at":"2026-08-02T23:50:37.836659Z","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-02T23:50:37.958096Z","title":"Monte carlo tree diffusion for system 2 planning","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-02T23:50:30.882987Z","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":47,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:37.958096Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:845b32b96975894d282663a20e4380b932991b3ce9cf6a9cd0c1288c9219a730","observation_id":"57e04f07-361b-42c7-84a4-2da7c74816b8","resolution":{"observed_at":"2026-08-02T23:50:37.958096Z","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-02T23:50:38.090016Z","title":"Fast monte carlo tree diffusion: 100x speedup via parallel sparse planning","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-02T23:50:30.882987Z","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":48,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:38.090016Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:f9cf6d23e0e1695197d918fee110bf09e56198c7ccf7ea597d96241876c75694","observation_id":"2be81689-a503-4de1-8f44-fa9f8e7bdc8c","resolution":{"observed_at":"2026-08-02T23:50:38.090016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12216","last_updated":"2025-06-03T17:02:25Z","snapshot_observed_at":"2026-07-06T21:10:27.209188Z","submitted_at":"2025-04-16T16:08:45Z","title":"d1: Scaling Reasoning in Diffusion Large Language Models via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.12216","snapshot_observed_at":"2026-08-02T23:50:38.177661Z","title":"d1: Scaling reasoning in diffusion large language models via reinforcement learning","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-02T23:50:30.882987Z","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":49,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:38.177661Z"},"links":{"cited_paper":"/paper/2504.12216","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:5a2562e7afed19d740d94dcb14214ead04cac70edde8705e163a658ddacbc0c6","observation_id":"01373c77-85f0-4e11-9502-b8aea1c6ff96","resolution":{"observed_at":"2026-08-02T23:50:38.177661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19223","last_updated":"2025-10-12T15:42:47Z","snapshot_observed_at":"2026-07-06T21:30:09.658226Z","submitted_at":"2025-05-25T16:36:20Z","title":"LLaDA 1.5: Variance-Reduced Preference Optimization for Large Language Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19223","snapshot_observed_at":"2026-08-02T23:50:38.292919Z","title":"Llada 1.5: Variance-reduced preference optimization for large language diffusion models","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-02T23:50:30.882987Z","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":50,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:38.292919Z"},"links":{"cited_paper":"/paper/2505.19223","citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:1f5de112ad98afe842267efb9673887cd24f206ae410c0c788943a4508bed0c3","observation_id":"78d28a7b-10b4-40a7-a50e-fbf4db56026a","resolution":{"observed_at":"2026-08-02T23:50:38.292919Z","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-02T23:50:38.432807Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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":51,"source":"arxiv_source","source_observed_at":"2026-08-02T23:50:38.432807Z"},"links":{"citing_paper":"/paper/2602.12586"},"observation_digest":"sha256:6963a6b2483cedf31d9f586ea9036e8dad5b5ca21966b369c59bf6cccb4eb711","observation_id":"de809d27-2ea7-494b-b4a9-6c955f0b4cae","resolution":{"observed_at":"2026-08-02T23:50:38.432807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.12586","last_updated":"2026-05-27T16:01:59Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-02T23:50:30.882987Z","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"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":51},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2602.12586."}