{"as_of":"2026-08-09T07:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c73cb86b2dbfdf81b356da11b1f44aa584366a86468176a16de3212beb39005","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T00:33:04.509520Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.06646/citation-record","integrity":"/paper/2607.06646/integrity","json":"/paper/2607.06646/citation-record.json","paper":"/paper/2607.06646"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.039882Z","title":"In: Colloque GRETSI 2022 – XXVIIIème Colloque Francophone de Traitement du Signal et des Images (2022)","venue":null,"work_id":"39ba3684-d6f1-479e-8987-bdb742f67b53","year":2022},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:ff9d9ebd9b187f30ae9ff51f810185e55da92c08655af5c20d3ec4356597c6cc","observation_id":"7188c7c7-e2c8-4866-8ce9-c6737d2f4484","resolution":{"observed_at":"2026-07-11T00:37:47.066228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.173733Z","title":null,"venue":null,"work_id":"50ce127a-5a5b-4211-902e-bea0e0b83978","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:05423ebc076d3b06bde6ff72ea1d15309ee4d8f8a68d69a809d1d2826f7e633f","observation_id":"2cae21c2-b40a-4137-bcd6-45cab89f8a24","resolution":{"observed_at":"2026-07-11T00:37:47.201476Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.706763Z","title":"In: Hutter, F., Kersting, K., Lijffijt, J., Valera, I","venue":null,"work_id":"ff694433-1ac6-48dd-a682-0f4db1141922","year":2021},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:5357faea0ddb67c143cd8658d4e50d60b2b0ededfc0db29c79a5f8fed6ad598a","observation_id":"75c5669a-4042-4393-9df6-51c375892fdd","resolution":{"observed_at":"2026-07-11T00:37:46.739549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.871108Z","title":"In: 2013 IEEE Global Conference on Signal and Information Processing, pp","venue":null,"work_id":"4e86fade-829f-4177-aa71-3b1281614812","year":2013},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:5be9a540f8a704dfed7bbdc6015fb54021551dc6d4de3d63601eae274f8dcc81","observation_id":"d3153417-198a-481e-b008-a05cb7b2851a","resolution":{"observed_at":"2026-07-11T00:37:46.898808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.06797","last_updated":"2026-05-26T18:10:55Z","snapshot_observed_at":"2026-08-03T18:14:02.515655Z","submitted_at":"2025-12-07T11:25:32Z","title":"Optimal and Diffusion Transports in Machine Learning","version":2},"cited_work":{"arxiv_id":"2512.06797","doi":"10.48550/arxiv.2512.06797","metadata_source":"pith","pith_arxiv_id":"2512.06797","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv, ://arxiv.org/abs/2512.06797, arXiv:2512.06797 [math], doi:10.48550/arXiv.2512.06797","venue":"math.OC","work_id":"904bba6a-259f-49b7-85fc-276dbbde0492","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2512.06797","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:5d94aad5a34ecbd0172c0a85be5f58fdda5180cf2b0da12a8e52b14cffe37082","observation_id":"ab51b5f1-899c-4367-b4d4-f37f298d02b9","resolution":{"observed_at":"2026-07-11T00:37:42.481629Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-06-01T22:57:52.622243+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-01T22:57:52.622243+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12721","last_updated":"2024-04-24T08:18:56Z","snapshot_observed_at":"2026-08-06T09:22:03.156725Z","submitted_at":"2024-01-23T12:46:02Z","title":"Wasserstein Diffusion on Multidimensional Spaces","version":3},"cited_work":{"arxiv_id":"2401.12721","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.12721","snapshot_observed_at":"2026-07-11T00:37:42.355157Z","title":"Wasserstein Diffusion on Multidimensional Spaces","venue":"math.PR","work_id":"fc70ff09-af0f-41c4-a993-042940259856","year":2024},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2401.12721","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:c984d4d149e27f167c6bbf0af4b6fefb214868bdff32fdaf2c7fa31d5fe3b36c","observation_id":"30eff21b-ab0a-4f08-b13c-20f8e8d8b587","resolution":{"observed_at":"2026-07-11T00:37:42.382639Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.487450Z","title":null,"venue":null,"work_id":"cb4d0290-7f0f-4928-9a11-a97bdcfb0925","year":2019},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:9cabce851eb4839a5c0ed91fade7ebdd1ecbad093b2a783ebaee6e0b1afeea0b","observation_id":"0e183e95-af00-43e0-af53-0cf8a70d5bcf","resolution":{"observed_at":"2026-07-11T00:37:46.521049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.15570","last_updated":"2026-06-24T14:45:59Z","snapshot_observed_at":"2026-08-05T20:54:22.654878Z","submitted_at":"2025-12-17T16:25:42Z","title":"Optimal Transport-Based Clustering of Attributed Graphs with an Application to Road Traffic Data","version":2},"cited_work":{"arxiv_id":"2512.15570","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.15570","snapshot_observed_at":"2026-07-11T00:37:42.324504Z","title":"Optimal Transport-Based Clustering of Attributed Graphs with an Application to Road Traffic Data","venue":"stat.ME","work_id":"257042c9-0522-4a66-b377-b9e01e6d2364","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2512.15570","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:672a7b9ce9faaf276515c4de407984c6ae67d408e1f891c62d33f26eb55402f5","observation_id":"1a2ca71b-47c0-483f-9c06-62b0f8479366","resolution":{"observed_at":"2026-07-11T00:37:42.349184Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.526329Z","title":"In: Advances in Neural Information Processing Systems, vol","venue":null,"work_id":"9f43ba18-7884-4d0e-8e33-214997a4ad11","year":2012},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:3e2b3ef1389002e49a0c4a7291f45b667172dbd8226b3c4fbf9db11852896b8d","observation_id":"ef0eb56b-e22b-4e3f-93c2-cf6f5006ba81","resolution":{"observed_at":"2026-07-11T00:37:46.558836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.563633Z","title":null,"venue":null,"work_id":"de191c0c-54c0-4c7f-9724-d27020eb58d3","year":2024},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:6fd6deba80922fe6607f62708fe9b50bad40c79d50471fab8f44b608331bdd96","observation_id":"a090e41d-f7af-4e8f-8bdd-4902a34eeef5","resolution":{"observed_at":"2026-07-11T00:37:46.590659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.824600Z","title":"Available online, last accessed 2026/01/15","venue":null,"work_id":"3c0393a6-7297-430a-b071-09c2b5f92980","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:9f7d003dcacfcba029917a4f3374a5b4275bc0aa8af6cec369a22f03590845ae","observation_id":"896d88c3-2546-4a7a-8498-9890e844162b","resolution":{"observed_at":"2026-07-11T00:37:46.851508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.267995Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":"c3ac1679-75c3-4772-a87b-03153a3bbb99","year":null},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:8fc7e7bb873706f38a7d2244a3a62b9ac803e1858c0bfb0503bb2393782cc7ae","observation_id":"3aba512d-240b-4a30-832f-01486b8668e3","resolution":{"observed_at":"2026-07-11T00:37:47.294350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.08733","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:42.391000Z","title":"arXiv:2511.08733 (2025)","venue":null,"work_id":"164b6b5a-c825-4acb-bbb7-afc5533463b1","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:eedfc99b07132282a94eff0c6a69c07fd42346db1da87d40a02be9690cc14c0d","observation_id":"1a93e577-d77f-4056-84fb-4bf02b05e7c8","resolution":{"observed_at":"2026-07-11T00:37:42.420210Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.206236Z","title":"Algorithms 13(9), 212 (2019)","venue":null,"work_id":"4b683363-f39e-4b39-b989-6e6fe757874f","year":2019},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:dc0a7f578f6622fdf8c2fe6e98c377db4beca8b697bfe5237a098257c4ee1fb3","observation_id":"ebf73920-1198-4a12-81ca-b96958892a00","resolution":{"observed_at":"2026-07-11T00:37:47.232731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.856255Z","title":"-K., Sturm, K","venue":null,"work_id":"95cb6834-4604-4813-bb28-a8d1f6397b77","year":2009},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:b1bed8d9fc2f9b7959b8f2bbc554e4b5816eb846fff96b80db2cf5982f38ccf3","observation_id":"0037cf83-8b67-45d0-a3a1-12de2e3ddbdc","resolution":{"observed_at":"2026-07-11T00:37:46.885473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.970267Z","title":"Electron","venue":null,"work_id":"0c9b0da4-260d-4c46-8833-3721c2cf7d19","year":2018},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:008fa329b54d6815be18bfd06c7025af20e31a574964551f8a313e234cc028cc","observation_id":"7513944e-b8c7-4cd3-9cfa-a7037df895e0","resolution":{"observed_at":"2026-07-11T00:37:47.000327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15130","last_updated":"2025-06-27T10:00:19Z","snapshot_observed_at":"2026-08-08T10:54:17.163678Z","submitted_at":"2024-02-23T06:32:01Z","title":"Diffusion Processes on $p$-Wasserstein Space over Banach Space","version":4},"cited_work":{"arxiv_id":"2402.15130","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.15130","snapshot_observed_at":"2026-07-11T00:37:42.426285Z","title":"Diffusion Processes on $p$-Wasserstein Space over Banach Space","venue":"math.PR","work_id":"ef0779ba-9d78-4503-b953-8ce5b7910a6e","year":2024},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2402.15130","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:652cdf50b51f262101636c4f55bad4517960ad51b77ab0132f2968a84baa315b","observation_id":"ca0c5442-b7c9-4ea9-b8a9-67e378682450","resolution":{"observed_at":"2026-07-11T00:37:42.453158Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17958","last_updated":"2025-02-15T15:40:43Z","snapshot_observed_at":"2026-08-06T15:54:29.257278Z","submitted_at":"2024-01-31T16:07:44Z","title":"Convergence Analysis for General Probability Flow ODEs of Diffusion Models in Wasserstein Distances","version":2},"cited_work":{"arxiv_id":"2401.17958","doi":"10.48550/arxiv.2401.17958","metadata_source":"pith","pith_arxiv_id":"2401.17958","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gao and L","venue":"stat.ML","work_id":"1ff9f9ba-0940-4720-8f9a-2a446eb6fe87","year":2024},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2401.17958","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:b6944a9a5659cf0e5888f8bd318bde2de63341bfe5198bf11518d90e2e191584","observation_id":"dc147df0-673c-4c29-9dca-a7de1d449cf4","resolution":{"observed_at":"2026-07-11T00:37:42.543587Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02239","last_updated":"2025-06-27T07:44:55Z","snapshot_observed_at":"2026-07-06T17:24:53.368337Z","submitted_at":"2024-02-03T19:00:19Z","title":"Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein","version":3},"cited_work":{"arxiv_id":"2402.02239","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.02239","snapshot_observed_at":"2026-07-11T00:37:42.486812Z","title":"Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein","venue":"cs.LG","work_id":"22fb9749-3e75-4b52-83c3-3fe8227e2c69","year":2024},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"cited_paper":"/paper/2402.02239","citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:0dc4dc6107ea54d58bdccb951b7742377bb73fea00f24def8aac8426b4f68165","observation_id":"99906418-a311-4c9d-a4e2-2719ac7ac12b","resolution":{"observed_at":"2026-07-11T00:37:42.510712Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.236743Z","title":"Impri- merie Royale, Paris (1784)","venue":null,"work_id":"0f19a5a3-f470-4ad6-a377-1be50b98195a","year":null},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:257173432f395500e952cec25e21520213f8a5bd412dca2897e431f683d3159d","observation_id":"a50463ef-03ea-4639-aefe-0eee2c0c161a","resolution":{"observed_at":"2026-07-11T00:37:47.263816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.136572Z","title":null,"venue":null,"work_id":"4693839a-712d-4d87-aeac-3782bfcd0986","year":1942},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:3ac9201e2753a02aa1f29ba5bf97cfec8dc4438df7045c666296abf2cbaefe7b","observation_id":"e47fe9f3-2d15-456f-82d4-8ddc48e2443f","resolution":{"observed_at":"2026-07-11T00:37:47.164177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.902982Z","title":"In: International Con- ference on Machine Learning, pp","venue":null,"work_id":"fb56a770-9ac8-4553-81bb-edbf3ba6a6da","year":2014},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:f9fa88e1204ca59431d76c9e0443aaffd1b694752be7830684d8617688f7b1ee","observation_id":"a80e9dad-2cb1-4e93-bbcd-437ee5365433","resolution":{"observed_at":"2026-07-11T00:37:46.931395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.071489Z","title":null,"venue":null,"work_id":"ea1fb172-cc35-446e-8efa-1814d5bfcd35","year":2023},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:27aeeb715d1f5636deb204457a7f0321f8da60314998ff77b5762e8c07565420","observation_id":"725968ba-c4bf-498a-a198-b02e698aba88","resolution":{"observed_at":"2026-07-11T00:37:47.097587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.297962Z","title":"Grundlehren der mathematischen Wissenschaften, vol","venue":null,"work_id":"b8f38c59-cccd-434c-89cb-0c1933f9601c","year":2009},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:e40ebb4fa8224aa361cc39c3c4ee934478d343887162180d21f532fab85f1718","observation_id":"6740f0c9-76b4-4fdc-aaa5-1cc040c26435","resolution":{"observed_at":"2026-07-11T00:37:47.330588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.937194Z","title":"Mathematics 13(13) (2025)","venue":null,"work_id":"29519dca-6c32-4a48-b014-a9488b89e2a1","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:2b5c822fe059b6e9d8a1f5dcebc0387809d16caa887a028dfb595b000432f979","observation_id":"9bc677b6-620e-4fe3-991d-f28afcb549be","resolution":{"observed_at":"2026-07-11T00:37:46.964477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.103401Z","title":null,"venue":null,"work_id":"8beeaf8f-a9fb-44b3-9351-23e6fe10f163","year":2025},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:4fdc1a904acb9eb844b0acf4d98c30344ab8ea81748fc6dd93b51e1499ae2463","observation_id":"fcfb4234-dfd7-4d79-a359-168863f199fc","resolution":{"observed_at":"2026-07-11T00:37:47.132392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.810782Z","title":"Journal of Transportation Research, 19(71), 183-206 (2022)","venue":null,"work_id":"f5bdf1fa-4fe2-48f7-9729-c202d0a6d2f7","year":2022},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:0a3e831cdd29d7f91a2020fb3c6df98b2ff915d47343fd869782d1097e2e6faf","observation_id":"4f952572-46e9-4412-91b6-61d356148d59","resolution":{"observed_at":"2026-07-11T00:37:46.837003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:47.005086Z","title":"Mathematics, 14(11), 1972 (2026)","venue":null,"work_id":"ca556134-a03c-4b40-8a7e-c8fed06be1b0","year":1972},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:2684fc7f036eba895e06020c8170a54721ddc29819bc1bf7b1d555a99d0e825d","observation_id":"a9a1aac4-f9c9-4827-98f7-6539a4e85a72","resolution":{"observed_at":"2026-07-11T00:37:47.035387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.777826Z","title":"Caspian Journal of Applied Sciences Research, 2(4) (2013)","venue":null,"work_id":"f54a6bfe-59cf-4169-a889-c8e0966674cb","year":2013},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:df200eec9eab51132f6be557338be2880c70e25b1bb360dd39b6a0e6546783b4","observation_id":"ded14dca-99cf-4392-8911-784ea44d648c","resolution":{"observed_at":"2026-07-11T00:37:46.806282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.743791Z","title":null,"venue":null,"work_id":"4564ac13-adf6-45e2-ae92-d022c8083281","year":2006},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:56f364c5b3290ac9b27c1064a734ff77aa80f75d68b1b9ffb5c41e1ac89c1a7e","observation_id":"5db2fd66-09e8-4164-9e3c-ae7dd706e3cb","resolution":{"observed_at":"2026-07-11T00:37:46.774568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.674303Z","title":null,"venue":null,"work_id":"2dda1cf8-c47d-441c-9d1b-009e5ba34bae","year":2012},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:e7526be1004b4c6c1fd3b3d3e736420ea79ed2be8450bf73b9744fc93623be68","observation_id":"534f81f3-3a80-4d67-90d8-23a1192e7f8c","resolution":{"observed_at":"2026-07-11T00:37:46.702803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T00:37:46.841098Z","title":null,"venue":null,"work_id":"864f6341-6536-4ee6-81d9-3af7d38f18c5","year":1985},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:1360a5b1409ef5b745b9027921b7b79fb87d14b79e0e5ee7cc44ef4e44f0e83e","observation_id":"c08ffc5b-e027-46e3-8f60-338f1451ddba","resolution":{"observed_at":"2026-07-11T00:37:46.866997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/math14030417","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathemat- ics, 14(3), 417 (2026)","venue":"Mathematics","work_id":"16754df0-3f02-40c8-8e26-ec62c75b10f9","year":2026},"citing_paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T00:33:04.509520Z"},"links":{"citing_paper":"/paper/2607.06646"},"observation_digest":"sha256:c21841a7389bc81921f3a64c7e1da930c5d19c0c4bf6332157d5f8bdb7085801","observation_id":"e25e1161-ceb6-49d3-8008-85273c91566b","resolution":{"observed_at":"2026-07-11T00:37:42.013428Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06646","last_updated":"2026-07-07T15:55:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T20:52:42.451878Z","submitted_at":"2026-07-07T15:55:34Z","title":"Diffusion enabled Optimal Transport distances for graph matching"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":9,"verified_exact":4,"verified_fuzzy":16},"total_outbound_references":33},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.06646."}