{"as_of":"2026-08-08T07:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97a210cf414375c1d76b9290985bb1bd37afba324df1f064407a0913bac0f889","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:54:50.205749Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T19:08:50.411555Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2412.06264","last_updated":"2024-12-09T07:22:38Z","snapshot_observed_at":"2026-08-02T09:54:14.339169Z","submitted_at":"2024-12-09T07:22:38Z","title":"Flow Matching Guide and Code","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-12T10:28:14.014706Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2412.06264"},"observation_digest":"sha256:6049e63de6c4b400e2306fd153d9d2ae2891e2636d69cc168e73847a3d6fcf0d","observation_id":"f0895d8c-984c-42eb-bb7f-cce3ecd27f6e","resolution":{"observed_at":"2026-05-12T10:28:14.089251Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-08-07T10:54:50.205749Z","title":"Generator matching: Generative modeling with arbitrary markov processes","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03979","last_updated":"2025-06-05T04:27:46Z","snapshot_observed_at":"2026-08-07T23:56:21.475184Z","submitted_at":"2025-06-04T14:09:25Z","title":"Solving Inverse Problems via Diffusion-Based Priors: An Approximation-Free Ensemble Sampling Approach","version":2},"reference_index":157,"source":"pdf_text","source_observed_at":"2026-08-07T10:54:50.205749Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2506.03979"},"observation_digest":"sha256:0ad85aee6218e7393ab1b13a04fe2e0db09507dfce8360b6fc9f18a3e003401f","observation_id":"f75718b5-38e4-4077-91c8-bc7ac531e198","resolution":{"observed_at":"2026-08-07T10:54:50.205749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-08-07T06:05:46.204726Z","title":"Ari Holtzman, Jan Buys, Li Du, Maxwell Forbes, and Yejin Choi","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-08T05:28:50.305297Z","submitted_at":"2025-06-06T16:21:35Z","title":"Corrector Sampling in Language Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:46.204726Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2506.06215"},"observation_digest":"sha256:08601fd7a4f52cbde415b346c615194021343520c076f6a13afa076205f12308","observation_id":"d75b4484-a6ea-4922-98ef-b7e0434e020d","resolution":{"observed_at":"2026-08-07T06:05:46.204726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-08-07T05:34:51.255415Z","title":"T., 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-08T07:15:07.479631Z","submitted_at":"2025-06-09T16:20:20Z","title":"Diffuse Everything: Multimodal Diffusion Models on Arbitrary State Spaces","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:34:51.255415Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2506.07903"},"observation_digest":"sha256:bb2d7d6e48deb8eaf8e8682f1ec45902e94d684e34a0c5bba522dd7b6232e22c","observation_id":"7b4814ee-4c1b-41bd-97a1-2012dc90c9d0","resolution":{"observed_at":"2026-08-07T05:34:51.255415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-08-06T21:46:26.709747Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23589","last_updated":"2025-06-30T07:51:58Z","snapshot_observed_at":"2026-08-07T20:34:54.751246Z","submitted_at":"2025-06-30T07:51:58Z","title":"Transition Matching: Scalable and Flexible Generative Modeling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T21:46:26.709747Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2506.23589"},"observation_digest":"sha256:1497812e7b43cc0f1edd0da35e9c2b41a06eabb030b18f61dbcdcb2c4ace9de9","observation_id":"0bae7df0-d837-469b-8ad8-f0c7cab310b0","resolution":{"observed_at":"2026-08-06T21:46:26.709747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2602.20210","last_updated":"2026-05-25T04:14:15Z","snapshot_observed_at":"2026-08-02T21:39:34.276526Z","submitted_at":"2026-02-23T03:59:47Z","title":"Multimodal Crystal Flow: Any-to-Any Modality Generation for Unified Crystal Modeling","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T07:09:14.913144Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2602.20210"},"observation_digest":"sha256:b90718589c04f2b5c5c21a248351a73895bce3a91be38a382b30bc0b1ad447c4","observation_id":"283575c2-65b5-4f63-8fbf-53bfa3e56330","resolution":{"observed_at":"2026-05-25T07:10:27.512353Z","resolver_source":"arxiv_id","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":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-08-02T21:39:37.244407Z","title":"T., and Lipman, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20210","last_updated":"2026-05-25T04:14:15Z","snapshot_observed_at":"2026-08-02T21:39:34.276526Z","submitted_at":"2026-02-23T03:59:47Z","title":"Multimodal Crystal Flow: Any-to-Any Modality Generation for Unified Crystal Modeling","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T21:39:37.244407Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2602.20210"},"observation_digest":"sha256:06496d847fce23cdef53ccf8ab8cc65d5e57f1f24d127634d5da30f4401f9413","observation_id":"5589843a-3922-4826-874f-708c9faf48b1","resolution":{"observed_at":"2026-08-02T21:39:37.244407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2605.08882","last_updated":"2026-05-09T11:06:33Z","snapshot_observed_at":"2026-07-06T23:21:02.177557Z","submitted_at":"2026-05-09T11:06:33Z","title":"Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T01:47:08.976886Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2605.08882"},"observation_digest":"sha256:52624f0ab93e5125756072d78ad507a7006d8b33ca20480005aed3613f31e633","observation_id":"88e05450-2b40-4491-a594-f6a1cd4ecf42","resolution":{"observed_at":"2026-05-12T07:51:42.496245Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2605.31063","last_updated":"2026-05-29T09:34:53Z","snapshot_observed_at":"2026-08-07T11:31:06.954776Z","submitted_at":"2026-05-29T09:34:53Z","title":"Free energy Estimation on Any State Space","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T21:15:39.298557Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2605.31063"},"observation_digest":"sha256:b0f50c6d61e5acec2c56cc392e6ca1b16fe3806ad44b1fda8382cdd916993847","observation_id":"c2aa80bd-4f3d-4ea1-a70f-bf2bd5c78070","resolution":{"observed_at":"2026-07-01T20:26:12.240443Z","resolver_source":"arxiv_id","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":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2606.07239","last_updated":"2026-06-05T13:07:56Z","snapshot_observed_at":"2026-07-06T23:46:55.970997Z","submitted_at":"2026-06-05T13:07:56Z","title":"Generative Molecular Morphing for Flexible-Size Design via Unbalanced Optimal Transport","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T22:52:42.933237Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2606.07239"},"observation_digest":"sha256:a5e4de89af5dde0d083275a9e7649d162d38c6b981e16e5699ea530af65583d1","observation_id":"24cea928-e62f-4cf7-a381-b45938315a1c","resolution":{"observed_at":"2026-07-02T16:17:09.037092Z","resolver_source":"arxiv_id","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":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2606.10543","last_updated":"2026-06-09T08:11:14Z","snapshot_observed_at":"2026-08-02T19:59:37.659979Z","submitted_at":"2026-06-09T08:11:14Z","title":"Flexible Flows for Biological Sequence Design","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-27T14:21:51.854183Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2606.10543"},"observation_digest":"sha256:b07576e717a2a7d7e1c4a219de0e2f28056b8adabcc2637961a27ce8bc136445","observation_id":"0b6a7149-315d-4f43-a14e-d402379f1b07","resolution":{"observed_at":"2026-07-03T03:57:38.587638Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":"2410.20587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-03T19:08:50.411555Z","title":"T., and Lipman, Y","venue":null,"work_id":"7e9dc8e5-7b5d-4a5d-849c-09cf3ab72fb4","year":2025},"citing_paper":{"arxiv_id":"2606.17465","last_updated":"2026-06-16T03:26:55Z","snapshot_observed_at":"2026-07-31T22:59:48.278272Z","submitted_at":"2026-06-16T03:26:55Z","title":"Perron--Frobenius Operator Matching for Generative Modeling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T02:02:20.826313Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2606.17465"},"observation_digest":"sha256:d93e534d6f4591d89ff776ef37f97f3c6bfd15aeb1f8c89c536bb0243455857d","observation_id":"e0a63cfc-5d72-461a-b0cc-8c267f884890","resolution":{"observed_at":"2026-07-03T19:08:50.413714Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20587","snapshot_observed_at":"2026-07-13T00:48:08.651522Z","title":"Generator matching: Generative modeling with arbitrary markov processes.arXiv preprint arXiv:2410.20587, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09039","last_updated":"2026-07-10T02:11:43Z","snapshot_observed_at":"2026-08-02T23:13:10.516801Z","submitted_at":"2026-07-10T02:11:43Z","title":"Variable-Length Generative Protein Design via Generalized Poisson Flow","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T00:48:08.651522Z"},"links":{"cited_paper":"/paper/2410.20587","citing_paper":"/paper/2607.09039"},"observation_digest":"sha256:73e00bd46ad4e2504b6fdb74e91b1d9c964ad995d8e7fadef49ddf03d73a20a2","observation_id":"792d62da-e0a9-4b7b-94eb-ffc4d7226c4f","resolution":{"observed_at":"2026-07-13T00:48:08.651522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.20587/citation-record","integrity":"/paper/2410.20587/integrity","json":"/paper/2410.20587/citation-record.json","paper":"/paper/2410.20587"},"outbound":[],"paper":{"arxiv_id":"2410.20587","last_updated":"2025-02-27T02:41:21Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:40:25.975196Z","submitted_at":"2024-10-27T20:47:29Z","title":"Generator Matching: Generative modeling with arbitrary Markov processes"},"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-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 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2410.20587."}