{"as_of":"2026-08-11T05:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a872b4b3da1346f84eaa5efa33b17599fa676697af57fb375e550f7dff6b9890","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":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":27,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:14:14.143944Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":40,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"1907.00257","last_updated":"2019-07-13T01:44:41Z","snapshot_observed_at":"2026-07-06T08:03:47.885341Z","submitted_at":"2019-06-29T18:56:32Z","title":"Hausdorff and Wasserstein metrics on graphs and other structured data","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T12:39:17.865922Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/1907.00257"},"observation_digest":"sha256:d1f27e90c1a21f25251eb992b55ab6b2450e6201ecf2cd51d934ca7aa2260354","observation_id":"0d01099e-743c-4b81-9574-25af8ca25945","resolution":{"observed_at":"2026-05-25T12:40:48.484839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"1907.01729","last_updated":"2019-07-05T14:08:44Z","snapshot_observed_at":"2026-08-10T08:51:16.104898Z","submitted_at":"2019-07-01T15:25:49Z","title":"Implementation of batched Sinkhorn iterations for entropy-regularized Wasserstein loss","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T11:46:54.277627Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/1907.01729"},"observation_digest":"sha256:0787606ca6e736dd26866d50200b3a92b02d930120a403d62995721cc26e5687","observation_id":"241d2abe-51dc-4ff2-ba80-95c0ac0158c6","resolution":{"observed_at":"2026-05-25T11:50:45.545279Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-09T13:14:14.143944Z","title":"5–6, 355–607, arXiv:1803.00567v2","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.02177","last_updated":"2025-04-04T10:22:53Z","snapshot_observed_at":"2026-08-09T13:02:12.904721Z","submitted_at":"2025-02-04T09:49:34Z","title":"Affine calculus for constrained minima of the Kullback-Leibler divergence","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T13:14:14.143944Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2502.02177"},"observation_digest":"sha256:5c1a97e1a51c02c2481b3e0da8694a169419496067188d42c0d27479d3a97a72","observation_id":"0554b496-ee6d-420e-afbb-fc862a4f935a","resolution":{"observed_at":"2026-08-09T13:14:14.143944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2502.10600","last_updated":"2026-04-23T16:45:36Z","snapshot_observed_at":"2026-07-06T20:36:55.027297Z","submitted_at":"2025-02-14T23:13:20Z","title":"Weighted quantization using MMD: From mean field to mean shift via gradient flows","version":4},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-23T02:48:07.008802Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2502.10600"},"observation_digest":"sha256:9ac7458dec1d7318f4a21bf5a250a0bec0c42d556e4b1099bc4a6ad233cf2ca3","observation_id":"5123c5fe-3fea-46a4-bcd1-3271da41ce38","resolution":{"observed_at":"2026-05-23T02:52:26.758501Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-04T13:54:23.306905Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.24894","last_updated":"2026-06-18T13:27:17Z","snapshot_observed_at":"2026-08-09T21:32:18.104666Z","submitted_at":"2025-09-29T15:03:55Z","title":"Improved Stochastic Optimization of LogSumExp","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T13:54:23.306905Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2509.24894"},"observation_digest":"sha256:5aedaf267907b4eece48fed8cb9df1f993431b22e4d65345befb6f1bea352d6e","observation_id":"e61bb35d-2160-4363-8116-412859fb4e7d","resolution":{"observed_at":"2026-08-04T13:54:23.306905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-03T18:35:51.566001Z","title":"Peyr´ e and M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.04839","last_updated":"2026-06-25T05:05:53Z","snapshot_observed_at":"2026-08-05T07:04:53.322329Z","submitted_at":"2025-12-04T14:21:50Z","title":"Optimal Transport Event Representation for Anomaly Detection","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T18:35:51.566001Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2512.04839"},"observation_digest":"sha256:d8d740effd12cdbd49674eaf10169f5e818def9a4792ab2bd1fcffa23081c223","observation_id":"dd0f940d-37b7-4408-94bc-b33a4233c1b5","resolution":{"observed_at":"2026-08-03T18:35:51.566001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-03T15:50:20.572239Z","title":"Computational optimal transport,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.15432","last_updated":"2026-06-09T13:55:22Z","snapshot_observed_at":"2026-08-10T11:32:15.481269Z","submitted_at":"2025-12-17T13:26:33Z","title":"Packet-Level Traffic Modeling with Heavy-Tailed Payload and Inter-Arrival Distributions for Digital Twins","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T15:50:20.572239Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2512.15432"},"observation_digest":"sha256:8b96834ce7a8f4cf10a0305a73fe825ddedfe341a7b1c454836a0798a1c3d59f","observation_id":"211a92f9-6c49-44d6-ba4b-8e23aa5f9380","resolution":{"observed_at":"2026-08-03T15:50:20.572239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2604.27398","last_updated":"2026-04-30T04:09:26Z","snapshot_observed_at":"2026-08-10T22:18:30.734508Z","submitted_at":"2026-04-30T04:09:26Z","title":"Why Mean Pooling Works: Quantifying Second-Order Collapse in Text Embeddings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T08:54:10.159712Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2604.27398"},"observation_digest":"sha256:627b2e43e23e0796ed00fafa2719d4cec9ea7d1939febc0c040dfaf34b09a61a","observation_id":"1b11078c-b64e-494a-b2cf-7222af86ac13","resolution":{"observed_at":"2026-05-12T09:56:26.439363Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.05652","last_updated":"2026-05-15T14:40:19Z","snapshot_observed_at":"2026-07-06T23:18:12.631820Z","submitted_at":"2026-05-07T04:06:53Z","title":"Information-Preserving Domain Transfer with Unlabeled Data in Misspecified Simulation-Based Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T14:59:14.870132Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.05652"},"observation_digest":"sha256:0e501a651b627621a0c954804c8460ba0253390e6b93ff2b34a06a21affbfa27","observation_id":"31a29c1c-2b0a-4509-9403-c09ef6d74891","resolution":{"observed_at":"2026-05-11T18:36:08.794721Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.05652","last_updated":"2026-05-15T14:40:19Z","snapshot_observed_at":"2026-07-06T23:18:12.631820Z","submitted_at":"2026-05-07T04:06:53Z","title":"Information-Preserving Domain Transfer with Unlabeled Data in Misspecified Simulation-Based Inference","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T17:16:55.291759Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.05652"},"observation_digest":"sha256:f9756df73066202b7129cae50f441cf753e26218ffa514a52db34d9ff1c3761b","observation_id":"bfa6a79f-c4d1-4fbb-b18c-f176651b59db","resolution":{"observed_at":"2026-05-19T17:17:42.951203Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.05907","last_updated":"2026-05-07T09:17:47Z","snapshot_observed_at":"2026-07-06T23:18:26.864785Z","submitted_at":"2026-05-07T09:17:47Z","title":"Decoding Alignment without Encoding Alignment: A critique of similarity analysis in neuroscience","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-08T03:30:33.288849Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.05907"},"observation_digest":"sha256:e7ec08fd1e5e2b5cbc1493814d25c96c987e3d0686a26c1fb63f83ede63578dd","observation_id":"cda145da-b945-49cd-8e78-4bef3b415790","resolution":{"observed_at":"2026-05-09T00:24:28.623042Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.08485","last_updated":"2026-05-08T21:03:11Z","snapshot_observed_at":"2026-08-09T01:18:03.122010Z","submitted_at":"2026-05-08T21:03:11Z","title":"Sinkhorn Treatment Effects: A Causal Optimal Transport Measure","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-12T01:29:32.542771Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.08485"},"observation_digest":"sha256:4e91d6f082056916c37efa5b315c72b788d57e3788b44184601a8f66544a02fd","observation_id":"b3013295-304d-4150-bb4d-cc5f2f9efdc1","resolution":{"observed_at":"2026-05-12T01:31:14.065625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.13520","last_updated":"2026-05-17T13:40:28Z","snapshot_observed_at":"2026-07-06T23:25:07.022065Z","submitted_at":"2026-05-13T13:37:31Z","title":"Beyond Explained Variance: A Cautionary Tale of PCA","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-14T18:28:50.985913Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.13520"},"observation_digest":"sha256:16158a64f6f06c70a7089ba5056211be7767299651481eb1a5868a7a50a67758","observation_id":"1949425c-1d6d-4af2-ad1e-8978d730196c","resolution":{"observed_at":"2026-05-14T18:29:22.357050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2605.13520","last_updated":"2026-05-17T13:40:28Z","snapshot_observed_at":"2026-07-06T23:25:07.022065Z","submitted_at":"2026-05-13T13:37:31Z","title":"Beyond Explained Variance: A Cautionary Tale of PCA","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-20T21:20:08.319862Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2605.13520"},"observation_digest":"sha256:2d369275e07baf37cfa65155b358f561e22b2bb189af93d935c8a05e326d1939","observation_id":"830de82d-9820-4fc3-9437-1996b2f0b2df","resolution":{"observed_at":"2026-05-20T21:23:44.464780Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.10075","last_updated":"2026-06-19T14:07:02Z","snapshot_observed_at":"2026-07-06T23:49:17.868841Z","submitted_at":"2026-06-08T18:49:02Z","title":"An algorithm for dynamical quantum optimal transport with applications to quantum chemistry","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T15:23:52.776770Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.10075"},"observation_digest":"sha256:76e2c3157529e55370a61c37b55a0fb9179580bb4915a63bdeb08a617b019f9b","observation_id":"c5ad2e10-2672-40ee-a00a-29cb85f3f969","resolution":{"observed_at":"2026-06-27T19:01:08.826152Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.10237","last_updated":"2026-06-08T22:51:58Z","snapshot_observed_at":"2026-07-06T23:49:27.565372Z","submitted_at":"2026-06-08T22:51:58Z","title":"Minimalist Genetic Programming","version":1},"reference_index":107,"source":"arxiv_source","source_observed_at":"2026-06-27T16:08:02.393290Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.10237"},"observation_digest":"sha256:7398cca30cb27fb1c36e8a70536107f0f425df8a5be1f533e6cfb3cf7d1def04","observation_id":"77961f75-8106-461e-87d7-e30378054a1c","resolution":{"observed_at":"2026-06-27T16:11:02.842567Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.13216","last_updated":"2026-06-11T11:30:08Z","snapshot_observed_at":"2026-08-05T14:24:09.081487Z","submitted_at":"2026-06-11T11:30:08Z","title":"Layer-Resolved Optimal Transport for Hallucination Detection in NMT and Abstractive Summarization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T06:43:42.745984Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.13216"},"observation_digest":"sha256:1182ff09505f9814315279716808ee143200b85d1dca4bc138528d79e56ed95e","observation_id":"2a5d78dc-fa5c-4931-be3f-3c393a7989a4","resolution":{"observed_at":"2026-07-03T15:08:32.749733Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.19714","last_updated":"2026-06-18T02:26:05Z","snapshot_observed_at":"2026-08-01T18:27:22.876701Z","submitted_at":"2026-06-18T02:26:05Z","title":"AURA: Adaptive Uncertainty-aware Refinement for LLM-as-a-Judge Auditing","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-26T15:48:26.303462Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.19714"},"observation_digest":"sha256:9797d3a8085c104d88c08998730d72ba9a650f2b85ffa3e92794e3cd6f196eba","observation_id":"b02e2e5d-bce1-4f2f-afea-e8d4f7191834","resolution":{"observed_at":"2026-07-04T05:39:40.153157Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.20428","last_updated":"2026-06-18T16:09:50Z","snapshot_observed_at":"2026-08-07T01:06:12.173401Z","submitted_at":"2026-06-18T16:09:50Z","title":"ARC: Adaptive Robust Joint State and Covariance Estimation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T17:19:44.814480Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.20428"},"observation_digest":"sha256:22c438618fc845458e6c68d66792affbaa71e72895e2866ff9d2bf1c87f1652c","observation_id":"29e038ec-b64d-4a98-b4d1-4f80f471fa0a","resolution":{"observed_at":"2026-07-04T03:59:33.908292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.22008","last_updated":"2026-07-06T20:28:24Z","snapshot_observed_at":"2026-08-05T16:45:42.089593Z","submitted_at":"2026-06-20T12:15:24Z","title":"An Optimal Transportation Approach for Improved Confidence Intervals","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-26T11:46:00.234596Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.22008"},"observation_digest":"sha256:fbd8f30679c1c2197efcee38ce57cdf2464fa4c2e604c38d11b34b751f872b77","observation_id":"a7de6634-26ea-4cad-a208-c575215d87a6","resolution":{"observed_at":"2026-07-04T08:19:44.903944Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.22182","last_updated":"2026-06-20T18:25:16Z","snapshot_observed_at":"2026-08-05T04:09:37.344744Z","submitted_at":"2026-06-20T18:25:16Z","title":"Dual-Stream EEG Decoding for 3D Visual Perception","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-26T12:09:03.946197Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.22182"},"observation_digest":"sha256:a0afb7534f0233ee2ce24566a3c98e7d2878ae617e0c37e3cf2cd7a38a58ac23","observation_id":"916c1047-1b8a-41ae-a061-21fed0dfa4e4","resolution":{"observed_at":"2026-06-26T12:09:27.500969Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2606.24985","last_updated":"2026-06-23T14:24:43Z","snapshot_observed_at":"2026-07-06T23:59:28.120338Z","submitted_at":"2026-06-23T14:24:43Z","title":"Retrieval-Augmented Personalization with Foundation Models for Wearable Stress Detection","version":1},"reference_index":170,"source":"arxiv_source","source_observed_at":"2026-06-26T00:27:41.609691Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2606.24985"},"observation_digest":"sha256:e7a3d39de8c88ad2b940086b116810ff71e0fefd60f3aa74cd1060b358f4ec68","observation_id":"4d166955-ce0b-4003-ad75-0231e445d998","resolution":{"observed_at":"2026-06-26T00:28:42.716086Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-07-12T07:05:47.150308Z","title":"Computational optimal transport, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02781","last_updated":"2026-07-02T21:27:59Z","snapshot_observed_at":"2026-08-10T00:52:26.888113Z","submitted_at":"2026-07-02T21:27:59Z","title":"Safe Inference-Time Alignment via Lagrangian Reward Augmentation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-12T07:05:47.150308Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2607.02781"},"observation_digest":"sha256:8eed3e0bb1ff0898d6702060d44bb427f03da069f31288752649fd456d40d529","observation_id":"20885d27-65fc-40e5-8fc2-f1eb59ae16ac","resolution":{"observed_at":"2026-07-12T07:05:47.150308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":"1803.00567","doi":"10.48550/arxiv.1803.00567","metadata_source":"pith","pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational optima l transport","venue":"stat.ML","work_id":"a92e8650-eeee-48dd-b170-e3fd45fa2dc1","year":2018},"citing_paper":{"arxiv_id":"2607.07995","last_updated":"2026-07-09T00:00:09Z","snapshot_observed_at":"2026-08-08T03:40:08.643836Z","submitted_at":"2026-07-09T00:00:09Z","title":"D-CLIPSE: Distributed Consensus-based Localization with Passive Listening on Shared State Exchange","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T14:02:55.321628Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2607.07995"},"observation_digest":"sha256:527f025c5f46a25d6897219022d25520a5f677d395d5d6f24c82c3db66916a9c","observation_id":"75a33b1c-2121-4c67-a97f-0549697cc5eb","resolution":{"observed_at":"2026-07-10T14:07:06.705417Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:20:27.976954+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-07-14T08:13:58.427215Z","title":"Computational Optimal Transport , publisher =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10931","last_updated":"2026-07-12T21:37:33Z","snapshot_observed_at":"2026-08-02T07:32:25.523026Z","submitted_at":"2026-07-12T21:37:33Z","title":"Fast Whole-Brain, Geometry-Aware Functional Alignment for Cross-Subject Decoding","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-14T08:13:58.427215Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2607.10931"},"observation_digest":"sha256:c1acab610dbd7e2a3e279bae6e2d1fd45cf311d8a7ffd83b7afd5a305d58e8b0","observation_id":"32753770-b65b-4a72-bf0c-fa6cdffc8183","resolution":{"observed_at":"2026-07-14T08:13:58.427215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-01T21:54:02.011821Z","title":"Computational Optimal Transport","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15952","last_updated":"2026-07-17T13:38:08Z","snapshot_observed_at":"2026-08-05T07:04:52.819237Z","submitted_at":"2026-07-17T13:38:08Z","title":"Consistent pricing of bivariate interest rate exotics via constrained Schr\\\"odinger optimal transport","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T21:54:02.011821Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2607.15952"},"observation_digest":"sha256:20c83b01b5535fec30f88e0d0313c48eba14065494e7be5bb5460865ce60d8bc","observation_id":"d5fed551-9e0a-4609-b54e-8bd4c8487f02","resolution":{"observed_at":"2026-08-01T21:54:02.011821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00567","snapshot_observed_at":"2026-08-03T00:30:06.226984Z","title":"Computational optimal transport.arXiv preprint arXiv:1803.00567, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28776","last_updated":"2026-07-30T18:56:34Z","snapshot_observed_at":"2026-08-09T16:53:37.318773Z","submitted_at":"2026-07-30T18:56:34Z","title":"Representations from Pretrained Machine-Learning Interatomic Potentials as Coarse Coordinates for Material Generation and Evaluation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:30:06.226984Z"},"links":{"cited_paper":"/paper/1803.00567","citing_paper":"/paper/2607.28776"},"observation_digest":"sha256:28c015943e6c6f35f80baede90624e1e49e9a5ada8022d25529973d1f3af9415","observation_id":"8192c747-cb17-4b47-a9a8-4af51c4c4f3b","resolution":{"observed_at":"2026-08-03T00:30:06.226984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1803.00567/citation-record","integrity":"/paper/1803.00567/integrity","json":"/paper/1803.00567/citation-record.json","paper":"/paper/1803.00567"},"outbound":[],"paper":{"arxiv_id":"1803.00567","last_updated":"2020-03-18T09:54:55Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-03T21:19:53.521455Z","submitted_at":"2018-03-01T18:28:43Z","title":"Computational Optimal Transport"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 27 inbound Pith citation observations for arXiv:1803.00567."}