{"as_of":"2026-08-09T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f345094d83168dcbe7d31e35d9fb8ed1f0bab11a7665a2046471c907e3718b3d","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T21:11:48.250542Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"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.16178/citation-record","integrity":"/paper/2607.16178/integrity","json":"/paper/2607.16178/citation-record.json","paper":"/paper/2607.16178"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.00013","last_updated":"2018-08-31T18:00:27Z","snapshot_observed_at":"2026-08-05T21:06:55.312403Z","submitted_at":"2018-08-31T18:00:27Z","title":"Gromov-Wasserstein Alignment of Word Embedding Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.00013","snapshot_observed_at":"2026-08-01T21:11:43.336195Z","title":"Gromov-Wasserstein alignment of word embedding spaces","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.336195Z"},"links":{"cited_paper":"/paper/1809.00013","citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:1b28fda46e702b191581916a8e484c1ddc0bc7d690d10f32471941ede651a41a","observation_id":"215bcf7e-6a3b-4567-8957-a8cffc31f866","resolution":{"observed_at":"2026-08-01T21:11:43.336195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.404383Z","title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.404383Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:c42a2cf3e66e5e3b37e524fb52ac69bb4021ad49df7f8c75d4435232d0b80d19","observation_id":"d7662676-4d43-439c-bff3-d9a37afe0bd9","resolution":{"observed_at":"2026-08-01T21:11:43.404383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.468276Z","title":"A sober look at clustering stability","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.468276Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:52a3eddadc2211b508b5ec60cced5be2467e58205dbd07035fbd153f392fa45a","observation_id":"e4cf3b1c-894f-41f3-98c3-30d74a8ffe65","resolution":{"observed_at":"2026-08-01T21:11:43.468276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.523951Z","title":"A method for registration of 3-D shapes.IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2):239–256, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.523951Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:9b7347baf35e3a3f88ec8f51f810dadbc5666ddb847d5be351c264bac34271a6","observation_id":"fddb790b-283d-425c-976a-331b809c671a","resolution":{"observed_at":"2026-08-01T21:11:43.523951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.01666","last_updated":"2020-02-20T22:17:02Z","snapshot_observed_at":"2026-08-04T13:14:41.240804Z","submitted_at":"2020-01-06T17:02:16Z","title":"MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.01666","snapshot_observed_at":"2026-08-01T21:11:43.577842Z","title":"MREC: A fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data.arXiv preprint arXiv:2001.01666, 2020","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.577842Z"},"links":{"cited_paper":"/paper/2001.01666","citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:484884757f75b6b340c383b6a91b90df73ab18d09bd5dcd17d051abf41665ab5","observation_id":"0c6241d8-79b8-445b-a144-77aac9009e1b","resolution":{"observed_at":"2026-08-01T21:11:43.577842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.641970Z","title":"McGraw Hill, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.641970Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:8ef6d5d9ef466e69d0061730967ab7b2e2623e863a242d8e488b44e3f73a1ea1","observation_id":"0b609fe0-3f6e-44fb-9d49-1718d3910de0","resolution":{"observed_at":"2026-08-01T21:11:43.641970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.720047Z","title":"Learning generative models across incomparable spaces","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.720047Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:a131735b1f8f84ee8b07d068a6cca39ac5770aa448ec3b02a53a40f593a9cbdf","observation_id":"b53feb98-bf00-46f6-976b-3d42e3e582f8","resolution":{"observed_at":"2026-08-01T21:11:43.720047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.780755Z","title":"Diffusion maps.Applied and Computational Harmonic Analysis, 21(1):5–30, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.780755Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:64df7e775b97bbed3edddd9ff07890ef75add3c1e803fe3db77631554e046150","observation_id":"2a6e1729-ae04-4e81-990c-cab787e81101","resolution":{"observed_at":"2026-08-01T21:11:43.780755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.842145Z","title":"Optimal transport for domain adaptation.IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(9):1853–1865, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.842145Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:3710abdce150b81d5103f874879d3d475fe3192181c993b2fe63ebec6e326164","observation_id":"a153161f-6251-4e61-9b5c-0b1ca01bb7a1","resolution":{"observed_at":"2026-08-01T21:11:43.842145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.918496Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.918496Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:1cb9183c664961f13182eecac8b7fa6568f0e204b0a95003439ac4f1878108e8","observation_id":"37765069-0ab4-4e86-b6f1-832fed0d2640","resolution":{"observed_at":"2026-08-01T21:11:43.918496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:43.976845Z","title":"Efficient random graph matching via degree profiles.Probability Theory and Related Fields, 179(1):29–115, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:43.976845Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:5fb75e34d5c29eb3ef1135bd3e46f5eed5331342ab460b0a550cf1caaa8df90b","observation_id":"535ed611-3446-4faa-9486-81b187105a54","resolution":{"observed_at":"2026-08-01T21:11:43.976845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.058910Z","title":"On the existence of Monge maps for the Gromov-Wasserstein problem.Foundations of Computational Mathematics, 25(2):463–510, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.058910Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:e17e2157e8dcd4a317b6305aeced115a9686f9de1255289082681b208f76ee68","observation_id":"014d7ab6-c898-440e-9055-3e14faf3023f","resolution":{"observed_at":"2026-08-01T21:11:44.058910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.121399Z","title":"An algorithm for restricted least squares regression.Journal of the American Statistical Association, 78(384):837–842, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.121399Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:50ccd83ed2d7e7ee9ba992d804f337d960844c220c9df16c09665d21649c03b9","observation_id":"c2cb8d7c-0a61-4dc5-b884-bcf6aebeec06","resolution":{"observed_at":"2026-08-01T21:11:44.121399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.199465Z","title":"Regularized discrete optimal transport.SIAM Journal on Imaging Sciences, 7(3):1853–1882, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.199465Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:e0c2b617a59cd32056b090e1114a9732b0d878005003e2e8a93b9376dcfb3231","observation_id":"ac6868d7-3dd7-4cf7-843a-0a371baa1a4a","resolution":{"observed_at":"2026-08-01T21:11:44.199465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.267449Z","title":"Statistical optimal transport via factored couplings","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.267449Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:3e9d1b3333748f6c6398962f30ea348c9476c5ecfecf0bddb628e2fa91294146","observation_id":"b1fcd27e-637d-4c1e-843e-24110d285732","resolution":{"observed_at":"2026-08-01T21:11:44.267449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.303380Z","title":"Unsupervised alignment of embeddings with Wasserstein procrustes","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.303380Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:7c35fbc69b3e2a72b4f99a180aa280a3619afe2b53e647653c9618a214d978a9","observation_id":"af4a6b50-2a64-4f13-b67c-4caa7c29d08d","resolution":{"observed_at":"2026-08-01T21:11:44.303380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.365564Z","title":"On the added value of bootstrap analysis for K-means clustering.Journal of Classification, 32(2):268–284, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.365564Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:065d31d6468cffaa017161cf822828158f3905b936878aafa41b578e92dd3137","observation_id":"afa3e718-8ffb-4408-94b2-9ba8d6cb6d93","resolution":{"observed_at":"2026-08-01T21:11:44.365564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.431538Z","title":"Statistical significance of clustering using soft thresholding.Journal of Computational and Graphical Statistics, 24(4):975–993, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.431538Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:6685101ae98dacb947a55b4c1fde8f31a74629d33368c8c75067d31c1a2fe0ad","observation_id":"adb5dbf9-b171-4901-9c35-7bb868a99ec7","resolution":{"observed_at":"2026-08-01T21:11:44.431538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.500327Z","title":"Reversible Gromov–Monge sampler for simulation-based inference.SIAM Journal on Mathematics of Data Science, 6(2):283–310, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.500327Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:f5c90e43aa6051e508b55d508f294836e61dabef9ff82b061c1a9f3195596a66","observation_id":"e7113cd8-38a4-4013-b180-fb8e9edbbc36","resolution":{"observed_at":"2026-08-01T21:11:44.500327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.553682Z","title":"Robust point matching with distance profiles.Journal of Machine Learning Research, 26(205):1–38, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.553682Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:8c0fc1c1a8db171c738e9234140af2d53d08fc58ff5d52a2017bc0a54d371612","observation_id":"995c4595-72d5-4a1c-aa52-47e5edb2b848","resolution":{"observed_at":"2026-08-01T21:11:44.553682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05372","last_updated":"2024-07-07T13:52:46Z","snapshot_observed_at":"2026-08-04T14:27:00.390407Z","submitted_at":"2024-07-07T13:52:46Z","title":"A Convexified Matching Approach to Imputation and Individualized Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05372","snapshot_observed_at":"2026-08-01T21:11:44.618646Z","title":"A convexified matching approach to imputation and individual- ized inference.arXiv preprint arXiv:2407.05372, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.618646Z"},"links":{"cited_paper":"/paper/2407.05372","citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:1e945a65b1d91fecf35dc66b8a49fa94bca217016e163ea473726735c71588ed","observation_id":"ed18baf8-0ad1-489d-8e97-762dadb3b557","resolution":{"observed_at":"2026-08-01T21:11:44.618646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03488","last_updated":"2026-04-09T19:27:44Z","snapshot_observed_at":"2026-08-02T08:39:44.952222Z","submitted_at":"2026-04-03T22:27:27Z","title":"Inference for Clustering: Conformal Sets for Cluster Labels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.03488","snapshot_observed_at":"2026-08-01T21:11:44.689947Z","title":"Inference for clustering: Conformal sets for cluster labels.arXiv preprint arXiv:2604.03488, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.689947Z"},"links":{"cited_paper":"/paper/2604.03488","citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:f103bcb0da3683be9b582e8696c7c925c8140d998063fb66db8ed3b2953f9f8e","observation_id":"787419bc-fdb2-4493-953e-fcee38086d74","resolution":{"observed_at":"2026-08-01T21:11:44.689947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.835632Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.835632Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:326e7486098cbde168996eb1bb2ad4e7871a2b54a121a518ca306864137bc131","observation_id":"47ece751-c1b2-4e16-a791-fe3afb0de212","resolution":{"observed_at":"2026-08-01T21:11:44.835632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:44.948541Z","title":"Assignment problems and the location of economic activities.Econometrica, pages 53–76, 1957","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:44.948541Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:1b3735fce24de50b0f9ec1c1c4e7e343bc0d7bbd57a272d3793691413485e34d","observation_id":"160b23ad-b5ae-45a7-82a4-9067d773a8c0","resolution":{"observed_at":"2026-08-01T21:11:44.948541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.039508Z","title":"Mechanisms to improve clustering uncertain data with UKmeans.Data & Knowledge Engineering, 116:1–18, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.039508Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:381292cb05df0234d15144543106279fccc1cde59c9127b032dbb0b49cb5f7ca","observation_id":"61ebb858-8108-43f0-92cc-126cd240b4d3","resolution":{"observed_at":"2026-08-01T21:11:45.039508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.162093Z","title":"A survey for the quadratic assignment problem.European Journal of Operational Research, 176(2):657–690, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.162093Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:9323396e4373c09c66f937c362d1feb9670051ab1917c3aaf3c9ed0991b49190","observation_id":"6b1a0ff3-e36e-48b6-8915-bcaef92524d4","resolution":{"observed_at":"2026-08-01T21:11:45.162093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.277737Z","title":"Gromov-Wasserstein distances and the metric approach to object matching.Founda- tions of Computational Mathematics, 11(4):417–487, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.277737Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:07a79ff0024929232fb82443be5ad235de0cd62f6e30eeb4c325a3218e49a7d2","observation_id":"4006e082-f020-4e46-af5c-e38154a3c667","resolution":{"observed_at":"2026-08-01T21:11:45.277737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.399183Z","title":"Comparison results for Gromov-Wasserstein and Gromov-Monge distances.ESAIM: Control, Optimisation and Calculus of Variations, 30:78, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.399183Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:ee55d8837a114a9e367fdbc389d1f666423bdf54fb966e7599421648ee732307","observation_id":"e5617e8b-2a8e-46af-bb1b-07c8af193ffd","resolution":{"observed_at":"2026-08-01T21:11:45.399183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.496242Z","title":"Point set registration: Coherent point drift.IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(12):2262–2275, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.496242Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:58f780e825427b99a61dce32f6392801ff6b3855f96f765ca708e287659b90b8","observation_id":"0084fef0-0b95-403d-b040-f308b69e554f","resolution":{"observed_at":"2026-08-01T21:11:45.496242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.00436","last_updated":"2026-05-29T23:58:56Z","snapshot_observed_at":"2026-08-08T09:53:21.522558Z","submitted_at":"2026-05-29T23:58:56Z","title":"Weighted Conformal Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.00436","snapshot_observed_at":"2026-08-01T21:11:45.615657Z","title":"Weighted conformal clustering.arXiv preprint arXiv:2606.00436, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.615657Z"},"links":{"cited_paper":"/paper/2606.00436","citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:9b8adbca0701ca45f64f85bf5a7ee29990dff1f7a0f04c0182cde7d99f84baf5","observation_id":"7b271f33-5a5d-4d65-b7df-8501d9c1e21a","resolution":{"observed_at":"2026-08-01T21:11:45.615657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.776260Z","title":"The canonically posed 3d objects dataset","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.776260Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:fe4ba4782b175a2b6e94ddf9a621109ea7037b5ffca525c14afb3a74a2573f87","observation_id":"a48dcca7-78e4-4ab8-bb9e-1d361512eb10","resolution":{"observed_at":"2026-08-01T21:11:45.776260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.863495Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.863495Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:b1f1c920f0f3f15c33a51f3c015c9ef2189071219cab200d012a0b501e2528b3","observation_id":"811c1729-b0f9-4c24-b226-a89cbf631e06","resolution":{"observed_at":"2026-08-01T21:11:45.863495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.921766Z","title":"Gromov-Wasserstein averaging of kernel and distance matrices","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.921766Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:bb72c3953111ffa0466559b6c6ebad0d8f13cfedea0844fabb53fa3d7eb63b65","observation_id":"d0cc7e7d-89af-4d65-9a3c-cff2a67544fd","resolution":{"observed_at":"2026-08-01T21:11:45.921766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:45.993056Z","title":"Stability k-means clustering","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:45.993056Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:e185ffac06c480a53bb0843759069fc01812a18098d0b42cbb838a92d9707624","observation_id":"8efd5689-0ef8-4931-b9b1-91e7877ebe6e","resolution":{"observed_at":"2026-08-01T21:11:45.993056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.056367Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.056367Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:4c16be27f20a6119f8cd49a46f49c51bb87090085f532e2d631dde3b547a173a","observation_id":"e615c42b-a954-45fd-bb7a-69f8ed771153","resolution":{"observed_at":"2026-08-01T21:11:46.056367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.118294Z","title":"Fast point feature histograms (FPFH) for 3d registration.IEEE International Conference on Robotics and Automation, pages 3212–3217, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.118294Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:412ad0df4c3445032dd81cab481fb0c145f61b2651e7512da1bcf85d14975f23","observation_id":"36ca1a09-b072-4b8e-b4b1-db5358593a20","resolution":{"observed_at":"2026-08-01T21:11:46.118294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.192640Z","title":"Recent advances in shape correspondence.The Visual Computer, 36(8):1705–1721, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.192640Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:2b51410234f6dd32ca51dece8137edb079e96bfb868db444403ddffbcfe12616","observation_id":"1b9fafcd-f262-4405-a854-63133fbb6e52","resolution":{"observed_at":"2026-08-01T21:11:46.192640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.312458Z","title":"Low-rank optimal transport: Approximation, statistics and debiasing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.312458Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:e16de0d03d42e121c0a23166cedb7a977ebca4f96f9fd77effab4564850dd8bd","observation_id":"9f62e1f5-8cce-4930-976a-3275abdddfb9","resolution":{"observed_at":"2026-08-01T21:11:46.312458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.466953Z","title":"Low-rank Sinkhorn factorization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.466953Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:a151c2c6d8fafc2c7e97ade3e30ae1fc7ab788204cc16beb36205b25343ab8f0","observation_id":"d8236b62-3e1e-408b-aeb5-5278267d6f31","resolution":{"observed_at":"2026-08-01T21:11:46.466953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.586746Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.586746Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:b060fcf7682f0cb1609b7ad470877feb738bd939a42161eab1d9ced8a74be134","observation_id":"a2743b34-43f9-423d-9095-677b0834b06f","resolution":{"observed_at":"2026-08-01T21:11:46.586746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.709456Z","title":"Generalized-ICP","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.709456Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:54982dd5cafe66a405baee599bde6266710f618652ec86ff45c9fdae354b3eef","observation_id":"4517affc-a2d5-42a2-9785-a40ae01c0e73","resolution":{"observed_at":"2026-08-01T21:11:46.709456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.865655Z","title":"Critical limitations of consensus clustering in class discovery.Scientific Reports, 4(1):6207, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.865655Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:1c94446d2b360c3cc14e168182c02d5d61f3c63cf80f19b0bc74611509c03e04","observation_id":"5a4ec3fd-dcb3-469c-b6f1-f6df1e38f554","resolution":{"observed_at":"2026-08-01T21:11:46.865655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:46.986495Z","title":"Alignment of density maps in Wasserstein distance.Biological Imaging, 4:e5, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:46.986495Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:27af156a92157cd888ec73a3bab926d0c0e5cf64edb5c7a082c44c15f8cd9b1d","observation_id":"39136c2c-4875-4bff-853f-2d0c4f38f316","resolution":{"observed_at":"2026-08-01T21:11:46.986495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.214622Z","title":"Lack of evidence for the transitional cerebellar progenitor.Nature, 643(8071):E1–E8, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.214622Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:342060e62fe782d2e4ad59d6aaec863c08745c21ae13b8764ca3c0b98726ac68","observation_id":"c88d65c6-c5b6-4433-9696-f24b39708ad8","resolution":{"observed_at":"2026-08-01T21:11:47.214622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.349713Z","title":"Entropic metric alignment for corre- spondence problems.ACM Transactions on Graphics, 35(4):1–13, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.349713Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:d74ef84e65ee46b23d89b021c5fe0be78f919eb5ec01d1fe3f44b10cd83d7c50","observation_id":"4f9a24e7-d9f9-4bdf-9ffa-1b2fa5a7f582","resolution":{"observed_at":"2026-08-01T21:11:47.349713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.509099Z","title":"A survey on shape corre- spondence.Computer Graphics Forum, 30(6):1681–1707, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.509099Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:c869f9faf0552115295c3f7424b5c677958f65c9cc6e00ca04c65541b0bc4f1b","observation_id":"a7f6a152-18d8-4489-9efa-9d9eae3395d1","resolution":{"observed_at":"2026-08-01T21:11:47.509099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.625014Z","title":"American Mathematical Society, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.625014Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:008199f3c65f063318793d28d3890fc4064e6112e7ad7a28271e355ec3c0eb2c","observation_id":"4ce4acb2-4e9b-427e-a04b-09dabdfcdd07","resolution":{"observed_at":"2026-08-01T21:11:47.625014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.773615Z","title":"A tutorial on spectral clustering.Statistics and Computing, 17(4):395–416, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.773615Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:0a21502368b70cfb97b202ccdc7a86a2fd19cd9298cdbd03941b5af51cee76d7","observation_id":"9620e8d3-3448-421b-bf0c-bd3d7d8f36d4","resolution":{"observed_at":"2026-08-01T21:11:47.773615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:47.948721Z","title":"Clustering stability: An overview.Foundations and Trends®in Machine Learning, 2(3):235–274, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:47.948721Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:cc3814615d7d8295f3f2f3503a6ead23287148b00ceba4b645c14d54d6c27ad1","observation_id":"71cdb0d6-c807-49d3-babb-d67a4aa19973","resolution":{"observed_at":"2026-08-01T21:11:47.948721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:48.033484Z","title":"Bayesian cluster analysis: Point estimation and credible balls (with discussion).Bayesian Analysis, 13(2):559–626, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:48.033484Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:87847cdf16e1b2d0cbdefa76314aaa93bd1adcc6714465ae7035af4409fe7979","observation_id":"aad866c6-7a60-4365-92eb-f8cde4d18fc8","resolution":{"observed_at":"2026-08-01T21:11:48.033484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:48.105718Z","title":"The use of entropy maximising models, in the theory of trip distribution, mode split and route split.Journal of Transport Economics and Policy, pages 108–126, 1969","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:48.105718Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:26f5a755cde09728bfaa71c1dd72341c52f115c2606357f43f333ad8cb32fa3f","observation_id":"6ba7a700-f37f-423d-a80e-230a741814f0","resolution":{"observed_at":"2026-08-01T21:11:48.105718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:48.177477Z","title":"Optimal transport for brain-image alignment: Unveiling redundancy and synergy in neural information processing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:48.177477Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:c0aa84990b755063006a770f56a3d82ccb4a638fe4a978f1c1997f0df9f3998c","observation_id":"8ccda70e-41f3-47a2-89ee-1d672d6dded3","resolution":{"observed_at":"2026-08-01T21:11:48.177477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T21:11:48.250542Z","title":"Gromov-Wasserstein learning for graph matching and node embedding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T21:11:48.250542Z"},"links":{"citing_paper":"/paper/2607.16178"},"observation_digest":"sha256:7bae079c0a9f499e3e6b132a3c3cf06a8a0caef57cc1112cc6cbbe580fa5d18c","observation_id":"a7aacc24-841c-46c9-beef-b62bab39a4fc","resolution":{"observed_at":"2026-08-01T21:11:48.250542Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16178","last_updated":"2026-07-17T17:56:51Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T08:41:26.958514Z","submitted_at":"2026-07-17T17:56:51Z","title":"Cluster-Aware Matching via Laplacian Optimal Transport"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":53},"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 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2607.16178."}