{"as_of":"2026-08-18T05:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16a54692758fd58238c5c00505337b445b0db6a8c620c67920694f8fd7a7453e","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:51:27.483707Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T08:27:20.516403Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T08:33:15.454688Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"cited_work":{"arxiv_id":"2501.14945","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.14945","snapshot_observed_at":"2026-06-29T08:33:15.454688Z","title":null,"venue":null,"work_id":"501c2bdc-68f1-47d1-acf8-8fd49c4a4457","year":2025},"citing_paper":{"arxiv_id":"2605.30093","last_updated":"2026-05-28T15:37:59Z","snapshot_observed_at":"2026-08-15T01:10:29.242026Z","submitted_at":"2026-05-28T15:37:59Z","title":"Geometry Matters: 3D Foundation Priors for Learning Semantic Correspondence","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T08:27:20.516403Z"},"links":{"cited_paper":"/paper/2501.14945","citing_paper":"/paper/2605.30093"},"observation_digest":"sha256:85b59d6bebd7982b582eb3f107bbc05c0d9a8fa195d9c122199519495808b903","observation_id":"c7deb08d-9382-49c8-aa53-5d558a6b4938","resolution":{"observed_at":"2026-06-29T08:33:15.456003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.14945/citation-record","integrity":"/paper/2501.14945/integrity","json":"/paper/2501.14945/citation-record.json","paper":"/paper/2501.14945"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.850617Z","title":"Hpatches: A benchmark and evaluation of handcrafted and learned local descriptors","venue":null,"work_id":"f8fb3d17-e058-4610-8d90-b76969fd5bca","year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.056747Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:0b5b6f722cdfe691898d5a2b3f3d897529fa075c5fb888ef87f9e896e5cbdeaa","observation_id":"93c8fced-7154-49a5-8e53-0f0db99b7acf","resolution":{"observed_at":"2026-08-10T14:51:28.856857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.063399Z","title":"Speeded-up robust features (surf)","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.063399Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:58fdfed42d5baaeab744593dbd2153a6903b49584579847c319bbf9197df8663","observation_id":"f79eaf53-3cc5-4c3b-85b2-742f4a744da0","resolution":{"observed_at":"2026-08-10T14:51:27.063399Z","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-10T14:51:27.068793Z","title":"Emerg- ing properties in self-supervised vision transformers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.068793Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:73bc6e5bb0908a0028291262f0f35c01a1f8eefcda1a44c3fa6d9b5e9968bdc1","observation_id":"e660e997-c665-4f8b-80a3-bcbd8f35fc62","resolution":{"observed_at":"2026-08-10T14:51:27.068793Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.805148Z","title":"Aspanformer: Detector-free image matching with adaptive span transformer","venue":null,"work_id":"b886291b-1f56-440e-ad84-922a06b0fd0f","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.074081Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:d07da67034fe69fc03c99dc4dcb6f12aa895d580cc5656c7489c1ee4725ea6e9","observation_id":"39294db8-c484-4a92-8503-e4923ffa0ab5","resolution":{"observed_at":"2026-08-10T14:51:28.811650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.786589Z","title":"Cats++: Boosting cost aggregation with convolutions and transformers","venue":null,"work_id":"5c7e9d8e-9599-4970-b1d9-c5f74a1fe5be","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.079085Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:cb7eefa551fa1fb5b186ca66541a6ef6ac352bcfd76ce15ad254445431d049cd","observation_id":"f1ceb188-5652-40fa-a1c6-9dc267d8116b","resolution":{"observed_at":"2026-08-10T14:51:28.792625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15420","last_updated":"2024-07-22T06:49:56Z","snapshot_observed_at":"2026-08-16T13:32:14.469662Z","submitted_at":"2024-07-22T06:49:56Z","title":"Local All-Pair Correspondence for Point Tracking","version":1},"cited_work":{"arxiv_id":"2407.15420","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.15420","snapshot_observed_at":"2026-08-10T14:51:27.728125Z","title":"Local All-Pair Correspondence for Point Tracking","venue":"cs.CV","work_id":"75331ccc-566f-4541-b3f1-df0d188f05b6","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.083961Z"},"links":{"cited_paper":"/paper/2407.15420","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:9eacc7a5208c0c8f0329b71ee059054cd3f0c7254efedfe6ac73cca5673021fd","observation_id":"34a9a2fd-d0a9-4427-b644-1e714fd42016","resolution":{"observed_at":"2026-08-10T14:51:27.736662Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.090505Z","title":"Universal correspondence network","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.090505Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:7a75e16dc2849daa8b68374015dee49023eb4467dd0f68db7e33149b5a004b27","observation_id":"96296656-85a6-4820-b9c5-5aed98b9c80c","resolution":{"observed_at":"2026-08-10T14:51:27.090505Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.753962Z","title":"Locally opti- mized ransac","venue":null,"work_id":"cfee97a4-12bf-46c2-ba10-34b912a8b43a","year":2003},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.102404Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:32eb407551909dffc8dd5223f0cbe36a549664c5bb418b5b67d01f43ad026299","observation_id":"8cc3dc40-359a-48b2-82e3-9365031a7960","resolution":{"observed_at":"2026-08-10T14:51:28.759860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.734890Z","title":"Scannet: Richly-annotated 3d reconstructions of indoor scenes","venue":null,"work_id":"58bdaf06-2d60-44df-ba84-12d3a518e3a3","year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.109043Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:1f3a1b82d6d3c9e09cca523f9116516b65722c797d98b786f8d5fc00d710c2bf","observation_id":"71a26870-801a-40e0-8435-3120b18557ff","resolution":{"observed_at":"2026-08-10T14:51:28.740756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.715980Z","title":"Superpoint: Self-supervised interest point detection and description","venue":null,"work_id":"534ee7db-140a-4462-bd0e-301d80523b00","year":2018},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.119094Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:6deb90901d4a4d98263fb901022d38bac23f8104b9b4967a4d1c089a72b7888a","observation_id":"7506d4a6-5ee6-4f1c-9b0d-517158f953cb","resolution":{"observed_at":"2026-08-10T14:51:28.721868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.124931Z","title":"Diffusion models beat gans on image synthesis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.124931Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:ad048bb842a34a6a5a04a1491effd02e75e1e08c12143ad7edd793766a97b216","observation_id":"d1938e24-7c4c-4f93-88ca-c28c96d8b0ed","resolution":{"observed_at":"2026-08-10T14:51:27.124931Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.684225Z","title":"Tap-vid: A benchmark for track- ing any point in a video","venue":null,"work_id":"34ef16dd-7515-494e-a461-7d8acaece379","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.130049Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:f2da80bcdd6c08ede14628244b3f126fee36689f0246eda76b99739605d45100","observation_id":"9bdc9547-1767-4d1f-b14d-a80beeefcbdb","resolution":{"observed_at":"2026-08-10T14:51:28.690579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.135651Z","title":"D2- net: A trainable cnn for joint description and detection of local features","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.135651Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:96d1cc89e72554fb3ed5ca8d93ddd53e65ff30840b9526f70ab9702f094e7c11","observation_id":"3677a6b5-1d2f-4b21-a5ee-dcc20a135edd","resolution":{"observed_at":"2026-08-10T14:51:27.135651Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.654541Z","title":"Dkm: Dense kernelized feature matching for geometry estimation","venue":null,"work_id":"9a9ac3e0-ca65-4896-9737-12bb8b1e07c6","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.140707Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:16e168726dd04593acee5e27b3f09033b1b95a10e6c4d4ba79aa1becacbc100a","observation_id":"f4845c83-6c97-4c85-a413-86d7c5771218","resolution":{"observed_at":"2026-08-10T14:51:28.659777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.635193Z","title":"Roma: Robust dense fea- ture matching","venue":null,"work_id":"5e71a8d9-519d-470e-987c-48a6c30af881","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.145747Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:fc2ed8c418c7008c33c7bee36ccbbdb83619a2bef69e6d80f9b0503fd5c7ef9d","observation_id":"0414f724-d424-4d75-8c69-1e69bdafa9f4","resolution":{"observed_at":"2026-08-10T14:51:28.641314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.01673","last_updated":"2020-04-03T17:04:34Z","snapshot_observed_at":"2026-08-02T12:50:54.694695Z","submitted_at":"2020-04-03T17:04:34Z","title":"S2DNet: Learning Accurate Correspondences for Sparse-to-Dense Feature Matching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.01673","snapshot_observed_at":"2026-08-10T14:51:27.150689Z","title":"S2dnet: Learning accurate correspondences for sparse-to- dense feature matching","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.150689Z"},"links":{"cited_paper":"/paper/2004.01673","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:cf7edb821d1db44c7ff8e68d250a5aa137b74de0d06205a39bce4feeca1c6999","observation_id":"522b4de1-e7cb-42cf-ab52-0b4d18b6fcc4","resolution":{"observed_at":"2026-08-10T14:51:27.150689Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.618892Z","title":"Proposal flow","venue":null,"work_id":"ad1797f6-b20e-4ffc-a1f8-eecea6776bfd","year":2016},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.156240Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:cfafd9a18fa9bf6ab1fb481c7a91d75fc057a9a33bc0e5283ffefc9c40d75552","observation_id":"05e8cb55-fe1b-404c-ae51-792685ed422a","resolution":{"observed_at":"2026-08-10T14:51:28.623789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.601350Z","title":"Proposal flow: Semantic correspondences from ob- ject proposals","venue":null,"work_id":"e91a570b-5a88-408b-841e-d37f3eab9cf6","year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.161554Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:e20bc9bfd1506d16d25d6d5d38afbedad7f09732a278aeb5ef8114bdd0a31239","observation_id":"a5664707-f367-4245-90fc-14fb9c70169f","resolution":{"observed_at":"2026-08-10T14:51:28.606834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.580874Z","title":"Harley, Zhaoyuan Fang, and Katerina Fragkiadaki","venue":null,"work_id":"9864c6a9-e89f-4317-91da-09ae931a37a7","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.166741Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:27f7d1dc343f9df6902b6bc0b25da3d083d27c8bcead006c75435e521395ff80","observation_id":"8bf96b9d-48b6-4d46-9af2-b9ee6fc14dfd","resolution":{"observed_at":"2026-08-10T14:51:28.588732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.564001Z","title":"Unsupervised semantic correspondence using stable diffu- sion","venue":null,"work_id":"7b99ef4b-dc18-4a01-b6da-2e9e8af5f3e4","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.171816Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:78a698b1cfa1aea4ce39ac4ceab09a39934d1bca1abd46381ea247e244a2652b","observation_id":"e4a1947f-44d4-4398-9a56-2574a87bf7b7","resolution":{"observed_at":"2026-08-10T14:51:28.569465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.545276Z","title":"Learning semantic corre- spondence with sparse annotations","venue":null,"work_id":"254566cb-4f17-4d74-be9f-45e9657143f9","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.177188Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:29c07672501c6a13be51ce35d90ba88216ca6fea543feb1e373d3d3ee3dca601","observation_id":"11b83b06-1f10-4f47-b21e-d433bd855581","resolution":{"observed_at":"2026-08-10T14:51:28.551535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.527157Z","title":"Openclip, 2021","venue":null,"work_id":"e39c7471-851d-45da-8d27-a6e210e2995b","year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.182083Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:6791d337e2454d59b4ca12986c91f79261e9f9e7b05df37861f0fa7bd521f5a4","observation_id":"83067faf-987a-4076-ab40-b402959f2b9d","resolution":{"observed_at":"2026-08-10T14:51:28.532662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.509233Z","title":"Omniglue: Generalizable feature match- ing with foundation model guidance","venue":null,"work_id":"b3b59094-ff5e-4f9f-91ca-a635effea1ee","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.186984Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:603e907e1cdb875743878a16fd94903e14277783627bcc6a1cae37f9cf0fba31","observation_id":"cde7f61c-bf5a-4c3f-b639-e5428f00aafa","resolution":{"observed_at":"2026-08-10T14:51:28.514417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07635","last_updated":"2024-10-01T13:15:53Z","snapshot_observed_at":"2026-08-16T15:16:08.062270Z","submitted_at":"2023-07-14T21:13:04Z","title":"CoTracker: It is Better to Track Together","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07635","snapshot_observed_at":"2026-08-10T14:51:27.192273Z","title":"Co- tracker: It is better to track together","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.192273Z"},"links":{"cited_paper":"/paper/2307.07635","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:6647879c4536efcdf3d6b799278210348f556ef7e4c7c422b1eb7a88ca4e2f26","observation_id":"2d5cca5c-ce0a-4f11-8e47-59d65729f4ac","resolution":{"observed_at":"2026-08-10T14:51:27.192273Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.492354Z","title":"De- formable spatial pyramid matching for fast dense correspon- dences","venue":null,"work_id":"1510a09d-d373-474d-b2ab-c5ec7cc85a64","year":2013},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.197745Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:71e9d8bb2ea1a51a351cb814b9139a705722f2387d8bf382cef7244365be8b11","observation_id":"ba7fbd29-7182-44b8-b70e-dcbf4f29c78c","resolution":{"observed_at":"2026-08-10T14:51:28.497430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.474376Z","title":"Fcss: Fully con- volutional self-similarity for dense semantic correspondence","venue":null,"work_id":"aa806c73-8325-44d9-8230-c226501ec1d6","year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.202715Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:8f73e86adb36e791ba954bc689beaf192073f18c7d3b673a049e90c541376ff4","observation_id":"6b9548f3-e20e-42f1-ad17-291ca7970fed","resolution":{"observed_at":"2026-08-10T14:51:28.479945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.455922Z","title":"Semantic attribute matching networks","venue":null,"work_id":"26431186-7752-48da-8ca3-032ddc067d11","year":2019},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.207803Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:d7af990efa0fdefa34e48ca5921bee92a1c70d18a5032f042fe5186c8deff0e9","observation_id":"1301a871-c37d-45ab-a9f5-8d59e19d69c0","resolution":{"observed_at":"2026-08-10T14:51:28.461361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.438282Z","title":"Poselib-minimal solvers for camera pose es- timation, 2020","venue":null,"work_id":"23d133e7-34f2-4c0f-adb9-5e9139e32b9d","year":2020},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.213041Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:31e6ff1e345807f6b65a41decd7457a298456f8c576136482a7f7b42715d25d0","observation_id":"f3e984b7-7acb-442b-9548-418b4b4cf1d7","resolution":{"observed_at":"2026-08-10T14:51:28.443397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.218230Z","title":"Sfnet: Learning object-aware semantic correspon- dence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.218230Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:a3131069ae4b71cc0f1b9e5e7929ad2669dda452fa1ed1e9cbaa3b8845ccd1a9","observation_id":"468db702-2916-44f5-aeae-406e8386f152","resolution":{"observed_at":"2026-08-10T14:51:27.218230Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.411756Z","title":"Ground- ing image matching in 3d with mast3r.European Conference on Computer Vision, 2024","venue":null,"work_id":"d8496744-ad06-4a38-b255-9724d2016f6b","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.223611Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:0d77597bd6967a79182b9f04c96b014b977a81516fd6ed249810021abedbfcfa","observation_id":"28782c66-6e58-4033-b915-2b2f66ad8a18","resolution":{"observed_at":"2026-08-10T14:51:28.417107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.395372Z","title":"Sd4match: Learning to prompt stable diffu- sion model for semantic matching","venue":null,"work_id":"d7fa4049-952a-44f3-9947-48693f266098","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.228771Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:f53664131db9ec8cf12bf27baf8773492ef3dc7f7949c7f16c9db9b79cef9443","observation_id":"315223ca-ac69-4e53-968a-f0588f0c152d","resolution":{"observed_at":"2026-08-10T14:51:28.400416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.379730Z","title":"Megadepth: Learning single- view depth prediction from internet photos","venue":null,"work_id":"52abad06-439b-4426-bccf-daa639d68bc8","year":2018},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.233571Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:7513acf2aac7aff9adba2f763c6fa8884a8774add87a9427847a66e5f3959374","observation_id":"a75f08a3-89b1-481f-ba9b-170d2d647d71","resolution":{"observed_at":"2026-08-10T14:51:28.384735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.363365Z","title":"Lightglue: Local feature matching at light speed","venue":null,"work_id":"417bab0b-9ec6-4e0c-9d20-739d74be3a10","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.238677Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:f73ec2a5dc6c1cb11711fbc153178248a827b5cf71936dfc0d2f59516d02d8a4","observation_id":"248d2a7c-2194-4094-82c6-ab934ee668b4","resolution":{"observed_at":"2026-08-10T14:51:28.368503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.345618Z","title":"Sift flow: Dense correspondence across scenes and its applications","venue":null,"work_id":"cdc95fb9-af52-4bc6-a04a-992ce1f25fc3","year":2010},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.243715Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:12523d9690a4018ea630aa0d95a1f7a0101c72abb522738bad22d1a52d2ddad7","observation_id":"000739c7-7f4e-4dce-aca3-745c11e4489b","resolution":{"observed_at":"2026-08-10T14:51:28.351585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-10T14:51:27.248531Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.248531Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:fc17780bec61030c055f2de4080bbc6d0d1c1ffdec2fd6bbfe0e8f1882647598","observation_id":"99e0a0bd-f0fa-45b3-b9f3-e279b7d05527","resolution":{"observed_at":"2026-08-10T14:51:27.248531Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.327508Z","title":"Distinctive image features from scale- invariant keypoints","venue":null,"work_id":"48cb5423-a045-4888-8081-7f3758851774","year":2004},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.253976Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:6e7d9385ed86e126540d299000155a8f3ed11fdbbdfd52a22ff8dcac9637dd15","observation_id":"95d6a2ae-e081-4789-bd1e-86a5bff89c6c","resolution":{"observed_at":"2026-08-10T14:51:28.332764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.310617Z","title":"Dynamic 3d gaussians: Tracking by per- sistent dynamic view synthesis","venue":null,"work_id":"311b6604-8555-49ad-a745-cf9efcd5c3ce","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.259040Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:c9aa7c4bbddb5fbd1759187df3dd59734a1e86c4188c1eae4b8fad26eb29754a","observation_id":"fbaa0326-c90c-49fe-9dc4-330cd98b0856","resolution":{"observed_at":"2026-08-10T14:51:28.316037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.294070Z","title":"Diffusion hyperfeatures: Searching through time and space for semantic correspondence","venue":null,"work_id":"4514f777-aaf5-43b3-8a07-ff2634b871f6","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.264197Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:8932e975d97d63a8f70713aa37030aa8b5a792db54538afb18012cab1c6348bc","observation_id":"56ed9765-5499-4291-ac2d-867359d59d36","resolution":{"observed_at":"2026-08-10T14:51:28.299248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.277644Z","title":"Contextdesc: Lo- cal descriptor augmentation with cross-modality context","venue":null,"work_id":"edf4feeb-c3a1-4256-9282-03d173406d94","year":2019},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.269099Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:1ec87d46bd9ad889ed69c55c7bb8a70a768b3a88efbde8ec6e7def770253f552","observation_id":"e9189328-0166-4b64-a0d8-9a7c4724889f","resolution":{"observed_at":"2026-08-10T14:51:28.283112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10543","last_updated":"2019-08-28T04:16:52Z","snapshot_observed_at":"2026-08-17T12:32:07.040526Z","submitted_at":"2019-08-28T04:16:52Z","title":"SPair-71k: A Large-scale Benchmark for Semantic Correspondence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10543","snapshot_observed_at":"2026-08-10T14:51:27.274225Z","title":"Spair-71k: A large-scale benchmark for semantic correspon- dence","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.274225Z"},"links":{"cited_paper":"/paper/1908.10543","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:078d9bf8c33a3dba114c4dceb3bcafb7ca802721adf86f0ca4e8a8f5839719a8","observation_id":"a4577834-f953-4781-ab6a-9e788719e063","resolution":{"observed_at":"2026-08-10T14:51:27.274225Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.260954Z","title":"Scalable nearest neigh- bor algorithms for high dimensional data","venue":null,"work_id":"f47fd097-85a4-4b8a-a84d-51f440a1c093","year":2014},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.280022Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:b34097ae3cfc042dd6e3f4f224712c65ba7db7dc9129a8515d0f7b92b5d2c46d","observation_id":"487af28a-7a43-4de2-8ff1-7d7b15949ba5","resolution":{"observed_at":"2026-08-10T14:51:28.266396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.284881Z","title":"Orb-slam: a versatile and accurate monocular slam system","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.284881Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:7d2f5e588193526a5fd433231e71cddf982f5092b8a426b71995eafc9a1f31c0","observation_id":"ef37d87e-cbf0-4a15-82fd-ab6d9b92acc6","resolution":{"observed_at":"2026-08-10T14:51:27.284881Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.233380Z","title":"Neural congealing: Aligning images to a joint se- mantic atlas","venue":null,"work_id":"26fab0f3-1000-42d8-a6d5-deeb586aec98","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.290305Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:185f204e8abdd7b4405bdbf69e308bfa45d4e80efe0395a38b059a6cc5537052","observation_id":"42872798-6206-4b24-b39c-420fa6427dfb","resolution":{"observed_at":"2026-08-10T14:51:28.238507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07193","last_updated":"2024-02-02T10:24:09Z","snapshot_observed_at":"2026-08-17T13:03:40.359628Z","submitted_at":"2023-04-14T15:12:19Z","title":"DINOv2: Learning Robust Visual Features without Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07193","snapshot_observed_at":"2026-08-10T14:51:27.295647Z","title":"Dinov2: Learning robust visual features without supervision","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.295647Z"},"links":{"cited_paper":"/paper/2304.07193","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:deb8d4aba22f4901ecdf832a8949d62c61a53c0a41d7b5238fcc99b13bfb18a5","observation_id":"74c46bf3-098f-4233-8050-bf3b9395f5e5","resolution":{"observed_at":"2026-08-10T14:51:27.295647Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.217189Z","title":"Pytorch: An im- perative style, high-performance deep learning library","venue":null,"work_id":"50efa1e1-ae13-4f73-bedb-350b69081403","year":2019},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.301142Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:f1356252568d9d36bd58af1efbb1e37691eaeccbb096d481cc5222a9711cd603","observation_id":"4263c96a-22c1-47e6-a617-6ed72b3951ef","resolution":{"observed_at":"2026-08-10T14:51:28.222080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.199922Z","title":"Xfeat: Accelerated fea- tures for lightweight image matching","venue":null,"work_id":"7f11bb1f-ef4d-4743-a75b-83735fc14213","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.306378Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:b169f14d50c2482c28aa28e7cd8dcb513cbaf4cfbc09ab41851fcfef056fe7e5","observation_id":"c9ee5cd6-44d2-4f5e-9b33-90e904e615d5","resolution":{"observed_at":"2026-08-10T14:51:28.205476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.182088Z","title":"Learning transferable visual models from natural language supervi- sion","venue":null,"work_id":"25e9dade-1f95-4bec-914a-628faff05f95","year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.311211Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:c2e2862b053357d3f699a62e141c0ec2f6c2b8e9f6aa7e67205fbdf90eaabd2a","observation_id":"967416fd-ec70-49d5-b44a-ea816c562360","resolution":{"observed_at":"2026-08-10T14:51:28.187020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.164864Z","title":"R2d2: Reliable and repeatable detec- tor and descriptor","venue":null,"work_id":"bd27d07d-89d6-4d16-9909-cccad93d07a3","year":2019},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.316295Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:b6f236beb63fbf3fc67a5e9b9e607462b49ef01cafb7dfe63d770a251d55cc46","observation_id":"a238e5e8-96e2-49f5-9a0e-716edfc831ef","resolution":{"observed_at":"2026-08-10T14:51:28.171096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.145779Z","title":"Convo- lutional neural network architecture for geometric matching","venue":null,"work_id":"3d08f471-afef-489a-af5f-34affc03e305","year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.321163Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:d92fcf93aed3036ffb3b2c3ec17a224cf3ddfc44f7ed2155c15de874a2f9643a","observation_id":"16d6dbb7-e76d-4cb3-812d-c774155b2315","resolution":{"observed_at":"2026-08-10T14:51:28.153600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.127610Z","title":"End- to-end weakly-supervised semantic alignment","venue":null,"work_id":"83a9279d-156e-4749-8efe-c0178d8ba3da","year":2018},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.326855Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:53c0f1b5a7cf7127ad06492cf41f9c2b0906cba795ad268c62c9300fa6c9a191","observation_id":"87a20e53-3c17-47ef-aa31-4c07bae9626c","resolution":{"observed_at":"2026-08-10T14:51:28.133465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:28.109259Z","title":"Neighbourhood con- sensus networks","venue":null,"work_id":"90dd87a2-5ade-4a89-b462-fc2dbd80e603","year":2018},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.334011Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:774430efe5b5c1f6e8267406becb4782d3a3daf9ad2e79bf2c3b91ff87586e1e","observation_id":"53307185-92e1-4343-b5ed-e836a4910b26","resolution":{"observed_at":"2026-08-10T14:51:28.114767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.341987Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.341987Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:68c31bedefb6c0ca0c902686d850f9648b77b85b47e8a4ecf348f91c05f1ac79","observation_id":"fd4d2ea5-a1a9-49c3-83e9-c1ee2c7f1510","resolution":{"observed_at":"2026-08-10T14:51:27.341987Z","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-10T14:51:27.347890Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.347890Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:5faf2d3b5adc43e8c151d38f340d1ad25f181e0fe6ff7d35a3f5fe10cf562b36","observation_id":"5168413d-5621-4710-a2c3-db124cc6257e","resolution":{"observed_at":"2026-08-10T14:51:27.347890Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.070433Z","title":"Particle video: Long-range mo- tion estimation using point trajectories.International journal of computer vision, 80:72–91, 2008","venue":null,"work_id":"6f4c4133-efc5-4ca3-be74-57f97474bc5b","year":2008},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.352892Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:08d7e3f52e5e64e3b531c3d55268fe66afeb8799b17b8afb48c2964ead2132ca","observation_id":"a2216c42-2a52-4701-affe-cce9e21ab5a8","resolution":{"observed_at":"2026-08-10T14:51:28.076259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.358203Z","title":"Superglue: Learning feature matching with graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.358203Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:05f146bf0172e10b3c3b4aef1cdf7f671bc91c787ea4d84b35b2c577ca873a61","observation_id":"21ee7acd-9ddc-40c8-aeab-96c9133879bc","resolution":{"observed_at":"2026-08-10T14:51:27.358203Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.042002Z","title":"Benchmarking 6dof outdoor visual localization in changing conditions","venue":null,"work_id":"1cea3387-f675-45f8-b390-b0b605f57733","year":2018},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.363089Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:92cd5acf3af4390502149d3ca391bf4882c529300b02216201abc7421a75e130","observation_id":"bb16d56b-510c-4f53-8a9a-bbb1f1fcbe8e","resolution":{"observed_at":"2026-08-10T14:51:28.047434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.368684Z","title":"Structure- from-motion revisited","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.368684Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:4a4b483391aa43a26fcf1e0a9c062173c2d0d131a959578e362f3d738aaf158d","observation_id":"7202913b-7e03-4876-a771-4949cb2a7468","resolution":{"observed_at":"2026-08-10T14:51:27.368684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02104","last_updated":"2025-03-12T09:00:45Z","snapshot_observed_at":"2026-08-16T13:21:40.320647Z","submitted_at":"2024-09-03T17:58:03Z","title":"DynOMo: Online Point Tracking by Dynamic Online Monocular Gaussian Reconstruction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02104","snapshot_observed_at":"2026-08-10T14:51:27.373922Z","title":"Dynomo: Online point tracking by dynamic online monocular gaussian recon- struction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.373922Z"},"links":{"cited_paper":"/paper/2409.02104","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:23b86268504f154d286f11c2958e671dae0d12e22acc55f6c15be8081578ec0b","observation_id":"c7033b23-5376-4e8e-a05e-a3ffb7edb8ce","resolution":{"observed_at":"2026-08-10T14:51:27.373922Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:28.012673Z","title":"Loftr: Detector-free local feature matching with transformers","venue":null,"work_id":"ee19269e-a1a6-4e1a-8019-8d926b2ec776","year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.379472Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:2a7388f1ed738c10edef0152b19b54f1acd8b025b080213dcd334f352a8a42d1","observation_id":"cafeb690-dcc9-49c9-8927-6c28198b741e","resolution":{"observed_at":"2026-08-10T14:51:28.018028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.994119Z","title":"Emergent correspondence from image diffusion","venue":null,"work_id":"cdf6687b-38ba-423a-a4f8-b46e9688580a","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.385051Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:d3b2fbaa7fd79f31d5ae50cf95ea2896a15dcd08b29ec4e130da270e46599034","observation_id":"1aeae4cc-8afa-4a94-b95e-253f6e41329a","resolution":{"observed_at":"2026-08-10T14:51:27.999613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.976228Z","title":"Sosnet: Second order similarity reg- ularization for local descriptor learning","venue":null,"work_id":"f4916446-4031-44eb-bb0b-f51c6a3a4d36","year":2019},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.390224Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:67182655774439b5ea1bd75ffa9ae8ee41830a3342cf1d9a0a232924f1ef94e8","observation_id":"65ae6bef-b77c-4811-a4df-857f17e2ef2e","resolution":{"observed_at":"2026-08-10T14:51:27.982012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.958187Z","title":"Glu- net: Global-local universal network for dense flow and corre- spondences","venue":null,"work_id":"b982784c-7ba3-4c8c-a24f-0a769d4a80ee","year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.396674Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:90f88626ca4c185d03ed2af7d6495697b21d572f8bb0d7cfeefb5c20323ec341","observation_id":"580526ec-2fa3-497f-9277-82d2c43c0004","resolution":{"observed_at":"2026-08-10T14:51:27.963539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.940717Z","title":"Disk: Learning local features with policy gradient","venue":null,"work_id":"acc9036a-9ea9-496a-8c7c-70944a2053b3","year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.403503Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:ddc0740be7faead7d5214aab93de6b3afdb1eadb51ad0009eb425c8ae2a04fb3","observation_id":"8f3501da-b767-4d31-9c14-c0d55634af5f","resolution":{"observed_at":"2026-08-10T14:51:27.946255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.421061Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.421061Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:06d5633a32c39450f0e18e5866ba7b738a5cdc66927385271669896a1c430ddb","observation_id":"92b3e178-b1d2-4df5-9b65-0f4ed5cd1596","resolution":{"observed_at":"2026-08-10T14:51:27.421061Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.895551Z","title":"Tracking everything everywhere all at once","venue":null,"work_id":"71b43f39-473d-47e9-9e11-df79aaad3b78","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.426599Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:37dfc7c62b2683a88dde0a47fd2a0d80d804bf224cfd55bc4419d0ffcb781157","observation_id":"feba4bda-05e7-405c-89a9-ad9903c757d2","resolution":{"observed_at":"2026-08-10T14:51:27.900570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.432289Z","title":"Shape of motion: 4d re- construction from a single video","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.432289Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:866e5a9dc02fe46b60b85a0c36d3c0218cd67ce4d6b44f78d3f7a1f8dc185730","observation_id":"64e952a6-b210-4c74-a460-5944c46ab9f9","resolution":{"observed_at":"2026-08-10T14:51:27.432289Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.877346Z","title":"Croco: Self-supervised pre-training for 3d vision tasks by cross-view completion","venue":null,"work_id":"73c3b309-ed34-4f32-ad16-4e879aff4b79","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.438269Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:aa77fe9363e31d0f6d4e4f41f8e8779479b51ebcfee0435e8119153ee50782a6","observation_id":"4f16c5f6-4dde-4f24-bd3b-0a21a22e9e67","resolution":{"observed_at":"2026-08-10T14:51:27.882425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.861012Z","title":"Spatialtracker: Tracking any 2d pixels in 3d space","venue":null,"work_id":"9cdaaf85-6e1a-4b6f-92e0-9dba8f7abab3","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.445588Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:640521e6f0e2170416098feaadb0c8881a69b0efa66833f5e97bee81966ad370","observation_id":"5387fe82-94e4-42ce-b570-a9e0665716e4","resolution":{"observed_at":"2026-08-10T14:51:27.866175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.844456Z","title":"Rnnpose: Recurrent 6-dof object pose refinement with robust correspondence field estimation and pose optimization","venue":null,"work_id":"fc3fa886-1ee9-48df-a3b8-ab5a1756a729","year":2022},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.451386Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:75d55d8d5ba4140140f07a9283dad4e6de1a2e08073e9687e430fe85a53fccf3","observation_id":"7f7f832f-ca9a-4424-907a-662275ccf4b3","resolution":{"observed_at":"2026-08-10T14:51:27.849723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.825688Z","title":"Sfd2: Semantic-guided feature detection and description","venue":null,"work_id":"f21556fd-9e2a-40d3-bb7a-1a32f00c2c68","year":2023},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.457028Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:7ed6f61ba7172934f856f778b1706b54d7c8cf2974fa784f0f3836202c270509","observation_id":"d0a7cab4-4143-433f-ada0-cca4a8a41611","resolution":{"observed_at":"2026-08-10T14:51:27.831660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.807272Z","title":"Lift: Learned invariant feature transform","venue":null,"work_id":"c42e9ef2-6cec-4be5-a0dd-f4af93e55d60","year":2016},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.462023Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:97f6683df7ce74948e2e194c743f34aa3f027369d6636af6688a4f6abd42846b","observation_id":"cf034c19-0587-44d9-b7ef-1422eadce15f","resolution":{"observed_at":"2026-08-10T14:51:27.813217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.12617","last_updated":"2021-11-01T05:36:12Z","snapshot_observed_at":"2026-08-16T18:00:23.525651Z","submitted_at":"2021-08-28T10:23:34Z","title":"AP-10K: A Benchmark for Animal Pose Estimation in the Wild","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.12617","snapshot_observed_at":"2026-08-10T14:51:27.466898Z","title":"Ap-10k: A benchmark for animal pose esti- mation in the wild","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.466898Z"},"links":{"cited_paper":"/paper/2108.12617","citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:cc6bd8a99bd9793c86c1ea480830f2725a18f077b7d67c9f76706e44a195d339","observation_id":"59bfa8c8-efdd-4306-808e-7defe6a65d38","resolution":{"observed_at":"2026-08-10T14:51:27.466898Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:51:27.789121Z","title":"Telling left from right: Identifying geometry-aware semantic corre- spondence","venue":null,"work_id":"b855cdb0-eb55-4f1d-90f2-17db771d9770","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.471986Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:4c2cb96dd000568fa2164332b10249b53eac3d89d4619393fd0594efe3cd1635","observation_id":"97784195-9c90-451c-8667-9f40a616552f","resolution":{"observed_at":"2026-08-10T14:51:27.794245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.771908Z","title":"A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence","venue":null,"work_id":"4463f073-d8c9-4fe8-abd7-1cedf27de2ee","year":2024},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.477215Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:d2d4d24370b2f870527f18ffae41e10052a05ac58aaf1eb8375a45467dd4b2ba","observation_id":"734d9e0c-9fc3-4d4a-8627-dc69da059471","resolution":{"observed_at":"2026-08-10T14:51:27.777248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.751731Z","title":"Patch2pix: Epipolar-guided pixel-level correspondences","venue":null,"work_id":"da0ef27b-07fa-4efc-8b55-350835c84eaf","year":2021},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.483707Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:1973f05574e5a1c3f249770ab1e3f9a56eae20ff3cc9baf46fe43c8f29c33ee4","observation_id":"80629801-d2bb-4a26-96ec-fbc84eb904dc","resolution":{"observed_at":"2026-08-10T14:51:27.757492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-10T14:51:27.924283Z","title":null,"venue":null,"work_id":"2eaaf85f-41e1-4647-ad6e-09121852cc62","year":null},"citing_paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T14:51:27.409821Z"},"links":{"citing_paper":"/paper/2501.14945"},"observation_digest":"sha256:0a7e6af939e30871e7a898bedfbd2b680377cd35e0b9eac2e967b8f39e8c8d76","observation_id":"9e97a991-fc5f-4def-a04f-4f8e93188632","resolution":{"observed_at":"2026-08-10T14:51:27.929319Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14945","last_updated":"2025-01-24T22:10:45Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-15T17:23:16.344452Z","submitted_at":"2025-01-24T22:10:45Z","title":"MATCHA:Towards Matching Anything"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":54},"total_outbound_references":76},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 76 of 76 outbound references and 1 inbound Pith citation observation for arXiv:2501.14945."}