{"as_of":"2026-08-19T04:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb8a9b68ea07a75c9405d2e3521f78b337597ef18975c3e8a8c555852ddc1361","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":32,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:25:08.384360Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2411.10618","last_updated":"2026-05-01T06:34:46Z","snapshot_observed_at":"2026-08-12T22:34:02.035135Z","submitted_at":"2024-11-15T22:44:36Z","title":"D-Flow: Multi-modality Flow Matching for D-peptide Design","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T17:39:47.507856Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2411.10618"},"observation_digest":"sha256:cb38b202080d0040b8bbae656dfcf9c308bc644cb6e0a6d987742fac956ed7d2","observation_id":"758b8815-e809-4840-aed1-a363f87aefb4","resolution":{"observed_at":"2026-05-23T17:43:17.727168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-12T12:56:55.169338Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16644","last_updated":"2024-11-25T18:27:39Z","snapshot_observed_at":"2026-08-18T18:10:18.731099Z","submitted_at":"2024-11-25T18:27:39Z","title":"Exploring Discrete Flow Matching for 3D De Novo Molecule Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:55.169338Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2411.16644"},"observation_digest":"sha256:0f0aa656c2cbc9ddab19a210fbec2c9261ed375dffc9138fba5c40eb3a61ae89","observation_id":"91bccffc-12e7-49c6-b42c-bec64417f2bd","resolution":{"observed_at":"2026-08-12T12:56:55.169338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2412.06264","last_updated":"2024-12-09T07:22:38Z","snapshot_observed_at":"2026-08-14T10:51:24.885214Z","submitted_at":"2024-12-09T07:22:38Z","title":"Flow Matching Guide and Code","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-12T10:28:14.014706Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2412.06264"},"observation_digest":"sha256:a9886e0c5127d4cdf61d11f3cb8a80a0b3ef3a94a1ab158cf567e4040e86fdcc","observation_id":"fbbcbfd1-ab87-41c0-b721-2f43be36e395","resolution":{"observed_at":"2026-05-12T10:28:14.110024Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-11T14:05:28.089910Z","title":"Discrete flow matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12540","last_updated":"2025-03-02T05:26:04Z","snapshot_observed_at":"2026-08-16T21:40:37.361989Z","submitted_at":"2024-12-17T05:07:10Z","title":"Stiefel Flow Matching for Moment-Constrained Structure Elucidation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T14:05:28.089910Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2412.12540"},"observation_digest":"sha256:702175f9981543a92d1bfcda60c35a9f7a0f25c8952c998221bbd0a3a3ba2c25","observation_id":"7a4fc340-d5a8-4231-a3ce-9dd69d40cc27","resolution":{"observed_at":"2026-08-11T14:05:28.089910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-10T23:02:07.647704Z","title":"Discrete flow matching","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00289","last_updated":"2025-04-01T19:09:34Z","snapshot_observed_at":"2026-08-17T01:12:01.354637Z","submitted_at":"2024-12-31T05:49:00Z","title":"Dual Diffusion for Unified Image Generation and Understanding","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T23:02:07.647704Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2501.00289"},"observation_digest":"sha256:2af1bea616c2a23858fd176ac6b32d38948e3cb476b7d07b7f2ce72740046945","observation_id":"c3f792e5-a7e0-47b7-a4e7-37dc30453433","resolution":{"observed_at":"2026-08-10T23:02:07.647704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-10T22:40:48.750268Z","title":"T., Syn- naeve, G., Adi, Y ., and Lipman, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.01073","last_updated":"2025-06-03T16:53:33Z","snapshot_observed_at":"2026-08-15T15:11:09.002273Z","submitted_at":"2025-01-02T05:44:11Z","title":"Graph Generative Pre-trained Transformer","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:40:48.750268Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2501.01073"},"observation_digest":"sha256:14a39dd18187e4da732b329d15030831f28aa7bb217110f879d2283a000c3c63","observation_id":"61b63783-4eb6-4155-9549-dc8438549a51","resolution":{"observed_at":"2026-08-10T22:40:48.750268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-10T14:01:55.498434Z","title":"Gat, I., Remez, T., Shaul, N., Kreuk, F., Chen, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15781","last_updated":"2025-06-03T11:52:35Z","snapshot_observed_at":"2026-08-15T19:30:01.300784Z","submitted_at":"2025-01-27T04:59:29Z","title":"Large Language Models to Diffusion Finetuning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:01:55.498434Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2501.15781"},"observation_digest":"sha256:dde0f5b822b7340cd7887bb28aeb1c4ebaa5066ce1c986dfccf1b4db23c39975","observation_id":"d8ee3f48-10f2-4ad2-98c5-5f22cb241549","resolution":{"observed_at":"2026-08-10T14:01:55.498434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-09T18:51:12.422579Z","title":"Discrete flow matching","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00500","last_updated":"2025-02-04T15:19:12Z","snapshot_observed_at":"2026-08-13T15:10:28.704658Z","submitted_at":"2025-02-01T17:40:11Z","title":"Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T18:51:12.422579Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2502.00500"},"observation_digest":"sha256:84f2015afc9d0dbdea0399e69d54bbf318363cae22ea3ccb606b272fac5ff674","observation_id":"17093f03-1d81-4fe0-8d1d-4eb6b7fdfe4b","resolution":{"observed_at":"2026-08-09T18:51:12.422579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-09T11:48:43.585906Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02582","last_updated":"2025-07-11T15:35:20Z","snapshot_observed_at":"2026-08-17T13:51:31.554787Z","submitted_at":"2025-02-04T18:56:47Z","title":"Open Materials Generation with Stochastic Interpolants","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T11:48:43.585906Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2502.02582"},"observation_digest":"sha256:e4ed60c71e4d22e9b3a5d612a6112b111bc594373d9e2caa3cff7aa20150d241","observation_id":"d5284d05-c265-4791-96da-9a5fdfa7bd4e","resolution":{"observed_at":"2026-08-09T11:48:43.585906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-08T13:15:15.114897Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07303","last_updated":"2025-09-04T18:36:05Z","snapshot_observed_at":"2026-08-15T03:25:35.255129Z","submitted_at":"2025-02-11T07:01:19Z","title":"Flow Matching for Collaborative Filtering","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T13:15:15.114897Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2502.07303"},"observation_digest":"sha256:dd6883f00ac0b13f33d3e3e82f38b69df50c4853d8c671c1e8bc5b2eaa923279","observation_id":"3491c11d-1589-4a72-b06f-2dac791ac3ce","resolution":{"observed_at":"2026-08-08T13:15:15.114897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-07T20:56:22.880965Z","title":"T., Synnaeve, G., Adi, Y., and Lipman, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09622","last_updated":"2025-06-09T02:36:10Z","snapshot_observed_at":"2026-08-16T23:09:12.557346Z","submitted_at":"2025-02-13T18:59:47Z","title":"Theoretical Benefit and Limitation of Diffusion Language Model","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T20:56:22.880965Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2502.09622"},"observation_digest":"sha256:0467cf9c6ed51028a092af733a40703f5713e2a862306e39dff0ea528ac18985","observation_id":"3266d654-67fd-4218-a892-b189512d113c","resolution":{"observed_at":"2026-08-07T20:56:22.880965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2502.09992","last_updated":"2025-10-18T15:35:05Z","snapshot_observed_at":"2026-08-04T04:34:22.998376Z","submitted_at":"2025-02-14T08:23:51Z","title":"Large Language Diffusion Models","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-11T01:42:54.279353Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2502.09992"},"observation_digest":"sha256:c51ddc93bf75dc4d614b117a09cc1307460f8f463003feb5e2f8d11bcb17d6aa","observation_id":"3daa7594-5f5c-48f6-8cee-78cf52692700","resolution":{"observed_at":"2026-05-11T01:42:54.541995Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2505.16933","last_updated":"2025-06-04T05:52:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T17:23:26Z","title":"LLaDA-V: Large Language Diffusion Models with Visual Instruction Tuning","version":2},"reference_index":109,"source":"pdf_text","source_observed_at":"2026-05-17T03:46:06.074416Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2505.16933"},"observation_digest":"sha256:d9cd5b8fb9d84ea72e622e834d21f3f50435dd6f9e1c45864c9ce80bc63ac753","observation_id":"a4d9889d-3c94-4208-907e-8ecc5a071f20","resolution":{"observed_at":"2026-05-17T03:46:06.359810Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2505.22618","last_updated":"2025-07-03T04:51:05Z","snapshot_observed_at":"2026-07-06T21:32:23.537939Z","submitted_at":"2025-05-28T17:39:15Z","title":"Fast-dLLM: Training-free Acceleration of Diffusion LLM by Enabling KV Cache and Parallel Decoding","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T04:28:02.231373Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2505.22618"},"observation_digest":"sha256:f26704655166d75e5e401fb251729b6ffa590c53b06ae676ed22a27893b02663","observation_id":"5f248625-d1e2-4cd8-8eff-073506ebe5c8","resolution":{"observed_at":"2026-05-16T04:28:02.276008Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-07T12:35:39.417574Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24857","last_updated":"2025-05-30T17:52:55Z","snapshot_observed_at":"2026-08-11T15:10:36.034898Z","submitted_at":"2025-05-30T17:52:55Z","title":"Accelerated Sampling from Masked Diffusion Models via Entropy Bounded Unmasking","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:39.417574Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2505.24857"},"observation_digest":"sha256:73634095871a3d1fbb139f4984fa8c2e21a181c88929c5b35c0d11a84f8d8b74","observation_id":"b2d1043c-aef7-49d3-8cc7-b6e3125cb5a2","resolution":{"observed_at":"2026-08-07T12:35:39.417574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-07T06:05:45.951184Z","title":"Itai Gat, Tal Remez, Neta Shaul, Felix Kreuk, Ricky T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06215","last_updated":"2025-06-06T16:21:35Z","snapshot_observed_at":"2026-08-18T15:29:08.303401Z","submitted_at":"2025-06-06T16:21:35Z","title":"Corrector Sampling in Language Models","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:45.951184Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2506.06215"},"observation_digest":"sha256:91f68d35da585242a9d46c53f2ad9c2a01b4f7ae3cfcc563366a2321c33c56db","observation_id":"3944a524-3751-4d7b-bcc4-48717b7453d3","resolution":{"observed_at":"2026-08-07T06:05:45.951184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-07T05:34:51.225381Z","title":"T., Synnaeve, G., Adi, Y., and Lipman, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07903","last_updated":"2025-06-12T23:40:11Z","snapshot_observed_at":"2026-08-15T18:08:09.441473Z","submitted_at":"2025-06-09T16:20:20Z","title":"Diffuse Everything: Multimodal Diffusion Models on Arbitrary State Spaces","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:34:51.225381Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2506.07903"},"observation_digest":"sha256:67a616656df68102d2a2b340b17bc7ccae99787dffc47d24b669ee50bfcd41f5","observation_id":"5cc59213-7af6-4d38-bf14-54d75c2e271d","resolution":{"observed_at":"2026-08-07T05:34:51.225381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-07T04:58:15.732822Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09258","last_updated":"2025-06-10T21:40:36Z","snapshot_observed_at":"2026-08-18T15:14:35.023646Z","submitted_at":"2025-06-10T21:40:36Z","title":"CFMI: Flow Matching for Missing Data Imputation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:58:15.732822Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2506.09258"},"observation_digest":"sha256:68e8c0c7a905fb780921ca3d58f306375abe05c508a55de27dcf565e0b93bf50","observation_id":"50588ca6-4d3d-4eb2-93f2-352220a79b44","resolution":{"observed_at":"2026-08-07T04:58:15.732822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-06T21:24:20.918552Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00425","last_updated":"2025-07-01T04:51:25Z","snapshot_observed_at":"2026-08-15T23:41:17.377432Z","submitted_at":"2025-07-01T04:51:25Z","title":"Flexible Language Modeling in Continuous Space with Transformer-based Autoregressive Flows","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:24:20.918552Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2507.00425"},"observation_digest":"sha256:f5cce2f31929918829ab9329552d5879feedb73ce5a739680883e4478e97bbca","observation_id":"086c5621-e87a-4233-8bba-3175aaa5239d","resolution":{"observed_at":"2026-08-06T21:24:20.918552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-06T18:24:52.843100Z","title":"https://arxiv.org/abs/2407.15595","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08475","last_updated":"2025-07-11T10:35:13Z","snapshot_observed_at":"2026-08-19T03:43:36.304171Z","submitted_at":"2025-07-11T10:35:13Z","title":"SynBridge: Bridging Reaction States via Discrete Flow for Bidirectional Reaction Prediction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.843100Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2507.08475"},"observation_digest":"sha256:8a43db9f76ba9e14d0455406547a38e817e5136237134a17f611a4d36f1cf2dd","observation_id":"465c2ceb-dfc4-42cb-954c-6ecd92402dd5","resolution":{"observed_at":"2026-08-06T18:24:52.843100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-15T17:25:08.384360Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12629","last_updated":"2025-08-18T05:13:27Z","snapshot_observed_at":"2026-08-18T18:10:05.818208Z","submitted_at":"2025-08-18T05:13:27Z","title":"FlowMol3: Flow Matching for 3D De Novo Small-Molecule Generation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T17:25:08.384360Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2508.12629"},"observation_digest":"sha256:6504279c506ef85fd8a8cd3a298686f8524ccfe760167c7d49967afb99ce79b5","observation_id":"459bfe21-19fe-4036-bfd9-037d6d63deb4","resolution":{"observed_at":"2026-08-15T17:25:08.384360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2510.12916","last_updated":"2026-04-17T19:33:42Z","snapshot_observed_at":"2026-08-16T06:53:13.752166Z","submitted_at":"2025-10-14T18:42:12Z","title":"Efficient Inference for Coupled Hidden Markov Models in Continuous Time and Discrete Space","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T07:14:42.051614Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2510.12916"},"observation_digest":"sha256:3b01eca759ad168c10bb12158e15b8089b5816ad95931845bdc68af623fd2a89","observation_id":"9d67e88c-6740-4ac7-bd6d-44737c3b26b7","resolution":{"observed_at":"2026-05-18T07:16:01.966124Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2511.03015","last_updated":"2026-04-13T04:30:54Z","snapshot_observed_at":"2026-08-16T01:59:19.416700Z","submitted_at":"2025-11-04T21:25:51Z","title":"Discrete Bayesian Sample Inference for Graph Generation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-18T00:44:01.292176Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2511.03015"},"observation_digest":"sha256:0963cf0fabdfdc680efd23a7bc4125b644b6cffed0b172ac9c2dc5919a0f418c","observation_id":"7792e14f-a865-4dad-a9a8-d1ad5a36a349","resolution":{"observed_at":"2026-05-18T00:45:33.079508Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2605.19726","last_updated":"2026-05-19T12:01:13Z","snapshot_observed_at":"2026-08-13T21:59:55.814750Z","submitted_at":"2026-05-19T12:01:13Z","title":"Efficient Long-Context Modeling in Diffusion Language Models via Block Approximate Sparse Attention","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T05:52:14.089334Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2605.19726"},"observation_digest":"sha256:0fe42521628842d7267295834a68c6c4f16a23cf5d22cb1e8a0cf6c122b73ab4","observation_id":"1791bdea-5808-45a6-bff5-00aeeaaf79da","resolution":{"observed_at":"2026-05-20T05:53:04.633179Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2606.07239","last_updated":"2026-06-05T13:07:56Z","snapshot_observed_at":"2026-08-14T14:32:48.606060Z","submitted_at":"2026-06-05T13:07:56Z","title":"Generative Molecular Morphing for Flexible-Size Design via Unbalanced Optimal Transport","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T22:52:42.933237Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.07239"},"observation_digest":"sha256:72e9de8fcfd4790fcc80d61720542e15547c24e53c9d48e29c7b6b9907a44c49","observation_id":"976e102e-b7d0-40d4-94ac-f5407d119837","resolution":{"observed_at":"2026-07-02T16:17:09.034278Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2606.08417","last_updated":"2026-08-01T17:13:06Z","snapshot_observed_at":"2026-08-15T19:32:24.787559Z","submitted_at":"2026-06-07T02:35:56Z","title":"Hacking Generative Perplexity: Why Unconditional Text Evaluation Needs Distributional Metrics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T18:53:01.285453Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.08417"},"observation_digest":"sha256:0c615c6f81202a834c96c9afeb21fae128019587e8904db393396ec609f5aa70","observation_id":"a8543139-18a9-4ffe-af50-3e25438f5ae1","resolution":{"observed_at":"2026-07-02T22:27:26.075598Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-04T04:51:23.437090Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.08417","last_updated":"2026-08-01T17:13:06Z","snapshot_observed_at":"2026-08-15T19:32:24.787559Z","submitted_at":"2026-06-07T02:35:56Z","title":"Hacking Generative Perplexity: Why Unconditional Text Evaluation Needs Distributional Metrics","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T04:51:23.437090Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.08417"},"observation_digest":"sha256:8070962b2fb349a7a4f184148904ca88d1d480c79639a6c0378f0a487b52222e","observation_id":"38b1ebab-0dd7-4499-85f0-fdae3e0c3f91","resolution":{"observed_at":"2026-08-04T04:51:23.437090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2606.19594","last_updated":"2026-06-17T20:56:44Z","snapshot_observed_at":"2026-08-02T12:17:21.328593Z","submitted_at":"2026-06-17T20:56:44Z","title":"Unsupervised Causal Abstractions Discovery","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-26T20:45:15.226889Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.19594"},"observation_digest":"sha256:e750fbc2f0ef3cae49d702db0f263999fd580eea3655f592262749fbd9a5c7b8","observation_id":"7e3e5605-8e61-4ef9-9dc9-f69e90d3481b","resolution":{"observed_at":"2026-06-26T20:49:57.443743Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2606.27361","last_updated":"2026-06-25T17:58:21Z","snapshot_observed_at":"2026-08-15T11:09:03.392361Z","submitted_at":"2026-06-25T17:58:21Z","title":"Autoregressive Boltzmann Generators","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-06-26T04:52:16.106374Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.27361"},"observation_digest":"sha256:285da26863619967495e6176f8f3a167d23ad094fd9a4b004c7315f5d0daab49","observation_id":"e6970dda-a9b1-4503-abcd-0ad6aeea9a39","resolution":{"observed_at":"2026-07-04T13:49:52.087633Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":"2407.15595","doi":"10.48550/arxiv.2407.15595","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete flow matching","venue":"arXiv (Cornell University)","work_id":"d3810acb-2472-492b-b3b2-2cefdf738e9c","year":2024},"citing_paper":{"arxiv_id":"2606.27732","last_updated":"2026-06-26T05:26:11Z","snapshot_observed_at":"2026-08-12T12:20:45.967289Z","submitted_at":"2026-06-26T05:26:11Z","title":"Bifocal Diffusion Language Models: Asymmetric Bidirectional Context for Parallel Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T03:31:47.800514Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2606.27732"},"observation_digest":"sha256:3c7ebbe3c1e63f9d0673a0901e85b26a28a7ca82ed956839b882f2738097ee52","observation_id":"b06ac057-34ea-4ca6-b19b-544c0c6ec243","resolution":{"observed_at":"2026-07-01T17:35:51.739345Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-06T22:57:59.774986Z","title":"arXiv preprint arXiv:2407.15595 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04525","last_updated":"2026-08-05T06:57:30Z","snapshot_observed_at":"2026-08-18T10:32:12.319773Z","submitted_at":"2026-08-05T06:57:30Z","title":"Coupled Continuous-Discrete Generation for Scene Text Image Super-Resolution","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-06T22:57:59.774986Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2608.04525"},"observation_digest":"sha256:1c8aa5fc318b275d103297afd84ccdf179e9c938113678be213ff2db4eebb4e4","observation_id":"a2e6cb8f-94e1-4faa-b7f4-4fcfc3ebb7ae","resolution":{"observed_at":"2026-08-06T22:57:59.774986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15595","snapshot_observed_at":"2026-08-12T00:34:11.732587Z","title":"arXiv preprint arXiv:2407.15595 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08082","last_updated":"2026-08-08T11:59:38Z","snapshot_observed_at":"2026-08-15T15:31:23.215155Z","submitted_at":"2026-08-08T11:59:38Z","title":"Commitment Before Realization: When Classifier-Free Guidance Becomes Unnecessary in Masked Diffusion Language Models","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T00:34:11.732587Z"},"links":{"cited_paper":"/paper/2407.15595","citing_paper":"/paper/2608.08082"},"observation_digest":"sha256:d25674cef14ae7eb9dcf31dc412c00116a7c2f9a1d8a0e56dcc3c6a2729785da","observation_id":"2a0c8db2-ce84-472d-8818-355dc13af91b","resolution":{"observed_at":"2026-08-12T00:34:11.732587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.15595/citation-record","integrity":"/paper/2407.15595/integrity","json":"/paper/2407.15595/citation-record.json","paper":"/paper/2407.15595"},"outbound":[],"paper":{"arxiv_id":"2407.15595","last_updated":"2024-11-05T10:02:42Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T16:00:48.631131Z","submitted_at":"2024-07-22T12:33:27Z","title":"Discrete Flow Matching"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 32 inbound Pith citation observations for arXiv:2407.15595."}