{"as_of":"2026-08-15T12:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71dcfe9fcfa1b1f445b84b49534cd785d72be18bf3adecb4411d13fa100d331a","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:16:40.203473Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2608.13520/citation-record","integrity":"/paper/2608.13520/integrity","json":"/paper/2608.13520/citation-record.json","paper":"/paper/2608.13520"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:41.013813Z","title":"Spencer , edition =","venue":null,"work_id":"c56a05d7-4655-4733-a8a0-23aaec229d9d","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.011522Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:70912d7b90f65e550d49a017522f003891cefa066b18954975cdab1653070534","observation_id":"af4a9608-9912-4bbc-bb72-d53a1701ab80","resolution":{"observed_at":"2026-08-14T05:16:41.016919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.017643Z","title":"Chen and K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.017643Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:dcbdee2ed4d011d2505600c2c947db9b115342d1dffaa57c88bdb5202346566a","observation_id":"50715eda-0ec3-4943-801e-3548c49ff70d","resolution":{"observed_at":"2026-08-14T05:16:40.017643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.15008","last_updated":"2026-06-30T17:47:17Z","snapshot_observed_at":"2026-08-13T23:35:47.414345Z","submitted_at":"2026-02-16T18:48:17Z","title":"Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.15008","snapshot_observed_at":"2026-08-14T05:16:40.021221Z","title":"Dmitriev and Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.021221Z"},"links":{"cited_paper":"/paper/2602.15008","citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:148e84dfd7a80874487975c1946ea123bfbe23f250b49324fef0b2e66146fe7e","observation_id":"a408aa4e-204b-42b6-8015-e8eb22d3474c","resolution":{"observed_at":"2026-08-14T05:16:40.021221Z","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-14T05:16:40.025206Z","title":"arXiv , arxivid =:2506.02318 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.025206Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:c6655fde29aa8bdfbb6144d7d8d9031046c579099e86dfead20eeb7f8c648d74","observation_id":"cddad349-7876-43bb-8f38-dacb22217096","resolution":{"observed_at":"2026-08-14T05:16:40.025206Z","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-14T05:16:40.028807Z","title":"arXiv , arxivid =:2509.16756 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.028807Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:b14529e449ad4939e16280d3eb64e442a75afe0c5698a2297be37bc80289be3f","observation_id":"9a6782e2-acbe-4702-b4c4-7cab2e9fd0d5","resolution":{"observed_at":"2026-08-14T05:16:40.028807Z","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-14T05:16:40.032646Z","title":"Rotskoff and Molei Tao and Lexing Ying , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.032646Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:2eb831900d380c8931edfc79556d8cc881692b22eb0d47aac64fb960e73a05b3","observation_id":"59fb2c95-bcd1-493e-a364-6e52f5d79ab6","resolution":{"observed_at":"2026-08-14T05:16:40.032646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03601","last_updated":"2025-03-02T07:27:46Z","snapshot_observed_at":"2026-08-15T06:12:39.772477Z","submitted_at":"2024-10-04T16:59:29Z","title":"How Discrete and Continuous Diffusion Meet: Comprehensive Analysis of Discrete Diffusion Models via a Stochastic Integral Framework","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03601","snapshot_observed_at":"2026-08-14T05:16:40.036522Z","title":"Rotskoff and Lexing Ying , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.036522Z"},"links":{"cited_paper":"/paper/2410.03601","citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:9bce0a5aad9a0e6f79186fd30348f48f581dc12c15efb7f163a5c6ca6cac45cb","observation_id":"f4461d69-5d6f-4bee-b859-928ffc4fd78c","resolution":{"observed_at":"2026-08-14T05:16:40.036522Z","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-14T05:16:41.005048Z","title":"Gillespie , doi =","venue":null,"work_id":"6082af0b-ab6e-4064-be3a-3168a8fb9afe","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.040055Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:9708b0ee2559d2d14021ee35c4ec29aafe781f55b2b8249d01dfdfc2540ed570","observation_id":"2e18ee52-7aa1-4630-856a-df24fd2905dc","resolution":{"observed_at":"2026-08-14T05:16:41.008225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.994804Z","title":"Petzold and Yang Cao and Daniel T","venue":null,"work_id":"ff3179c0-43a9-42ef-9da5-bb8c6a9bce8d","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.043761Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:890ee1a59ef49295e1d7a759b55783c8c15ed3cf1ca6cf8d7ddcddcd79524766","observation_id":"2442ec19-4f01-421a-8076-d28b09c02300","resolution":{"observed_at":"2026-08-14T05:16:40.998045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.984550Z","title":"Analysis of Explicit Tau-Leaping Schemes for Simulating Chemically Reacting Systems , volume =","venue":null,"work_id":"e3030825-4266-4ee5-8359-b97e0aca5e35","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.046996Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:c260bedff413f1881fe7a8a369de111031088065dfd7e616be3bb8c70c038cec","observation_id":"0d4bcfce-a1b5-4e3a-8efd-0128d7c6ad97","resolution":{"observed_at":"2026-08-14T05:16:40.987676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.975339Z","title":"Anderson and Arnab Ganguly and Thomas G","venue":null,"work_id":"2ede9fe3-e8d6-4cdc-bf43-1cb94b5f0d2d","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.049953Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:d773f31023885c911230c361fc64e2438a38bf055b9637f91f62c990d3c59866","observation_id":"1547e12d-87ca-4d56-8058-538dd754e72b","resolution":{"observed_at":"2026-08-14T05:16:40.979070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.965486Z","title":"Linear Dependence Structure of the Entropy Space , volume =","venue":null,"work_id":"bbdb39cd-e5ac-40d4-a4ac-67f03b0de185","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.053895Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:45e357d505bc1526b20d34ee83af5c960d606826ef22733fd865fdf8e2b44b7e","observation_id":"001071e2-8027-447b-b230-846de6da404c","resolution":{"observed_at":"2026-08-14T05:16:40.969167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.956499Z","title":"Nonnegative Entropy Measures of Multivariate Symmetric Correlations , volume =","venue":null,"work_id":"fb04ec9a-397b-480f-ad60-9600123049f0","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.057486Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:a6dd286e34a925ad5fbb43a4df3910913b67a7150d418dcfff6026d5f3898772","observation_id":"753a97ca-ad43-4f64-98e5-360ffaa3e6c2","resolution":{"observed_at":"2026-08-14T05:16:40.959826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.947532Z","title":"Information Theoretical Analysis of Multivariate Correlation , volume =","venue":null,"work_id":"983c0f5c-f797-46f1-ba2f-48928d2eee81","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.060588Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:28c176e7563c0dd4e7bd7443f7be2a197c25d6520cfcd75f7664425e9ea99d0a","observation_id":"d1bd98ef-73bf-4ef1-ae21-ba498e380416","resolution":{"observed_at":"2026-08-14T05:16:40.950666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.937892Z","title":"Proceedings of the 22nd Conference on Learning Theory , eprint =","venue":null,"work_id":"e3a744c4-7bff-458f-8358-0d4a3ac0890f","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.063762Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:7c7700c70869cc8f583c5631cb6eac7289b63c4a61f2dd64ee8182d63bec2a55","observation_id":"253deee6-dfc0-4018-a557-ec0c7c4d7535","resolution":{"observed_at":"2026-08-14T05:16:40.941084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.26285","last_updated":"2026-07-28T21:26:16Z","snapshot_observed_at":"2026-08-06T04:08:52.691345Z","submitted_at":"2026-07-28T21:26:16Z","title":"Denoising growth complexity: Data geometry and certified schedules for diffusion sampling","version":1},"cited_work":{"arxiv_id":"2607.26285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.26285","snapshot_observed_at":"2026-08-14T05:16:40.398143Z","title":"Denoising growth complexity: Data geometry and certified schedules for diffusion sampling","venue":"math.ST","work_id":"d3d39466-8443-471a-b792-3da102dc4217","year":2026},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.067236Z"},"links":{"cited_paper":"/paper/2607.26285","citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:f82ebb390120478b9900f7d8df06e07eb3c4260db8a52a7baee5d5c7885bad97","observation_id":"72337f90-ea09-4833-984b-c8fd3dbb2ad6","resolution":{"observed_at":"2026-08-14T05:16:40.404001Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00440-011-0350-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.262655Z","title":"Approximate Maximizers of Intricacy Functionals , volume =","venue":null,"work_id":"9875e067-e265-4072-ae33-4642d6dfa2e9","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.070828Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:6e937977d6dd630448cff0c57c3d7060dae1ed0c55ae75ee1ddb927569d4e6bb","observation_id":"3990b148-94c9-4adf-8568-44725ba1cd1d","resolution":{"observed_at":"2026-08-14T05:16:40.266107Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/11-aihp416","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.252001Z","title":"Mean Mutual Information and Symmetry Breaking for Finite Random Fields , volume =","venue":null,"work_id":"adee2b35-d43d-4d18-82b9-863bbea95eab","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.074600Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:e00d0208800577fa0fe0f12e37b00c8baa5d107103129b95c2976d0dcc7b89fa","observation_id":"72978f20-065e-47b5-80eb-2cc8ab976d69","resolution":{"observed_at":"2026-08-14T05:16:40.256106Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.929079Z","title":"Edelman , doi =","venue":null,"work_id":"6d706fc0-9f78-4bd6-82e3-365c3c015dd0","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.077681Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:72691bcb639cf30aed4694948d771507f0e25634e55f4b54c9aa4f5d49e6313a","observation_id":"192eb0e7-f883-4569-b070-d8f404bbb3ff","resolution":{"observed_at":"2026-08-14T05:16:40.932299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1140/epjb/e2008-00134-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.240526Z","title":"How Should Complexity Scale with System Size? , volume =","venue":null,"work_id":"cc38ee62-13f9-4869-91d0-565d1fdb7caa","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.080574Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:6ea01f1b657384fbae63c3b8b295989d4e5b113d1a49540f48b9fd16ebc1b74c","observation_id":"2b17c3fe-69dc-4a78-880b-3c6d26a5fdd4","resolution":{"observed_at":"2026-08-14T05:16:40.245405Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.920016Z","title":"Buckley and Seth Bullock , doi =","venue":null,"work_id":"72c6e033-c242-4cfc-9bac-979ce35c8c6a","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.084533Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:c9b2c18d5046af696130af03c48328c93391861f8636819dd9954b3bfc65eeec","observation_id":"a128d2f6-ceb6-498e-a4fd-7b1d9b6cbb74","resolution":{"observed_at":"2026-08-14T05:16:40.923192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.910829Z","title":"Rosas and Pedro A","venue":null,"work_id":"81a041a3-e166-4472-a0df-d60693b9465b","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.087809Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:a3d4a55e53d379e9ad780d570f1b5babbefe0f77ce6fc40e691ec550dd63819b","observation_id":"b7ced698-342d-48fa-b9b3-e744b739cc32","resolution":{"observed_at":"2026-08-14T05:16:40.914039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.901023Z","title":"Varley and Maria Pope and Joshua Faskowitz and Olaf Sporns , doi =","venue":null,"work_id":"7b44b6de-e205-4f6e-808d-4aca3a221df6","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.090843Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:e8a34f03ad63e5d3f7fdd1116e153f25679390e8f154a6241a6e14b76fd4ca8d","observation_id":"68db9e08-02e2-4d35-9b1f-6d282e123b61","resolution":{"observed_at":"2026-08-14T05:16:40.904532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.891849Z","title":null,"venue":null,"work_id":"49c855aa-abff-498d-a406-84451c0be5b4","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.094063Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:db0872218958e07bd50c60b7e94451976c194d1ad3aca123c4aed60aefbfcd0d","observation_id":"026c1b04-38a1-47d0-b3c4-42abdf0b6f52","resolution":{"observed_at":"2026-08-14T05:16:40.894981Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.882229Z","title":null,"venue":null,"work_id":"fcb329b7-8982-4e26-995d-29c85dbca049","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.097105Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:2318c8e428a304848a68a21830821df0e0e3bd8be20f7ba458cde432172ffecd","observation_id":"5f4a212d-dd89-4986-bc5b-f2cee6ca5ee7","resolution":{"observed_at":"2026-08-14T05:16:40.886510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.101259Z","title":"doi:10.18653/v1/D19-1633 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.101259Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:59c93740a0a8004b22be69884bcbc76b945f7a7ae979cadc800f3b3abf8d069c","observation_id":"860c3e7c-7485-4dc8-a713-472df1bd9e3c","resolution":{"observed_at":"2026-08-14T05:16:40.101259Z","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-14T05:16:40.872717Z","title":"Freeman , booktitle =","venue":null,"work_id":"68304d5e-b5b6-443a-ac00-a910210fa173","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.104424Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:2718358849612c468246fd72137705a5f4ee37f40a80fc56663ffc309660d453","observation_id":"f99b5111-4345-4e4e-9d4e-66a0e2caebdd","resolution":{"observed_at":"2026-08-14T05:16:40.875699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.863038Z","title":"Freeman and Michael Rubinstein and Yuanzhen Li and Dilip Krishnan , booktitle =","venue":null,"work_id":"4f111593-59bf-4435-a7a9-9f398871e0f3","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.108435Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:73c7594d354a787ff356d2c0d6cef4996ee46a4bfd0d36a804a4604d589bbef5","observation_id":"fcb39b54-ad3d-4b2a-bd46-0178b0400c4e","resolution":{"observed_at":"2026-08-14T05:16:40.867068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.854122Z","title":"Hauptmann and Ming-Hsuan Yang and Yuan Hao and Irfan Essa and Lu Jiang , booktitle =","venue":null,"work_id":"c92ad63d-6d37-4d85-bc4c-afa9674bec3f","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.111938Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:8b5d90eaa1a119a6664bae88922c2ece230faa1b730402d875d1232c0df36a3b","observation_id":"a8a75ee6-72e3-4dcc-be2d-63866f6c0bfa","resolution":{"observed_at":"2026-08-14T05:16:40.857421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.844587Z","title":"Chiu and Alexander Rush and Volodymyr Kuleshov , booktitle =","venue":null,"work_id":"4c207a85-4136-4cbf-96b0-24ae317ba084","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.115010Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:de8ee1ac76823454de67f9b37b498322327f3a0b700470623f2405ec9e6bd7cb","observation_id":"4b0d653a-170e-4479-acca-13d864b76e67","resolution":{"observed_at":"2026-08-14T05:16:40.847952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.835067Z","title":"Diffusion Language Models Are Versatile Protein Learners , volume =","venue":null,"work_id":"222de241-d22f-417d-a808-074011f54535","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.118661Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:8d52e51b31e8f29a93463c5fb00b61ee05bd9063b59b4815b823ef962349e181","observation_id":"6d7d8809-8aa0-481f-bfe1-1df887e378c2","resolution":{"observed_at":"2026-08-14T05:16:40.838173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.826430Z","title":null,"venue":null,"work_id":"badf8ffa-c0d3-4ea6-8fbe-3c351d723400","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.121818Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:4b7d012300b45fa1eb51e542d922e53c92009942d071cc1d291578e843aeca6e","observation_id":"6faeb5a3-3b09-436a-873b-579acb939090","resolution":{"observed_at":"2026-08-14T05:16:40.829650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.817568Z","title":"Large Language Diffusion Models , volume =","venue":null,"work_id":"228c6304-e3d1-4d1b-b392-ebf929a5a191","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.125713Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:0b47c1c430858e3f929f1eae76bc89728c659f0990a05c75ce89004101dc9e5d","observation_id":"313a6535-cc04-4ba1-9e58-f435af657f60","resolution":{"observed_at":"2026-08-14T05:16:40.820802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.807733Z","title":"and De Bortoli, V","venue":null,"work_id":"fa5c3c66-74e1-4205-aaff-da966622c87e","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.130125Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:5fc51a73173a9f0af66ed3c58ef65789bb2b7706a37695dff3592bf26269f073","observation_id":"902eea21-d3dc-436e-a03e-d93cda7e409e","resolution":{"observed_at":"2026-08-14T05:16:40.811961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.797113Z","title":"Brooks and A","venue":null,"work_id":"90f9ba18-af16-472d-b4fb-ce5371ce5b19","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.133094Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:168b3e1ad6bd77399532f2d45fa4b3c6c17a1b598afbe98d582000095300ea40","observation_id":"7ca6317a-0d9b-414e-8bad-d22abba5ce08","resolution":{"observed_at":"2026-08-14T05:16:40.800999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01916","last_updated":"2023-02-02T10:34:04Z","snapshot_observed_at":"2026-08-13T13:49:59.797720Z","submitted_at":"2022-11-03T15:51:00Z","title":"Improved Analysis of Score-based Generative Modeling: User-Friendly Bounds under Minimal Smoothness Assumptions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01916","snapshot_observed_at":"2026-08-14T05:16:40.137124Z","title":"Chen and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.137124Z"},"links":{"cited_paper":"/paper/2211.01916","citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:d2bb24d5d0802dab2303ed35dd1a5904c19dc39110d9ccb17abe5ec6c814ca13","observation_id":"f654162f-493d-4c63-990f-cd0ccbf848ce","resolution":{"observed_at":"2026-08-14T05:16:40.137124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11215","last_updated":"2023-04-15T22:24:53Z","snapshot_observed_at":"2026-08-15T08:59:54.445812Z","submitted_at":"2022-09-22T17:55:01Z","title":"Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11215","snapshot_observed_at":"2026-08-14T05:16:40.141182Z","title":"Chen and S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.141182Z"},"links":{"cited_paper":"/paper/2209.11215","citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:f19325f7b743dcf1bf80855a7bcde5515db3ed05a570e5e71091c789e70c369f","observation_id":"3d8f38d7-66a4-49ad-92a4-4378712f441c","resolution":{"observed_at":"2026-08-14T05:16:40.141182Z","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-14T05:16:40.788644Z","title":"and Mei, S","venue":null,"work_id":"8d88e468-19d6-4df6-8b35-9c2bd4ef8593","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.144838Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:d5527d9dd28646edbd5308a3aa4dce30b8b3d12b643e57b4743908ad07f1ffcd","observation_id":"ca6516b9-5be1-4cbb-8a0b-fd8bf6bfcb7e","resolution":{"observed_at":"2026-08-14T05:16:40.791673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.778791Z","title":"Croitoru and V","venue":null,"work_id":"83679f63-df9e-456b-aa52-6e8a34609471","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.147957Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:76bc7c7bf56b0764d23d28e998bf23be70d5a39c19d592f2bce72e333e317167","observation_id":"e70ae28a-dd7c-4c0a-9706-e6be42818296","resolution":{"observed_at":"2026-08-14T05:16:40.782494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.770024Z","title":"Gelman and J","venue":null,"work_id":"12961793-0f89-4ff6-92c1-b2b470c11430","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.151921Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:7ecce3cde78712f96992295c7d954ff2521f20e0382cbe3b18745dd28fbf7481","observation_id":"5958016a-021d-442f-959e-e74b055e9bf8","resolution":{"observed_at":"2026-08-14T05:16:40.772984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.759562Z","title":"Ho and A","venue":null,"work_id":"c8831b03-5c43-4053-a0c6-d958a6581e6c","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.155023Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:3321d06582ca3063e39cc19b2a7c99261e3ad5eea0582687ff79dfb0a0bbfafa","observation_id":"ac9b226a-7149-4ace-86a7-2d396e335ca8","resolution":{"observed_at":"2026-08-14T05:16:40.762895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.749904Z","title":"and Casella, George , title =","venue":null,"work_id":"2425951d-b99a-42d9-b1af-e8edcb9466c3","year":2004},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.158388Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:31c0f0a6b03bb8df80b87388c4f4b4f5dd96ac77d61a411fb53346dbc8a3690f","observation_id":"088475ab-f1f6-4b16-9d45-b9128284866a","resolution":{"observed_at":"2026-08-14T05:16:40.753721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.740459Z","title":"Rombach and E","venue":null,"work_id":"2baf75e0-59e7-4e6d-9708-7cdcea1424ca","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.162609Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:6d0ec8d398b9c8a57c4831557d598db784445aa3bbd81358e52491c63113817c","observation_id":"f14160bd-f051-4f83-8201-58bcd5f6e6cc","resolution":{"observed_at":"2026-08-14T05:16:40.743874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.731228Z","title":null,"venue":null,"work_id":"0e98df73-7374-4929-9f43-eb3ecffc068a","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.165681Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:b72a28552045996dfde6cba5a275e549492f1bc3436b6572723c95d134425fe4","observation_id":"913c658d-e58d-438a-b3ed-6b7257e3a796","resolution":{"observed_at":"2026-08-14T05:16:40.734505Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.721658Z","title":"Sohl‑Dickstein and E","venue":null,"work_id":"9d1e5064-594b-4cf9-a5d0-7395c0ffbc9f","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.169731Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:6deffede960e516e9bc0a2feb8344d0237d6280a304cb4802f4fe288dda31e26","observation_id":"a074ba6c-64a4-405a-87a1-4632aa97def0","resolution":{"observed_at":"2026-08-14T05:16:40.724762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.712373Z","title":"Song and S","venue":null,"work_id":"250c42b0-8b60-4731-8e11-1a4c52fd66af","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.173206Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:e1addd7583e662d19e8b0bc344c858a77fd5a34704de8a3a8fc5b0641d98c4e2","observation_id":"f1253589-ea4d-45df-b805-2e31d3777bd7","resolution":{"observed_at":"2026-08-14T05:16:40.715715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.701681Z","title":"Song and J","venue":null,"work_id":"c3f93db0-019f-4944-a8d0-4669f9767060","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.177301Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:86d8048c3f498596287947b2ee5e2b9f293e4688e8c73c29763b36884652295a","observation_id":"3e2ea06a-5d8d-4f13-9a42-5e4aa2bdd60f","resolution":{"observed_at":"2026-08-14T05:16:40.705351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.690813Z","title":"Yang and Z","venue":null,"work_id":"a9925bb0-6fe1-4b32-80de-6a213a9de333","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.180516Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:b3b9d84a1dbefae452bb4267b2e7635b89bef17a36e3ce7f3557f74a1f6e6611","observation_id":"e5d09573-877f-4a18-a992-a7227459a469","resolution":{"observed_at":"2026-08-14T05:16:40.693872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.681040Z","title":"Advances in Neural Information Processing Systems , title =","venue":null,"work_id":"28867ad2-c353-4c84-a085-6ffa23b8b7c6","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.183520Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:d02e6624b0d2543708c3096067fa50e009f623860ffc4fc9bf9e211219db4ac4","observation_id":"1ebda6e3-fd43-45d7-bc05-c9b2491a544c","resolution":{"observed_at":"2026-08-14T05:16:40.684553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.670065Z","title":"Johnson and Jonathan Ho and Daniel Tarlow and Rianne van den Berg , booktitle =","venue":null,"work_id":"56a6a97d-0a2d-4fe0-b921-7759c6d65e1b","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.187335Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:46db999c6fd9971d9a15ae32f69d020ebdc76ae44d1145e49b3408d2d45415ea","observation_id":"164c423c-224d-4e18-bc23-9c47165d3495","resolution":{"observed_at":"2026-08-14T05:16:40.674249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.190370Z","title":"doi:10.52202/068431-2049 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.190370Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:703dc5263e990ccdeeea3ed01d78dfc2185f4a8ef4792a8ce085091fd8794ca8","observation_id":"c82825f8-7fc4-44c7-b002-5f72ab720377","resolution":{"observed_at":"2026-08-14T05:16:40.190370Z","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-14T05:16:40.659222Z","title":"Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution , url =","venue":null,"work_id":"5b05959b-46b1-4a82-aa88-93449496071b","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.193830Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:e7f4e6a59440111b1865ffbe0b1a5cb5876bc897e4e028422f4945381d78b0ad","observation_id":"cac248d4-5d88-45af-981a-e91d73643455","resolution":{"observed_at":"2026-08-14T05:16:40.662653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:16:40.648791Z","title":"Titsias , booktitle =","venue":null,"work_id":"486f712e-521f-47dc-b25a-a747d1493d1f","year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.197105Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:375f348a6987e496b0e65591fd990e011c947114a6b4ccd0ecdd52ea64c3adbd","observation_id":"34152eee-59a9-432d-8dc7-f54c8ca456f2","resolution":{"observed_at":"2026-08-14T05:16:40.652416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:16:40.200289Z","title":"arXiv , arxivid =:2505.21400 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.200289Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:cd99da5bcd89de2bffc0f9822178d5acb788e4fcb54ef157b440283e953387b0","observation_id":"d39b3324-0b73-4370-ab5b-8ea2e02a59f5","resolution":{"observed_at":"2026-08-14T05:16:40.200289Z","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-14T05:16:40.203473Z","title":"arXiv preprint arXiv:2510.25544 , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T05:16:40.203473Z"},"links":{"citing_paper":"/paper/2608.13520"},"observation_digest":"sha256:6e4d54e5bca70b460fb8289eb0f893b0ee428bad96768b3d7f5afa724033175a","observation_id":"b796ee63-6837-403e-9c40-8c627ada3b5e","resolution":{"observed_at":"2026-08-14T05:16:40.203473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.13520","last_updated":"2026-08-13T17:40:17Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T12:18:49.456055Z","submitted_at":"2026-08-13T17:40:17Z","title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":35},"total_outbound_references":55},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2608.13520."}