{"as_of":"2026-08-10T00:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30da3bdb8a33839901e225ed2a1c6e43c051127c300c224439453620a945e5f9","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:17:14.293280Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.19752/citation-record","integrity":"/paper/2505.19752/integrity","json":"/paper/2505.19752/citation-record.json","paper":"/paper/2505.19752"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:11.208996Z","title":"Score-based generative modeling through stochastic differential equations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.208996Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:8f34ebae24ccab53c91119cbb95e3de040e6393d7f15c0dee804f8c207135d89","observation_id":"984a620d-e4be-4da6-88ec-7ea7817aca62","resolution":{"observed_at":"2026-08-07T14:17:11.208996Z","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-07T14:17:11.292112Z","title":"Denoising diffusion probabilistic models.Advances in neural information processing systems, 33:6840–6851, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.292112Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:3ed8c7d4077d750cef4ac1a0355ea7b6b522b4b6633d0fb90cd7cffe480f41bd","observation_id":"6c4e1918-28a8-47b7-bcab-3bf994af0e22","resolution":{"observed_at":"2026-08-07T14:17:11.292112Z","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-07T14:17:11.405277Z","title":"A continuous time framework for discrete denoising models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.405277Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:074ed03900cd6c3aef40d4cff93b851b04ca0fc7c451eb76a3d1440870e40c65","observation_id":"03c6041d-d2b2-4300-b724-9a61553c8ee8","resolution":{"observed_at":"2026-08-07T14:17:11.405277Z","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-07T14:17:18.223964Z","title":"Discrete diffusion modeling by estimating the ratios of the data distribution.CoRR, 2023","venue":null,"work_id":"75d1228b-533c-4666-8650-d6b7695cf084","year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.454664Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:ed4c4f6c1984ea940708e33a1b43d5ae7777feab81d518cf8d049a1c272fe4b9","observation_id":"30fc5d1c-cfeb-4ef7-837c-5d5aece19f34","resolution":{"observed_at":"2026-08-07T14:17:18.340466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:18.048293Z","title":"Auto-encoding variational bayes.International Conference on Learning Representations (ICLR), 2014","venue":null,"work_id":"f3b9cb26-a5ce-476d-90e8-7f54da4cb695","year":2014},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.459227Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:4db70dc5c0c878612b7c90db68d70a9e297bb60a8f001d1f539cddadf6e1c607","observation_id":"9c66423e-5249-4183-8c2b-a8dfb0d6ad89","resolution":{"observed_at":"2026-08-07T14:17:18.107680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:11.464272Z","title":"Neural discrete representation learning,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.464272Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:2a037956a1019971945f195aebbfc66f31402a19f13d824595a41ed7856c91d6","observation_id":"ec2da5ca-0c7b-4300-8800-8875dbf23d66","resolution":{"observed_at":"2026-08-07T14:17:11.464272Z","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-07T14:17:17.874180Z","title":"Johnson, Jonathan Ho, Daniel Tarlow, and Rianne van den Berg","venue":null,"work_id":"0d3f1aef-f927-498f-b79e-4331f5e91b18","year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.512241Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:a8deea2a04fe6c3a590e562538f2a5afbbc6181afb3dd6545eff2d0bf58ec45a","observation_id":"28888fe4-034d-4fe5-b13e-7a27f71de82b","resolution":{"observed_at":"2026-08-07T14:17:17.947239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00802","last_updated":"2023-01-18T04:45:10Z","snapshot_observed_at":"2026-07-06T14:13:19.594909Z","submitted_at":"2022-11-02T00:41:37Z","title":"Concrete Score Matching: Generalized Score Matching for Discrete Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.00802","snapshot_observed_at":"2026-08-07T14:17:11.539037Z","title":"Concrete score matching: Generalized score matching for discrete data, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.539037Z"},"links":{"cited_paper":"/paper/2211.00802","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:e4a814c2227d7bb5f784e3bf7d85d72d8ced69de9efdf68e245eb647aa115057","observation_id":"e55bc0b1-5cc9-4f73-9468-4d29ac6d1ddc","resolution":{"observed_at":"2026-08-07T14:17:11.539037Z","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-07T14:17:11.573503Z","title":"Non-autoregressive sequence generation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.573503Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:99d187762708e2b609d882390c00e28ef716a60fa1cea7581f2be0bb451d33d0","observation_id":"b103a83a-fcce-4d73-adda-fe9597284133","resolution":{"observed_at":"2026-08-07T14:17:11.573503Z","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-07T14:17:17.705842Z","title":"Roberta: A robustly optimized bert pretraining approach.CoRR, 2019","venue":null,"work_id":"1a0b7255-3321-4b08-a851-517d961c133a","year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.623207Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:f87d430fa7b14aa016af7296ae97c9aac614d955044c4ca981448e5ec2acad71","observation_id":"8319e021-4698-4a84-b46f-2a0fcf841ca9","resolution":{"observed_at":"2026-08-07T14:17:17.799076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:11.628049Z","title":"Bert: Pre-training of deep bidi- rectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.628049Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:2eb79ac736da7a6071281db6264d7eafa3014ff515cfa96e3c0a713226a26e1e","observation_id":"807e7acd-e864-45d2-b5e2-aae4d6ada0e1","resolution":{"observed_at":"2026-08-07T14:17:11.628049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T14:17:11.683372Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.683372Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:7db18834202623ffccc17649f6719cd8ecb8dedbcf0d7154a5477c0d8ce8d7b0","observation_id":"707e3a29-3734-4888-b25d-c0c00b53dd2a","resolution":{"observed_at":"2026-08-07T14:17:11.683372Z","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-07T14:17:11.708129Z","title":"Language models are unsupervised multitask learners.OpenAI blog, 1(8):9, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.708129Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:11f807f852325636e7cbb36429a0dbcfc2d9cfbbf22d8cd5b4cd677143cd6d3b","observation_id":"41b8f902-2c8c-4dc5-a909-77491b1d8bb4","resolution":{"observed_at":"2026-08-07T14:17:11.708129Z","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-07T14:17:17.527845Z","title":"Albert: A lite bert for self-supervised learning of language representations, 2020","venue":null,"work_id":"82804493-380a-433d-b1b5-9363bef602c6","year":2020},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.712171Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:d63e20e682748bd57bc194db5f15a03f83614b0a81e2b80498d3d81c4f18eeea","observation_id":"a9499e92-cba9-440e-b332-45d5e90bcd4c","resolution":{"observed_at":"2026-08-07T14:17:17.578730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:11.761719Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.761719Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:39f9ec96b106d232b668d1ef83338f4db5ed8df90f7f6798fc23e4f12dcb3ff5","observation_id":"2775b5c7-3113-4c63-94bb-46d50b688b2d","resolution":{"observed_at":"2026-08-07T14:17:11.761719Z","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-07T14:17:11.835889Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.835889Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:048dd6b0253394004c0d7769794608606b8e6f897c76654d94c2f124d99159e7","observation_id":"305e42cd-b38a-4430-806a-63917c371591","resolution":{"observed_at":"2026-08-07T14:17:11.835889Z","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-07T14:17:17.345518Z","title":"Deep residual learning for image recognition, 2015","venue":null,"work_id":"f6b529fa-365a-43e0-83ca-8cacae1427c7","year":2015},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.899191Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:3e5d8598a16501cc0926c645d5f0a4dba92d0a4e0daf616c7c70f89372354dfd","observation_id":"c380f3a1-4dab-40dd-9e26-57dbe526f9e4","resolution":{"observed_at":"2026-08-07T14:17:17.427255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:12.004447Z","title":"Denoising diffusion implicit models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.004447Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:e230161e955ea08252fd7b0661d8561fc8020a061171d47d8ec9e24c51ccc16a","observation_id":"6e404cb8-983a-4671-b5fc-f046bc57e94b","resolution":{"observed_at":"2026-08-07T14:17:12.004447Z","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-07T14:17:12.135705Z","title":"Weiss, Niru Maheswaranathan, and Surya Ganguli","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.135705Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:86cfe9c6f063482036e913e8b4560a6358c30b47d74b28e5dde6c3351e3a21b1","observation_id":"ca59db53-ddac-4bca-8be6-25c9d9e67125","resolution":{"observed_at":"2026-08-07T14:17:12.135705Z","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-07T14:17:12.220269Z","title":"Diffusion-lm improves controllable text generation.Advances in neural information processing systems, 35:4328–4343, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.220269Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:3308a8587fd5f1d37a0117806204e174ef7e146d1cadf68b04cd64227c1c8395","observation_id":"024c0cbd-102c-4f46-be46-5a6c6905f398","resolution":{"observed_at":"2026-08-07T14:17:12.220269Z","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-07T14:17:12.288744Z","title":"Hashimoto","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.288744Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:dac8fa98f370b54224ea6e46bff9b80596fffdd9b6c3d79e3a802a8ce4759abf","observation_id":"676180f1-f400-489d-ada9-37704337d1d8","resolution":{"observed_at":"2026-08-07T14:17:12.288744Z","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-07T14:17:17.078596Z","title":"Score-based continuous-time discrete diffusion models, 2023","venue":null,"work_id":"4a95d241-8d5c-44fd-baa6-bf5a19b60169","year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.327644Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:c49a77c1dd0ed1edb499592778ef91a9889aa276ae51fc59fd9b33fe15fb6fb9","observation_id":"ce1ed870-b5f8-4cac-8398-b24847321cd8","resolution":{"observed_at":"2026-08-07T14:17:17.204881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:16.852008Z","title":"Richemond, Arnaud Doucet, Robin Strudel, Chris Dyer, Conor Durkan, Curtis Hawthorne, Rémi Leblond, Will Grathwohl, and Jonas Adler","venue":null,"work_id":"97e95371-93bd-46d6-a7c3-b7d0470bb71e","year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.347536Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:b7c082d309474996167f96819d4081230755aa75ae26327b4e1a3c4c3e468261","observation_id":"7c298ad4-f7f8-4511-aacb-0efe3d90795e","resolution":{"observed_at":"2026-08-07T14:17:16.978455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:16.677202Z","title":"Large language diffusion models, 2025","venue":null,"work_id":"6aafceaa-418b-4aee-9ddd-fc8190d7b0e6","year":2025},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.431911Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:f42cc1b8b1d5e713fd33890a6cd4efdba83a42665f0616e27940756884bc0ea7","observation_id":"39d66d04-2755-43e3-b68b-5e61b2a7a651","resolution":{"observed_at":"2026-08-07T14:17:16.749051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.00630","last_updated":"2023-04-14T00:20:30Z","snapshot_observed_at":"2026-08-09T14:29:00.548718Z","submitted_at":"2021-07-01T17:43:20Z","title":"Variational Diffusion Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.00630","snapshot_observed_at":"2026-08-07T14:17:12.497382Z","title":"Kingma, Tim Salimans, Ben Poole, and Jonathan Ho","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.497382Z"},"links":{"cited_paper":"/paper/2107.00630","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:23f3d49efe1c154a2e3df46c36d5ed3a04161d36632b81822407be9e88a1dbbd","observation_id":"3397a982-44ad-4385-a8b6-a9e2c4050a40","resolution":{"observed_at":"2026-08-07T14:17:12.497382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02908","last_updated":"2025-04-30T08:39:26Z","snapshot_observed_at":"2026-08-09T12:40:33.547471Z","submitted_at":"2024-09-04T17:48:19Z","title":"Masked Diffusion Models are Secretly Time-Agnostic Masked Models and Exploit Inaccurate Categorical Sampling","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02908","snapshot_observed_at":"2026-08-07T14:17:12.592899Z","title":"Masked diffusion models are secretly time-agnostic masked models and exploit inaccurate categorical sampling, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.592899Z"},"links":{"cited_paper":"/paper/2409.02908","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:f21d4a00e86f3308fb6541e3f2e1fceea61568c3514846e357c92f5c5500166b","observation_id":"83a3332d-2e9a-42ae-a652-ad60a67a6af8","resolution":{"observed_at":"2026-08-07T14:17:12.592899Z","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-07T14:17:12.652975Z","title":"Variational inference with normalizing flows, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.652975Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:0e609f90fc54e70b8a8fdbe648c707197480fc77e9e6c760d9e7ad7922623025","observation_id":"9cb65da5-b2b0-4e8a-896a-17c78584e56d","resolution":{"observed_at":"2026-08-07T14:17:12.652975Z","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-07T14:17:12.685045Z","title":"Kingma and Prafulla Dhariwal","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.685045Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:4e25dbc284b327563fab47be429f42bd272dd0da552ae45eae2f52b5845581ba","observation_id":"4046703c-7761-4d19-92b0-d851cfebd931","resolution":{"observed_at":"2026-08-07T14:17:12.685045Z","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-07T14:17:12.777245Z","title":"Flow straight and fast: Learning to generate and transfer data with rectified flow, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.777245Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:0f426f5f421d23a94b44ff8189a6941aefa9579cbaca9136ca20513787022601","observation_id":"d115dcc9-8389-4261-91c4-1538020834c2","resolution":{"observed_at":"2026-08-07T14:17:12.777245Z","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-07T14:17:16.490100Z","title":"Fuchs, Ingmar Posner, and Max Welling","venue":null,"work_id":"1b363a7d-95f9-419c-a90b-6d49265576bf","year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.868991Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:c95fbe8ab12ab9edc5805caba5fd7199c2508a42054cea6ccaadebd1993eccd4","observation_id":"eeb529c0-7bcd-4853-9cb0-97c4af47a568","resolution":{"observed_at":"2026-08-07T14:17:16.560818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:16.357652Z","title":"Albergo, Nicholas M","venue":null,"work_id":"df868276-c18b-487b-8c18-0db3206a6504","year":2023},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:12.930700Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:dc64e1ca3294d5c6f9ff1ffc48ef392ab4b6e650aa2ee3d538663458f34419b2","observation_id":"a732e125-1030-49d2-84f8-1f5bcd61e2cd","resolution":{"observed_at":"2026-08-07T14:17:16.409469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:16.183170Z","title":"Zico Kolter","venue":null,"work_id":"92883162-5f91-4a2b-988e-0787bd2ff9ff","year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.001999Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:44edd023552256d38b7b8e9c57369f42a46265da97ede3f7ffaaaa843b04aeee","observation_id":"c04dfa79-d029-4263-b837-fe0a56bf3143","resolution":{"observed_at":"2026-08-07T14:17:16.271434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2661","last_updated":"2014-06-10T18:58:17Z","snapshot_observed_at":"2026-07-06T03:46:00.791740Z","submitted_at":"2014-06-10T18:58:17Z","title":"Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2661","snapshot_observed_at":"2026-08-07T14:17:13.081125Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.081125Z"},"links":{"cited_paper":"/paper/1406.2661","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:b420a247ec10d50e3b1efc237d8fe858ede32c370d475cd4eda28fd947a52a85","observation_id":"638f06a9-1cbc-4696-9326-4297c7a60edf","resolution":{"observed_at":"2026-08-07T14:17:13.081125Z","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-07T14:17:15.999578Z","title":"Argmax flows and multinomial diffusion: Learning categorical distributions, 2021","venue":null,"work_id":"602884bb-6626-40ed-af58-c08d9507db8a","year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.163970Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:79d9cf7d04ed9f633c7da2b4433d59935821913128db8e6bcc13eac1940ea888","observation_id":"469a9313-f514-44aa-b7b8-6fe0a20a4d32","resolution":{"observed_at":"2026-08-07T14:17:16.077431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4393.2021","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:14.696441Z","title":"Image style transfer based on improved convolutional neural","venue":null,"work_id":"2eb879e4-94e5-4c74-9f82-4c07f357ccd9","year":2021},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.229918Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:442c721783960727497d9b544ab5c46120286c992e5067c91e5a18478337fd0e","observation_id":"c07ffb8b-7e56-4e01-a812-c584a18520e1","resolution":{"observed_at":"2026-08-07T14:17:14.759496Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10548","last_updated":"2019-06-04T18:34:05Z","snapshot_observed_at":"2026-07-06T07:29:52.186055Z","submitted_at":"2019-01-29T21:05:46Z","title":"Latent Normalizing Flows for Discrete Sequences","version":4},"cited_work":{"arxiv_id":"1901.10548","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.10548","snapshot_observed_at":"2026-08-07T14:17:14.473934Z","title":"Latent Normalizing Flows for Discrete Sequences","venue":"stat.ML","work_id":"a58cbfc2-8b44-4583-b400-e0921219518d","year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.317111Z"},"links":{"cited_paper":"/paper/1901.10548","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:059b2dab4d5f961efc283e3a6f9b78b1cb34d1876038e281e3625a8b7c517913","observation_id":"7956723f-dfc8-45e3-a839-6816f0fdcf00","resolution":{"observed_at":"2026-08-07T14:17:14.534205Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:15.835798Z","title":"Discrete flows: Invertible generative models of discrete data","venue":null,"work_id":"bf7b5c16-14b0-4b59-8cfa-b20df4a0187e","year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.389277Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:2849d255e6d6e87b551d073b4eca652c34c823d6348c464bc19d808c07bce1f8","observation_id":"b2891114-0d7b-49c5-8f1c-6850d8e965fa","resolution":{"observed_at":"2026-08-07T14:17:15.922566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13554","last_updated":"2022-10-24T08:39:05Z","snapshot_observed_at":"2026-08-08T21:00:19.292456Z","submitted_at":"2022-05-26T18:00:02Z","title":"Training and Inference on Any-Order Autoregressive Models the Right Way","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.13554","snapshot_observed_at":"2026-08-07T14:17:13.445303Z","title":"Training and inference on any-order autoregressive models the right way, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.445303Z"},"links":{"cited_paper":"/paper/2205.13554","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:43f13d0af8ac141ec26a7c063c10493dc5edd701c1026c1b3bd1ea0817a71756","observation_id":"00a2e2f6-3151-4bba-8ce5-9d1a14497600","resolution":{"observed_at":"2026-08-07T14:17:13.445303Z","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-07T14:17:15.658447Z","title":"Bayesian flow networks,","venue":null,"work_id":"d951b064-e218-411b-9116-37c99fb2a154","year":null},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.521776Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:3e9db767d4f24babcd8512de79cce744890ffe6d3781a7d8dfa4500b940e0d96","observation_id":"4bed6894-c34c-45c2-bbf7-b241b40d3d30","resolution":{"observed_at":"2026-08-07T14:17:15.734881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:13.650263Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.650263Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:7e4d17efca91b86c89132226d91848304841603f12671413984b45dc719d3e85","observation_id":"74682962-66fd-4683-8468-78a85216d018","resolution":{"observed_at":"2026-08-07T14:17:13.650263Z","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-07T14:17:15.423891Z","title":"Implicit generation and modeling with energy based models","venue":null,"work_id":"342f75f7-e7e1-49b1-b0a8-046638e141b0","year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.710720Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:a257f18252f56f6584bc28ce6a8dd7b9dc4e25dbbc20d5a1d3c6eb13dab7d124","observation_id":"3dc5d892-c263-490e-9e3f-6881aab72dbe","resolution":{"observed_at":"2026-08-07T14:17:15.548928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:15.210068Z","title":"Your classifier is secretly an energy based model and you should treat it like one","venue":null,"work_id":"09dc72fd-807e-4913-8a12-13f55355dcee","year":2020},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.778668Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:acefac20cadc13efd0d2bf94ccb04f24dfaf46da6268e587e23a311c3147f3f5","observation_id":"72b333de-aa19-4062-a9a2-40a412cdd146","resolution":{"observed_at":"2026-08-07T14:17:15.296324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:13.852738Z","title":"Large scale GAN training for high fidelity natural image synthesis","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.852738Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:aa14d4295cec68ef262234e9854dd305f736d5e33369cf05e4231dcb8207b0a0","observation_id":"8701d267-c48d-492e-bba3-16dadf72908a","resolution":{"observed_at":"2026-08-07T14:17:13.852738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06676","last_updated":"2020-10-07T17:09:24Z","snapshot_observed_at":"2026-08-05T02:34:56.056913Z","submitted_at":"2020-06-11T17:06:34Z","title":"Training Generative Adversarial Networks with Limited Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.06676","snapshot_observed_at":"2026-08-07T14:17:13.923032Z","title":"Training generative adversarial networks with limited data.arXiv preprint arXiv:2006.06676v1, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.923032Z"},"links":{"cited_paper":"/paper/2006.06676","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:19936ac1ef6ca814d79ebb3f655245dcae2a8d2416b15c0b74f335badaa9b730","observation_id":"eaef7edc-3f41-4ab3-9b2f-bcc0cfbc52fc","resolution":{"observed_at":"2026-08-07T14:17:13.923032Z","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-07T14:17:15.020320Z","title":"Conditional image generation with PixelCNN decoders","venue":null,"work_id":"92d4d131-08f0-4d6b-a483-caf726b9be7f","year":2016},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.983684Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:996255a3533bcfa3f089fcc12c114df582f9eef0b8f73c8fde1aa303c78e514d","observation_id":"c262f64b-4234-41cb-a89b-bdc780686d23","resolution":{"observed_at":"2026-08-07T14:17:15.098930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:14.946971Z","title":"Autoregressive quantile networks for generative modeling","venue":null,"work_id":"0b443660-9cac-49eb-82db-7f1f77a6cabd","year":2018},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:14.044504Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:56c462fd5cb8c26712316a2cbc35b86b5e3110a53861cedf0dcae7e84cc19ba5","observation_id":"1cc0068b-8fbc-4edb-9c49-e30f3260f108","resolution":{"observed_at":"2026-08-07T14:17:14.958302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:14.085368Z","title":"Generative modeling by estimating gradients of the data distribution","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:14.085368Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:027dc78061ee1546858a360a1a04cf95edcc2f95f0f99b51f48c50f80b355adc","observation_id":"c02105a2-7daf-4276-a002-68eb61063311","resolution":{"observed_at":"2026-08-07T14:17:14.085368Z","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-07T14:17:14.142708Z","title":"Spectral normalization for generative adversarial networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:14.142708Z"},"links":{"citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:bb6bf09711faf4364aaeb349b3fa5d4a3ac8cea3765122da765e5db932c923f1","observation_id":"f4f711ed-5b69-4dde-920c-9a6e17f9b427","resolution":{"observed_at":"2026-08-07T14:17:14.142708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.06060","last_updated":"2021-07-07T17:57:49Z","snapshot_observed_at":"2026-07-06T09:04:22.596181Z","submitted_at":"2020-03-12T23:33:50Z","title":"Your GAN is Secretly an Energy-based Model and You Should use Discriminator Driven Latent Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.06060","snapshot_observed_at":"2026-08-07T14:17:14.217872Z","title":"Your GAN is secretly an energy-based model and you should use discriminator driven latent sampling.arXiv preprint arXiv:2003.06060, 2020","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:14.217872Z"},"links":{"cited_paper":"/paper/2003.06060","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:19c6c85dd2688a098005ed5e902ffe461a30d5679d0d26353e32f38ea01a13cf","observation_id":"6f5df098-990f-47ad-bc98-5ef9cae06809","resolution":{"observed_at":"2026-08-07T14:17:14.217872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-09T20:34:52.923500Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-07T14:17:14.293280Z","title":"Decoupled weight decay regularization, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:14.293280Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:882518c2392365207bfd91aaa092147f4026f22c787345c74db90112900ed465","observation_id":"6207ec8b-2696-4fef-8d94-7db899c7d664","resolution":{"observed_at":"2026-08-07T14:17:14.293280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00937","last_updated":"2018-05-30T14:58:27Z","snapshot_observed_at":"2026-08-01T14:58:21.912263Z","submitted_at":"2017-11-02T21:14:44Z","title":"Neural Discrete Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00937","snapshot_observed_at":"2026-08-07T14:17:11.482229Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:11.482229Z"},"links":{"cited_paper":"/paper/1711.00937","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:37f88279346cc2fdb55111a6cd1b0ff5810a46602ee361330033bf5b55922e0f","observation_id":"b04d0b76-f7bf-446b-82ae-80aa4c656131","resolution":{"observed_at":"2026-08-07T14:17:11.482229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07037","last_updated":"2025-03-11T08:07:39Z","snapshot_observed_at":"2026-07-06T16:05:55.074136Z","submitted_at":"2023-08-14T09:56:35Z","title":"Bayesian Flow Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07037","snapshot_observed_at":"2026-08-07T14:17:13.588399Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:13.588399Z"},"links":{"cited_paper":"/paper/2308.07037","citing_paper":"/paper/2505.19752"},"observation_digest":"sha256:04066fa7cc771f617dcf4b6ff0949e6161575b28a067f2a4a8bf1da52fffe2c0","observation_id":"088c4e74-d84b-4948-bdd1-24d539c2d4fd","resolution":{"observed_at":"2026-08-07T14:17:13.588399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.19752","last_updated":"2025-05-26T09:32:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T12:40:48.784031Z","submitted_at":"2025-05-26T09:32:12Z","title":"Discrete Markov Bridge"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":31,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":52},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2505.19752."}