{"as_of":"2026-08-08T06:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d7f647c0a07ff9bab2e23acbb16d87979fa7cb6138bc7c8bd28c6b4d1096306","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-08T06:32:00.761636+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-07T14:04:47.908755Z","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:d7c458d9ffeb7ca8e77fe92877a9eb672a383acdd5026194e68d8f8dfac41425","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-07T14:04:47.908755Z","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:fc005adb4ad5f3015f25d27b7a565454afaf0339bf6fdcf56aa614e53153b1fd","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-07T14:04:47.908755Z","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:f5ccbce8563e243c935fa3b85ee36f76b30a6181d9f56ec2d0a1dbc9d466f00b","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-07T14:04:47.908755Z","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:41c7c9291b165a64af2cf5d3e2d8b0a1a654a3bc23c87ae251a2c78f0ee0b3fd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:7e3cedfc98f4adfc836b5147fff35f9bfaf254fa574bdcc89c53cb7dd8ab4491","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:e5172e554bb1ae7ddc99073e305f2a05153acbc7f796f864a8819f92e70dcc03","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-07T14:04:47.908755Z","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:a11fa7f1862bb75dbc318080174f7b350e7e4789b3723aa05ff3421427a2f7a0","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:08da6d1d700b1b80c5e715ce90130334d3461fd5b4666e6f964c584df8ed44fe","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-07T14:04:47.908755Z","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:dd55b48a7f73e1c9f6dfca0d9f67f2fd4e5ec3d5a7465d2a14ebefa3bbff999a","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-07T14:04:47.908755Z","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:371c3e860cb52af95189fc5f4e2dde014a7e3e17b0bcfa94fc7c36293c6d1739","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:2a1422cb0dc404f6e1538e7802f7e6a73f9b447ee165d05efcfd54de0519a2ab","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-07T14:04:47.908755Z","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:d8434cb89170e6ab548274244490b376401ae54eb99f3feec03efe066b2ca0cc","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-07T14:04:47.908755Z","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:9ee3fe62d971277b9986348e64900dd45ddc48bce1f557efcc31641fca33f926","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-07T14:04:47.908755Z","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:87d3ba3a19106b6baea2ae26ee4db2e1e739c5a3583121467ecada8fe645f670","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:f528dde1c5b3c7ce3ab96527a7d39692ae5f86999673241efbe38153c84477c2","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-07T14:04:47.908755Z","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:ea170f99eda77f6e5e2ae2ac0e306a82c04b6eae107a3ad1fe41b9b83a0f4bc3","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-07T14:04:47.908755Z","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:a57200e5094be51ecc5e1b377b26968e1ace98f2672a7bf3660503464326f845","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:1718d27ded1820cac5908800af89704a32523c8c98d5ffe79404edaf351fa3ab","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-07T14:04:47.908755Z","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:8856f14e8b4060360e0bf177a8cbaf66a2c0dae87d925db7af5c783383b7f954","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-07T14:04:47.908755Z","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:8e680767d1f961c491a7de42918fc896f58e635c28dc6fa0f08d07df40c4b00d","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-07T14:04:47.908755Z","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:17422c1898bb2a3fc90cba014ef877a5c9f826b78bbd34d84f659fb0ff859e40","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-07T14:04:47.908755Z","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:c5b07fdad52b33bfb061e58506fda10211ea3d6609b3bed6a25ba772d0b6e9bf","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:f7c16d8ccd198e849ef6f59221e8ce157062fb628d060ba7fd07d690a265b4f6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:1a7eded0688fb3ccf765bacad41f404adc83af302b8f05b8e497c68374427686","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T22:15:47.891015Z","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-07T14:04:47.908755Z","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:5513e0ab2e46cf98eb6def41c22ea289208f8df964aee9331a8bb8e0272ea8ca","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-07-06T19:10:29.880696Z","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-07T14:04:47.908755Z","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:f64d845000f800f9998f1767aab9c02bdfb6e87089aaa2d01c838004464f370d","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-07T14:04:47.908755Z","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:4fdc741f2525a4cb4c7c1cab1e09b7b6e4a5f75a92a34b0a909276d725835cac","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-07T14:04:47.908755Z","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:946cc0a1a7de5372b957f2c140ee4b0312fef0e5523adb12e7bc45dd2a270711","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-07T14:04:47.908755Z","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:3effb8afd7b03dd4ae1bbf3c02abedb5e44c7e28e52c3e5555ed7a5bb39dd980","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-07T14:04:47.908755Z","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:254a470c6809ffa14f360b945044c034d388858ee7d116cfd6afcc7869b010ad","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:bf41a3a13d0cc19970a8203f7566343122377832ebebc0e47b66995c025db340","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:6ee7209bdb9541c69ed7b8768f701f5876e329f36b0cd12c5df270df589e6a29","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:1450661b47c6c51ee7066c03e886796e82d5a415e5fe5637b8701fd978b1095a","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-07T14:04:47.908755Z","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:a7a2de561164402c23b702777111bb0812a1e3c36a589899ab961b9833fa251d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:35c2255a75419e226aea49e46374a78395d75688278b0f8de35d3895648a849a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:f82b337959c3e906b6af65f684d9c00f2788fcab4044e95416b14847b7d4dca1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:484f936f3ddb82325b384e38083e0596d8dd9b07fd8103b51572f85e3ab2bfed","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T16:54:54.077771Z","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-07T14:04:47.908755Z","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:270453675724af7b82012ca7d68fb692cd8ec29ad5adab85017e2dc31f7886ec","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-07T14:04:47.908755Z","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:114c3aae4466cdfddfc0a71827a264b2025bb5e065df79018869d006df98d00e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:abf7c82e5abc51e99c7fe528edd109d6ef5fe04be6c043518af3528f302b7e48","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-07T14:04:47.908755Z","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:e81447127908eeadf02c9395831c67bc2ba3a07a221488eee06d9ea7e78369bb","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:937b537f1592a036faaac1462a2f725ad572ddcc4382af029fa264988949e3fd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:77e5b26ac7297e2abcd2e5a3209d7a43a16e3264dd49e2d524d583787b544b47","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-07T14:04:47.908755Z","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:358939ac393310201097fa29a4eefd40d5a29084a3d9752ef7c1ef7072521efe","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-07T14:04:47.908755Z","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:37db098ffc3e9b06395dd8737887270210152346ec7cb78ca5c8c078e703bb75","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:7887c8c94652d643b9354c119bc5c46ace2e04ba219e5158ff6948c01837e72e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:04:47.908755Z","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:3db14e07535ae3ffcfc1e85ceb086f99f482ee65da8d6eb0e9a362cc15360d63","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-07T14:04:47.908755Z","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:a75f4e7838a202e2d0eeef072c3b40a4dcb4abbbea4fe1369f88b45cad6b4300","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-07T14:04:47.908755Z","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:fa2daedc5cd97c6065539f8751f5a91b8d10f587963931a43335d158ce6aa5d5","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-07-06T02:11:23.670680Z","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-07T14:04:47.908755Z","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:c0ef7fb5097492c047e3df17ba5e30260bec80cbe71ee50b6d31c4ba618559c8","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-07T14:04:47.908755Z","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:d07f2f770d7c4be1dbff74591969feca4694ef1330fb2710d133ef6316e58c4a","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-07T14:04:47.908755Z","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:15f49058ee639abf3444ca516063db78a9e3a576cdcc8fa45dcdf1769a744810","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-07T14:04:47.908755Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2505.19752."}