{"as_of":"2026-08-08T02:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1020add38e2abbdaeb4307d0a938c1772b4f12c9fae8d2955c569baccc4383cb","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-07T06:34:17.273281+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:d8b63c6e0e4abd1c6540abb43efeea131c90ca6f409d178db8d2f8cdcdb4023e","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:58cb418fcc473b453c099656f2f0c2e953eef709f54ae5667716d12eb32f094b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:340af3656b127d2465b5a20b37c6405c02a37264470dccffb0a948a13c454042","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:f025b95117195168cf4528b3fd575b05fd4670ecc93f8a4f2409a200ad5bc872","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:ddb20ff51f22d3e3af7fafc240ec8eadc59f159a8d5f03dc0cc8209dc246305c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+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-07T06:34:11.927384+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:311c4e0d6f80a5ceabe5b5eefed1faf15836c5bd5438557a6df34d1d608f7919","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:00023b40bd4759c639a37d6f95c072cdd7b41eaf960d9c31d13971a51d173a29","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:8cbc5e003f4ceda126c694fe5d5516bd09ac23143c3c8b67cc12595146a4a410","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:93332e92256e5210acb8cd5cbf0415b249f7aa86679dccf16532883509979e04","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:f4f8cd3b4b08d5db695a266b5606125ac39b80ad368460f04b1b1fec51e5e3cd","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:fc66045987a5648783ea806e4ffedb2d1b5c32a8f41dc5dacd70980306ddd75f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:559dafd99b88d8c201a12673d3616121d33ac2ff7e33e5d7c630cac12d2b9e7c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:6d8d5f6f6dbefe0567651d53a83125861c4f7f8cf34c7b935ae06c7deedf7996","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:1ed65027c26823cb49fe1548cbc8410b06b4b2d1007bf880c42bfad050477e7b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:4366c03315ab98438c6449c38d574330e8166ae3287f5518bc6d0145dca45e91","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:806995add9cde9b9ddd5b60617c671efc510febd0701806cb32ee7de4b7fe2d8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T20:54:17.686886Z","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:2cb722d1c593f134423f8e429e13e08d048a30a30b287f62cb55341d8d674bea","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:35950a187f4108bcb273ab745a7bfa8aadcebeb485386c7f6cbac9e719820393","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:8b9cd71109b9d2e66ec1b6821cb2f7ed10ed9ee86e3b22509b384f43bfb32d4f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:822c9279731ab48b50db5f4ee399a6e9f2b54089aa9625d7b339867ddc835eba","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e9195f87cce0607dd107646721967e8168023bc8c5bf3b1c2c2ea3872b993c4c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:64e72b0b4b9a840b188b8ebfb48c2726d8ce2544607b6ad9013338a8008b7ce9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:960a53d5fbcccd65183416b5023c2a62cd6e319747c646bc59cfdb19c9f62735","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:97c17ff38ddb97307fba7a687f16795c72866ecaffcd81efbd632eedfbd4a98a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:6c51ba50f73246ac1a478c3dfd5a05366bf077d8e939e69ef79b4a66de7e69f3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:8aae9cdb762ebd302b81ca0ccb004456fd751b457cd57c918b042792cd82b1f9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:51eab73bf5a865d4d0528c221d81a059c5da734afa4f122ef174357d3ea92f5c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:9b5aa10cb9742e293932e8f783c5333ecd647403e3ee0a4879d6c9c46c8a1992","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:27a09c10412c504798a59700b1c828bbf2b40bde7d4e09f43bc99bd3188f55e9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:666fc92b452381e8fafc2d0a1d4984e5158eefd8d566c7553e7f7c5a9e50273a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:f034e56e0a421d19eb4c0d212244f8a13e0c8f364b85221ade4bc7808c6037d9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e81cc920f24bf3881c72922d194636f18c8057c9b7070c46aff739b8f5027f3a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e1b8dd2c8378d7ace8677c027cd29585840abc344d2b21b21d840f4dce03c09d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.06646."}