{"as_of":"2026-08-12T13:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2499132d6946bd328f490ae02369fbf15daf3b2757340393889c8deb84611da","coverage":[{"denominator":138,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:38:28.291480Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-08-02T02:12:58.506159Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.18060","snapshot_observed_at":"2026-08-02T02:12:58.506159Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14423","last_updated":"2026-07-15T23:23:28Z","snapshot_observed_at":"2026-08-10T05:09:03.262628Z","submitted_at":"2026-07-15T23:23:28Z","title":"Emergent Region-Level Facial Correspondence in Frozen Vision Foundation Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T02:12:58.506159Z"},"links":{"cited_paper":"/paper/2505.18060","citing_paper":"/paper/2607.14423"},"observation_digest":"sha256:74591656d1a74d205b4c358e666511320cd948923c642fdd887b18919563a67e","observation_id":"3f45333d-ba22-48a8-abd7-24c2913faaa5","resolution":{"observed_at":"2026-08-02T02:12:58.506159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.18060/citation-record","integrity":"/paper/2505.18060/integrity","json":"/paper/2505.18060/citation-record.json","paper":"/paper/2505.18060"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:38:21.307348Z","title":"Sfnet: Learning object-aware semantic correspondence,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.307348Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:bb2f75c3d48691b44a90727fbbad5cb3f551783d121f4494ede8a08d8482dfdb","observation_id":"37ce696b-feb2-4b48-9d13-d943534d8012","resolution":{"observed_at":"2026-08-07T14:38:21.307348Z","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-07T14:38:21.349503Z","title":"Learning semantic correspondence exploiting an object-level prior,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.349503Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e4755790e67445bc98af4ae2db71dbdc4ec99ad281e0ead57c0853eeb674f049","observation_id":"5017c1f8-fb9f-4d9b-bf19-320d5401ae2d","resolution":{"observed_at":"2026-08-07T14:38:21.349503Z","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-07T14:38:21.432296Z","title":"Sift flow: Dense correspondence across scenes and its applications,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.432296Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3a0dd4925cafd61180919b971b20de4b3551221b45d52b17d4f17fb6efb15a40","observation_id":"07e6d4a3-e689-4d63-b26b-2f0b8ba799ae","resolution":{"observed_at":"2026-08-07T14:38:21.432296Z","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-07T14:38:21.495353Z","title":"Reference- based sketch image colorization using augmented-self reference and dense semantic correspondence,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.495353Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:927b31a29a355d52371472409538d6a1d347d4e35138288d361f1eb96c751546","observation_id":"ad72cd57-c990-4f95-bd92-e6ba8c78e080","resolution":{"observed_at":"2026-08-07T14:38:21.495353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10373","last_updated":"2023-11-20T10:54:09Z","snapshot_observed_at":"2026-08-06T08:12:35.134201Z","submitted_at":"2023-07-19T18:00:03Z","title":"TokenFlow: Consistent Diffusion Features for Consistent Video Editing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.10373","snapshot_observed_at":"2026-08-07T14:38:21.640366Z","title":"Tokenflow: Con- sistent diffusion features for consistent video editing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.640366Z"},"links":{"cited_paper":"/paper/2307.10373","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:062c72ecfca051d35ab6e166055d449b1349cd44db893856122276d4777a9555","observation_id":"f5063aa9-ee70-4d2e-b5de-6aaa1c7959a8","resolution":{"observed_at":"2026-08-07T14:38:21.640366Z","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-07T14:38:21.718986Z","title":"Regiondrag: Fast region-based image editing with diffusion models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.718986Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:c38870aa45a6f60042ad3d24bc37af70638615c4b24a650b6fbda11abef53a3a","observation_id":"174978af-b7c1-4e64-8a87-fac77170864b","resolution":{"observed_at":"2026-08-07T14:38:21.718986Z","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-07T14:38:21.801666Z","title":"Neural congealing: Aligning images to a joint semantic atlas,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.801666Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:96a01c9866aea66aa0031875ba0d1bb7d4dd2d2aeffb14ccc159bad062a37ca0","observation_id":"fbc1b5b4-14b1-4006-b6ae-430971a85730","resolution":{"observed_at":"2026-08-07T14:38:21.801666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02421","last_updated":"2023-11-20T09:08:42Z","snapshot_observed_at":"2026-08-12T12:59:44.498317Z","submitted_at":"2023-07-05T16:43:56Z","title":"DragonDiffusion: Enabling Drag-style Manipulation on Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02421","snapshot_observed_at":"2026-08-07T14:38:21.886023Z","title":"DragonDiffusion: Enabling drag-style manipulation on diffusion models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.886023Z"},"links":{"cited_paper":"/paper/2307.02421","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:dd0e7fdd180a07f6558687831e1dc66ccf4c5b283d7d455355cb744f8671be09","observation_id":"d36f69e5-3f05-4754-b58d-84e9976b8e7a","resolution":{"observed_at":"2026-08-07T14:38:21.886023Z","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-07T14:38:21.956050Z","title":"Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:21.956050Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:d3aa684ce1bdfefacbfd675a0892fd4f3e590b41acf3dd76d8be55417c4b2d0d","observation_id":"85b9c58d-6ddb-4971-8ca7-df5e67a93d19","resolution":{"observed_at":"2026-08-07T14:38:21.956050Z","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-07T14:38:22.038364Z","title":"Histograms of oriented gradients for human detection,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.038364Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:98daf0c364a202d034cff4b11374a91de14d7e3b43da584262110280eb4314fe","observation_id":"23ae05df-60ec-4fab-84ea-2e59b335713d","resolution":{"observed_at":"2026-08-07T14:38:22.038364Z","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-07T14:38:22.112882Z","title":"Scnet: Learning semantic correspondence,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.112882Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:290fa2606023b92b491f238a039bc6bc66f6c90e282796799cedf09a5ca20520","observation_id":"b9ac6c49-0e33-4f4c-9399-5c3aa11038a4","resolution":{"observed_at":"2026-08-07T14:38:22.112882Z","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-07T14:38:22.175825Z","title":"Fcss: Fully convolutional self-similarity for dense semantic correspondence,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.175825Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:08f88c900945aae7354835866bc091f1de03670948c14dcde79ee2fc7832194c","observation_id":"cfe9d473-11d6-453d-a0c3-f04781f9de70","resolution":{"observed_at":"2026-08-07T14:38:22.175825Z","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-07T14:38:22.295478Z","title":"Hyperpixel flow: Semantic correspondence with multi-layer neural features,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.295478Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:1bec2c9240c718d19a579e0b91c190f4a3382b872d3c85e02420e6eafaa75bc7","observation_id":"87545d71-65b2-4f20-90f1-ec2728dd48d5","resolution":{"observed_at":"2026-08-07T14:38:22.295478Z","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-07T14:38:22.345251Z","title":"Learning to compose hypercolumns for visual correspondence,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.345251Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:97cd749ed1ce5b4f5b1edb84104a895c9a118d943870843931703c3203cdf777","observation_id":"37c8f4bd-b737-499d-a61a-e74ed4ca8ae1","resolution":{"observed_at":"2026-08-07T14:38:22.345251Z","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-07T14:38:22.437973Z","title":"Dynamic context correspondence network for semantic alignment,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.437973Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:d1588325edca9b9979f0ae355f3e48d6bb37b174d12253fd086590c4922a137c","observation_id":"8cc417d6-b6a5-457c-bebd-84dccffe70d9","resolution":{"observed_at":"2026-08-07T14:38:22.437973Z","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-07T14:38:22.519116Z","title":"Efficient semantic matching with hypercolumn correlation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.519116Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:c29dabfccd564ae4aee3293ebb0ce6fb010d19501260dc51959d682d3e102b81","observation_id":"ea775990-c397-4ab1-885e-5213b3501d1d","resolution":{"observed_at":"2026-08-07T14:38:22.519116Z","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-07T14:38:22.638086Z","title":"Neighbourhood consensus networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.638086Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:d33edc848f2003d272384a8c61022c107fc96e32e7a3b2e6c3ec26b52e2c5157","observation_id":"08d320ef-960d-4826-be96-3d461a96e432","resolution":{"observed_at":"2026-08-07T14:38:22.638086Z","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-07T14:38:22.771627Z","title":"Correspondence networks with adaptive neighbourhood consensus,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.771627Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:b147637615f9c35c2e453f8a93221a9604241712a35e150139e43e47c77be9e6","observation_id":"dd81e4f8-cbbd-448a-89df-c73a19a8fce0","resolution":{"observed_at":"2026-08-07T14:38:22.771627Z","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-07T14:38:22.857191Z","title":"Convolutional hough matching networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.857191Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:78b4733d206576ae83a77e83ffec1d0e61dc26bde0057c8bb7729d8fc5528d7e","observation_id":"80941ccf-8dcb-4386-a637-e3cd23977680","resolution":{"observed_at":"2026-08-07T14:38:22.857191Z","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-07T14:38:22.958648Z","title":"Patchmatch-based neighborhood consensus for semantic correspondence,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:22.958648Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:64ee50892e7a7ea7944410263c34acd9684d6370411eca2dc5b4c5a16cec9ee8","observation_id":"0c04a5c2-3d4b-43f6-8659-2e3216f5e540","resolution":{"observed_at":"2026-08-07T14:38:22.958648Z","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-07T14:38:23.000707Z","title":"Cats: Cost aggregation transformers for visual correspondence,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.000707Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:7d5a519ec2a3ccd1cd893422b124124a53228adb4e815a1330d53c6bfba966d3","observation_id":"c6d5e231-c094-4c25-9e14-22cc6f3d77df","resolution":{"observed_at":"2026-08-07T14:38:23.000707Z","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-07T14:38:23.093869Z","title":"Cats++: Boosting cost aggregation with convolutions and transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.093869Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:a63fd0829f76d6b76ef0a5948700d06f5c33fd5372eca22d6714e352e3ae8cd7","observation_id":"53601ace-9e6d-45b0-8d18-0fe60251bb9c","resolution":{"observed_at":"2026-08-07T14:38:23.093869Z","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-07T14:38:23.155527Z","title":"Transformatcher: Match-to-match attention for semantic correspondence,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.155527Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:63e081fa880bb7c51e0601aded256ede1a5baa1ce8dd25a8956134c7c457be74","observation_id":"a875ab3f-f699-4c6a-8e6b-d38d443d1878","resolution":{"observed_at":"2026-08-07T14:38:23.155527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07193","last_updated":"2024-02-02T10:24:09Z","snapshot_observed_at":"2026-08-11T10:12:11.384939Z","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-07T14:38:23.199212Z","title":"DINOv2: Learning robust visual features without supervision,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.199212Z"},"links":{"cited_paper":"/paper/2304.07193","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:28d5ab935fc01def984d1f8372d16a0b83b8d14cf36dc1d91aa7f4db975eedce","observation_id":"a17e3e0b-6181-43c0-a0f9-5d6c44c26f3c","resolution":{"observed_at":"2026-08-07T14:38:23.199212Z","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-07T14:38:23.292680Z","title":"High- resolution image synthesis with latent diffusion models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.292680Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3dc225dacc8129d5e95f9915ae55158a2e3c31eb6d1d3f46fb0fc47b45e82948","observation_id":"5c950d78-1e5e-4344-b042-083f490ab3e0","resolution":{"observed_at":"2026-08-07T14:38:23.292680Z","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-07T14:38:23.382264Z","title":"Emergent correspondence from image diffusion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.382264Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:1eef2dc2d5570ddc0a4640574500d1265a4d3a034e93cf5be7c6e7a1c85cca1b","observation_id":"f8207ad1-6953-427e-a9cf-afb241aa78e5","resolution":{"observed_at":"2026-08-07T14:38:23.382264Z","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-07T14:38:23.476834Z","title":"A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.476834Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:5fcce5ad42ae2d74f7fccd7d14fc68b9b3ca42993ee00277185742288d97ebb9","observation_id":"00ad5c8f-ff9d-4f5f-b05d-0ce54cba214d","resolution":{"observed_at":"2026-08-07T14:38:23.476834Z","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-07T14:38:23.564772Z","title":"Sd4match: Learning to prompt stable diffusion model for semantic matching,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.564772Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:b9fe19c57330dfcbdb2a3c229388be1322f8b211061ca28d2a05eb33e2aecc4c","observation_id":"e93d69af-40e3-41fe-8ad8-bb62092b3234","resolution":{"observed_at":"2026-08-07T14:38:23.564772Z","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-07T14:38:23.667470Z","title":"Telling left from right: Identifying geometry-aware semantic correspondence,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.667470Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:dfe3014c50a901735c4d4228d5cf9826ddc507edfbcb53d9f6b0e9a0ce6f959f","observation_id":"4f552d14-f3bb-4417-9ec3-0019584193b4","resolution":{"observed_at":"2026-08-07T14:38:23.667470Z","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-07T14:38:23.715151Z","title":"Distillation of diffusion features for semantic correspondence,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.715151Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:cf04154d9b9b1bd4396197dee90fb726ba02f8f960e08410e8a8621f9493286d","observation_id":"4a657f0f-717b-4b22-a1cb-087272e4d3b7","resolution":{"observed_at":"2026-08-07T14:38:23.715151Z","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-07T14:38:23.792464Z","title":"Hartley and A","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.792464Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:02abf873c79bfc067a6f8d277c58b9362656a8476125b8390e2efb725b834202","observation_id":"7a8a1af2-ac57-4fd5-b867-b177326351b1","resolution":{"observed_at":"2026-08-07T14:38:23.792464Z","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-07T14:38:23.884908Z","title":"Image matching from handcrafted to deep features: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.884908Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:42aae499b46de659c73efb353f449decb5bfe1e3bb50bd91c59d352b74798f91","observation_id":"0a89182a-499d-4deb-96ae-05ec8807fb57","resolution":{"observed_at":"2026-08-07T14:38:23.884908Z","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-07T14:38:23.928523Z","title":"A computational theory of human stereo vi- sion,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.928523Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3041a9f46f80da4c10ba82f48cbb6f1bac4751218bf03c8af1efeeb1775200ec","observation_id":"3ba78f83-6d37-4c27-9749-542f4699d698","resolution":{"observed_at":"2026-08-07T14:38:23.928523Z","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-07T14:38:23.964499Z","title":"Determining optical flow,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:23.964499Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:8bbf5935855943de4ff36b357b07d04123d912017b3d07e5d099d9ad9282d8d3","observation_id":"e5278ccd-8bd2-4f45-b9c5-b6b4e815d681","resolution":{"observed_at":"2026-08-07T14:38:23.964499Z","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-07T14:38:24.060869Z","title":"Distinctive image features from scale-invariant key- points,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.060869Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:6309663eca20395fd47f49281881a52b625b75c2bfb020d665fee4810e1caf5a","observation_id":"c5ad0ad6-87c3-4fc8-bbbb-c114969b2229","resolution":{"observed_at":"2026-08-07T14:38:24.060869Z","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-07T14:38:24.123515Z","title":"A maximum entropy framework for part-based texture and object recognition,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.123515Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e3c28c3485955f088eff8939a05bcd11c6206c60fc2caaf777d735130a47b309","observation_id":"027fb650-1df1-4888-95a1-2618a43f5a44","resolution":{"observed_at":"2026-08-07T14:38:24.123515Z","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-07T14:38:24.186538Z","title":"Flexible object models for category-level 3d object recognition,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.186538Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:c4c2eb4026208c4add3c7518b055ea02a72815d626dd5374b0b7078c123197f5","observation_id":"f902a284-fe01-4fff-8ee1-87135587361d","resolution":{"observed_at":"2026-08-07T14:38:24.186538Z","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-07T14:38:24.276063Z","title":"Deformable spatial pyramid matching for fast dense correspondences,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.276063Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:5077dd8d2f5cfb2858090992410fca56c6e120be6a83cbcbae6a39580e87368e","observation_id":"7bf5a209-d80a-4d94-8068-c8235777c31c","resolution":{"observed_at":"2026-08-07T14:38:24.276063Z","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-07T14:38:24.323898Z","title":"Daisy filter flow: A generalized discrete approach to dense correspondences,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.323898Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:575483ec1c27cd5e8de13e895677d076df268306e198f15d52b4f30679015789","observation_id":"dde6937d-9c4c-4bc8-9b41-0aeba619ce1b","resolution":{"observed_at":"2026-08-07T14:38:24.323898Z","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-07T14:38:24.427145Z","title":"Daisy: An efficient dense descriptor applied to wide-baseline stereo,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.427145Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e92abb2afc0de29f1807a453f13823e35637c3e537998547e6c10d8856fbfca7","observation_id":"94a7bf26-f28a-42f5-9b88-c500b96b5206","resolution":{"observed_at":"2026-08-07T14:38:24.427145Z","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-07T14:38:24.621593Z","title":"Dense semantic correspon- dence where every pixel is a classifier,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.621593Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:1b97bd983948593b06767e8a5f751c36dc4181d69fdea1a9f83d1b5492355c94","observation_id":"5895b2ff-ae57-4cb0-b143-0208e774dcdf","resolution":{"observed_at":"2026-08-07T14:38:24.621593Z","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-07T14:38:24.702224Z","title":"Generalized deformable spatial pyramid: Geometry-preserving dense correspondence estimation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.702224Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:9597b7d9d62bec93e77cceaf8abac8babb215dd6efdd4ef4e64ba8f735ca1146","observation_id":"ff04d4f6-4e8e-49b6-b9d5-557432aa2dff","resolution":{"observed_at":"2026-08-07T14:38:24.702224Z","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-07T14:38:24.752318Z","title":"Proposal flow,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.752318Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:a43022c8a6e15ee8735ac9af31d90cc48ced86ce8063d14fe7c1581730f45e7e","observation_id":"92ef763d-40ad-452a-8be7-35f1bfb1bbc4","resolution":{"observed_at":"2026-08-07T14:38:24.752318Z","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-07T14:38:24.802017Z","title":"Proposal flow: Semantic correspondences from object propos- als,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.802017Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:bbd5dc0dcfc36ec4e57e16f40939a13afffc2412292b037fa71aa7c111c11e6b","observation_id":"4bf3d305-7b09-41b0-bb59-d143ebedc266","resolution":{"observed_at":"2026-08-07T14:38:24.802017Z","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-07T14:38:24.972932Z","title":"Object-aware dense semantic correspondence,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:24.972932Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:428336c244adea0bfdebfd572d27d3586a78729d4a9c6c320829baff5de45aa1","observation_id":"ffcf02a3-d515-46fe-beff-8c00d99060b9","resolution":{"observed_at":"2026-08-07T14:38:24.972932Z","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-07T14:38:25.026061Z","title":"A graph-matching kernel for object categorization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.026061Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:f42852374a90440f149e6c5f9da0e926ab8d2c61487037c85bba2a59a8e57c24","observation_id":"c69c1167-7660-4f0a-96e7-0e379bece1aa","resolution":{"observed_at":"2026-08-07T14:38:25.026061Z","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-07T14:38:25.065330Z","title":"Progressive graph matching: Making a move of graphs via probabilistic voting,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.065330Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:2b64a3c386e68ba7d6a1192b698eb80a88527ada592c8da581967ce85e67c79c","observation_id":"d324ee32-d8c0-43f2-b98f-8795ca30e75f","resolution":{"observed_at":"2026-08-07T14:38:25.065330Z","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-07T14:38:25.146867Z","title":"Universal corre- spondence network,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.146867Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:26d7f536e9d55fe3a85b2d267b3786d389fc89dd2d8f71649a909e071e93233e","observation_id":"f5e497c6-11b7-48cf-a19d-a2ec800f1d37","resolution":{"observed_at":"2026-08-07T14:38:25.146867Z","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-07T14:38:25.202934Z","title":"Do convnets learn correspon- dence?","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.202934Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:bf59ce4215ffc3b4c09f7eafc786d7650edf19a1248590e8fca18a5d8ecaf8b5","observation_id":"0e70f114-afe3-4497-8287-5f2fabdc98a1","resolution":{"observed_at":"2026-08-07T14:38:25.202934Z","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-07T14:38:25.245484Z","title":"Hypercolumns for object segmentation and fine-grained localization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.245484Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:dde3839d79ceae5be054784011991c070fdfaf820dcbfef848d4128d13295e61","observation_id":"5d05bdbc-6c3d-43f7-a67b-782843f38161","resolution":{"observed_at":"2026-08-07T14:38:25.245484Z","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-07T14:38:25.301739Z","title":"Multi-scale matching networks for semantic correspondence,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.301739Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:08c8edc0ab75f51734a8da1b7e83816006a5390e60c9083fdd6b8c32c054f702","observation_id":"dcfacf30-6f08-4617-9c96-d8ec1b7e21de","resolution":{"observed_at":"2026-08-07T14:38:25.301739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02678","last_updated":"2024-04-03T12:21:41Z","snapshot_observed_at":"2026-08-10T05:08:47.079611Z","submitted_at":"2024-04-03T12:21:41Z","title":"Independently Keypoint Learning for Small Object Semantic Correspondence","version":1},"cited_work":{"arxiv_id":"2404.02678","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.02678","snapshot_observed_at":"2026-08-07T14:38:33.678202Z","title":"Independently Keypoint Learning for Small Object Semantic Correspondence","venue":"cs.CV","work_id":"65d04afa-a914-4202-b9a2-f89e79bced10","year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.405174Z"},"links":{"cited_paper":"/paper/2404.02678","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:7eef83d21b0e8c0428251b1ff1251c91b4d90d4e00a0f7c8ea31f91cbe750160","observation_id":"8c413614-8be5-4c15-bb5d-747cd2d6ab7e","resolution":{"observed_at":"2026-08-07T14:38:33.749593Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:25.461189Z","title":"Pixel-level semantic correspondence through layout-aware represen- tation learning and multi-scale matching integration,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.461189Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:28f0348f900aaefc4a214d24171aa143673464ab8c44ce620489c5c738e0072c","observation_id":"3543fa47-387a-43dd-b916-714edcb4be34","resolution":{"observed_at":"2026-08-07T14:38:25.461189Z","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-07T14:38:25.504486Z","title":"Dif- fusion hyperfeatures: Searching through time and space for semantic correspondence,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.504486Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3a2ad15ac0d53393dfbc0385f8b5e50a7462ca6d600ab2df680b65c5418b78dd","observation_id":"3450a0f6-6867-40ab-83f7-c598fabf3a7e","resolution":{"observed_at":"2026-08-07T14:38:25.504486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02385","last_updated":"2023-05-03T18:52:38Z","snapshot_observed_at":"2026-08-10T05:07:14.749108Z","submitted_at":"2023-05-03T18:52:38Z","title":"SimSC: A Simple Framework for Semantic Correspondence with Temperature Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02385","snapshot_observed_at":"2026-08-07T14:38:25.583835Z","title":"Simsc: A simple framework for semantic correspondence with temperature learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.583835Z"},"links":{"cited_paper":"/paper/2305.02385","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:68e47bf0e8ea3d6a544940b41984a087f4f9dd964ddc9332545385c0b392e2ac","observation_id":"de76a8e7-9a6d-4c9e-a2fb-738921efe839","resolution":{"observed_at":"2026-08-07T14:38:25.583835Z","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-07T14:38:25.644274Z","title":"Unsupervised semantic correspondence using stable diffusion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.644274Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:569c35a2d43a6b6976e35ec07c20acc2209c06640585bcb476aa1f25fa9deb38","observation_id":"0dad85c0-e649-4ac9-882c-c5615ad378af","resolution":{"observed_at":"2026-08-07T14:38:25.644274Z","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-07T14:38:25.695680Z","title":"Lift: A surprisingly simple lightweight feature transform for dense vit descriptors,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.695680Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:df793ed6b061d794d749b665823a847ba6bca4e189d72028a78e2a9f4d43395b","observation_id":"53a8281a-c411-498a-86b0-09b5ad2b7c7b","resolution":{"observed_at":"2026-08-07T14:38:25.695680Z","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-07T14:38:25.783589Z","title":"Speech understanding systems: Report of a steering committee,","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.783589Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:2b8009adbe67b97025c9386320452150f3772c486f181a9b899badfb34f708eb","observation_id":"79b87236-92b6-4944-98b3-15b275def3f8","resolution":{"observed_at":"2026-08-07T14:38:25.783589Z","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-07T14:38:25.845178Z","title":"Feature pyramid networks for object detection,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.845178Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3f52b3f02bfb39c3f0f6206916bd3e00dc80e78d2987019912d64d12263c3791","observation_id":"7d8d557d-1c34-4b5d-a5ad-dc3ca68aa3e8","resolution":{"observed_at":"2026-08-07T14:38:25.845178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01618","last_updated":"2022-08-02T17:50:36Z","snapshot_observed_at":"2026-08-02T23:40:32.342515Z","submitted_at":"2022-08-02T17:50:36Z","title":"An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01618","snapshot_observed_at":"2026-08-07T14:38:25.951052Z","title":"An image is worth one word: Personal- izing text-to-image generation using textual inversion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:25.951052Z"},"links":{"cited_paper":"/paper/2208.01618","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:bd682edaf038bd6a126f78a4aa26c1f50085b7e97f67b4a0530771b97b62a95c","observation_id":"d807aa7f-2ae1-4b55-8545-b76e327e03e5","resolution":{"observed_at":"2026-08-07T14:38:25.951052Z","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-07T14:38:26.009312Z","title":"Zero-shot image feature consensus with deep functional maps,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.009312Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:f5b6680cbf959bc44c79156d2c21c627eaf3b0f7203a668fd4745a5eeaba08f7","observation_id":"1864ca23-1b8b-4ad9-b548-b4b325df5a28","resolution":{"observed_at":"2026-08-07T14:38:26.009312Z","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-07T14:38:26.089507Z","title":"GLU-Net: Global-local universal network for dense flow and correspondences,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.089507Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:2820ca98286fa60e8a5e5180cce1f6d41fc561b0c9c4edbab7b773a1a8c1cc98","observation_id":"325d0128-ebeb-4cc9-8bd0-38e74b5f2661","resolution":{"observed_at":"2026-08-07T14:38:26.089507Z","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-07T14:38:26.157801Z","title":"Deep vit features as dense visual descriptors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.157801Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:72f9b6c7cfed701e2fbadade0c0d6a92b3fb791511d473f56151e76532f4c339","observation_id":"db3ef169-06d5-46a1-9b4d-ef6eed109934","resolution":{"observed_at":"2026-08-07T14:38:26.157801Z","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-07T14:38:49.524446Z","title":"Deep semantic feature matching,","venue":null,"work_id":"9cea7373-06cf-4913-8a0f-10d4c2e15c67","year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.270958Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:7f2b59fbb40803412e60f4ead52d7a99138095413a4ce6dc1c2d33ed2d93b38c","observation_id":"aec2bfdb-4311-4121-9446-6fe1414bd67b","resolution":{"observed_at":"2026-08-07T14:38:49.661699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.08742","last_updated":"2022-09-20T04:51:13Z","snapshot_observed_at":"2026-08-10T17:44:23.625674Z","submitted_at":"2022-09-19T03:33:35Z","title":"Integrative Feature and Cost Aggregation with Transformers for Dense Correspondence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.08742","snapshot_observed_at":"2026-08-07T14:38:26.334671Z","title":"Integrative feature and cost aggregation with transformers for dense correspondence,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.334671Z"},"links":{"cited_paper":"/paper/2209.08742","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e6b8c6cac180a81a5243e10601de60df090ec9d6e64e0eb4cb7e5aa02e167aff","observation_id":"2a4b1a0b-360e-416c-9617-13856c65f950","resolution":{"observed_at":"2026-08-07T14:38:26.334671Z","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-07T14:38:49.326957Z","title":"Warp consistency for unsupervised learning of dense correspondences,","venue":null,"work_id":"1568ce52-69b7-41c2-8385-bd4868eb9012","year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.433365Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:3a7dc8a7bfb24f7d7398a929264dfa95da508f99eb8d36c8c683e622cfd64b87","observation_id":"88cf5f4c-f3d6-4840-a6b5-f4dca220dec8","resolution":{"observed_at":"2026-08-07T14:38:49.453817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:48.783261Z","title":"Dualrc: A dual-resolution learning framework with neighbourhood consensus for visual corre- spondences,","venue":null,"work_id":"6694cf5d-b96b-46c0-82c9-d820bb5f96f1","year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.506416Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:4a1bc36b393beb867b231a9f269688f9ef743387536ffb63bb1b9483427f19fe","observation_id":"d3438b22-a3b8-40e3-bc85-81140ba07d90","resolution":{"observed_at":"2026-08-07T14:38:49.078336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:48.351759Z","title":"Dual-resolution correspondence networks,","venue":null,"work_id":"c541c5b7-1398-478b-afb7-b2bd5b2d4819","year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.553142Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:1035ceb43f9e34ff3af5c283ff4aa46001b330f9667f6683a715219c6387a6cb","observation_id":"b37d54c2-6cd7-478b-8f02-04581c558815","resolution":{"observed_at":"2026-08-07T14:38:48.564438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:47.943007Z","title":"Correspondence transformers with asymmetric feature learning and matching flow super-resolution,","venue":null,"work_id":"fe6b2746-9cba-41aa-b0bb-379dfdabe815","year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.598312Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:cfe8b6448ad83475fed36357ffb9fff02155066349ef006ab8d53c5f3b5fa98a","observation_id":"8d78f804-071d-4506-acf4-cc457df74b2a","resolution":{"observed_at":"2026-08-07T14:38:48.159976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:47.631390Z","title":"Guided semantic flow,","venue":null,"work_id":"40da03bf-f801-4566-ac9b-a2ead6f37502","year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.639182Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:f32ac152faed7e7fcd00446df2f1b34025d720066bc1c1c74d749ca47b4f4069","observation_id":"b602c600-9f44-4469-93c9-91f34dab55b0","resolution":{"observed_at":"2026-08-07T14:38:47.739348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:47.312204Z","title":"Semi- supervised learning of semantic correspondence with pseudo-labels,","venue":null,"work_id":"da1a971f-7f7e-45c8-948a-7bb91a31cded","year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.689763Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:9362cf0d48c3b1e820148c3bf0dc18f9fd6b505102ea2799b9305ce0dfe57b43","observation_id":"62318292-2a6e-4ef3-8436-05ed72ad52d7","resolution":{"observed_at":"2026-08-07T14:38:47.505349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:47.081616Z","title":"Learning semantic correspondence with sparse annotations,","venue":null,"work_id":"5cca1e71-6133-42a0-898f-fb5911495107","year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.741274Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e1bad91eaa7cee9cd4c684c2207d99e6ede8a849e67dd28944c1d3d3f8b96510","observation_id":"925dd653-dd3e-43f8-b923-1bd8028ee4b1","resolution":{"observed_at":"2026-08-07T14:38:47.197590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:46.754021Z","title":"Semantic 19 attribute matching networks,","venue":null,"work_id":"1748cbf2-b908-4432-953d-8b63672bfe43","year":2019},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.798885Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:8d2821e1c23c03b14c16c62a995447050f8e0ec9b6a42e48f7c1df6fbfdc30c7","observation_id":"c044d070-68a0-45ae-91e1-856cc7488e4f","resolution":{"observed_at":"2026-08-07T14:38:46.917896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:46.474241Z","title":"3×2: 3d object part segmentation by 2d semantic correspondences,","venue":null,"work_id":"ed42cd96-cfe1-480f-8f97-fd0a63209b15","year":2024},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.863184Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:846c39ca024fe4fb8bf2666735e22417220eb07d7ce67f948b0ffa704608394e","observation_id":"8ae14fc8-2fd9-4abf-8cdd-9d70defabf10","resolution":{"observed_at":"2026-08-07T14:38:46.601482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:46.256199Z","title":"Convolutional hough matching networks for robust and efficient visual correspondence,","venue":null,"work_id":"94cf2dad-0788-41c0-b3f3-52e69dcf79ec","year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.901936Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:59ef0c19b2dd3624f98c38f15e828cd6cd415595400f343ad8d674f68bea6601","observation_id":"8c3aa77a-37ba-49c6-bf27-b2289b19d79c","resolution":{"observed_at":"2026-08-07T14:38:46.376421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:45.957365Z","title":"End-to-end weakly-supervised semantic alignment,","venue":null,"work_id":"46966494-b55c-43c0-9d93-689a7c35814c","year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.942508Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:b41eb0b420f0ba19a1d19e8f5145076b0d5a8cfa923444c44cbb8a3b19adf2d8","observation_id":"94ed1d8d-256b-476e-abd2-3e0701a3da4b","resolution":{"observed_at":"2026-08-07T14:38:46.089021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:45.686755Z","title":"Dctm: Discrete-continuous transformation matching for semantic flow,","venue":null,"work_id":"85283cf6-53a3-4d0e-83db-00c964cc1dda","year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:26.981356Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:ccdfb6c30dfa3988be7e8ae1c2998ee6315031eb216aae9963f55a2f88ee530e","observation_id":"61dcfc81-f745-4bff-a0c4-ed995114aba9","resolution":{"observed_at":"2026-08-07T14:38:45.800575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:45.400525Z","title":"Gms: Grid-based motion statistics for fast, ultra-robust feature correspondence,","venue":null,"work_id":"db23db1b-4dca-43b5-b3e8-9cac4af05f47","year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.023314Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:b8ad3cad6fdad386018c8bbca7d6e7b760ef5d8df7408241d5c27ba5765b7126","observation_id":"30fa7603-1e0e-4833-8e0f-27e98f2148b1","resolution":{"observed_at":"2026-08-07T14:38:45.561715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:45.094739Z","title":"Improving ransac’s efficiency with a spatial consistency filter [c],","venue":null,"work_id":"80589256-c0cf-4149-bc8a-df638105db20","year":2009},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.072641Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:8a8d73b6dbf797edac2087c370332021eccb4664c37ad9deb0f4fd54c1e0bd15","observation_id":"a3b2b5f0-70ab-4fd4-a66b-4a059173afe1","resolution":{"observed_at":"2026-08-07T14:38:45.229806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:44.823534Z","title":"Automated scene matching in movies,","venue":null,"work_id":"ef5e5f2e-e741-499f-bddb-080ad2d3f7a7","year":2002},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.117945Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:6120d79960f484354f605e54587eb21f59310ac19daf5d623f2557eaa77ebf7b","observation_id":"c9aeded2-6ff5-4d36-9576-684e88a62a33","resolution":{"observed_at":"2026-08-07T14:38:44.961236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:44.554427Z","title":"Video google: A text retrieval approach to object matching in videos,","venue":null,"work_id":"59bc4390-02ff-4180-b589-95792e1422a2","year":2003},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.173939Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:35cee395d9e9f57809d13c18064493824d9c9cedba4b3acbdafd6c1645ae0a48","observation_id":"8eaa1e62-1456-473c-928f-f82646374314","resolution":{"observed_at":"2026-08-07T14:38:44.698772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:44.348797Z","title":"Patchmatch stereo-stereo matching with slanted support windows,","venue":null,"work_id":"660852fd-b857-405f-9307-24a97da87a5a","year":2011},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.238097Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:362ac41313c87a9e44925b7b299d460ae6cb2bd13a2f6e275b9c754b59bdff74","observation_id":"509003ef-4d82-4046-8b6b-513771ee6e15","resolution":{"observed_at":"2026-08-07T14:38:44.434149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-07T14:38:27.328379Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.328379Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:2cff22f24a7cce3654255435f257442a90ba94ec474f07e8246e32e6c26ad4e9","observation_id":"9d2907d9-1208-4191-817c-9e79d0cef8c7","resolution":{"observed_at":"2026-08-07T14:38:27.328379Z","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-07T14:38:27.391530Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.391530Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:629caef9cdd8f7072155ce6dede2fb6ecc5860f5cff99b630de064100f9771ad","observation_id":"3e4f8b69-2dff-4b02-990c-870c14f9c476","resolution":{"observed_at":"2026-08-07T14:38:27.391530Z","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-07T14:38:27.455144Z","title":"End-to-end object detection with transformers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.455144Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:47ca591093b711135a86f6d6a508ea6e5de4e3c5d57587a7077e4a31afce0860","observation_id":"54ebd2ef-55bf-42ab-ae1b-ed60f7a02149","resolution":{"observed_at":"2026-08-07T14:38:27.455144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04159","last_updated":"2021-03-18T03:14:26Z","snapshot_observed_at":"2026-07-06T10:02:45.105181Z","submitted_at":"2020-10-08T17:59:21Z","title":"Deformable DETR: Deformable Transformers for End-to-End Object Detection","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04159","snapshot_observed_at":"2026-08-07T14:38:27.538654Z","title":"Deformable detr: Deformable transformers for end-to-end object detection,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.538654Z"},"links":{"cited_paper":"/paper/2010.04159","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:770a4921e819a650e80801869ac5f5fc3766910b2de900cb403060c9ab20f1b9","observation_id":"bfc5b20b-9e42-4999-96c9-8fbb25589d43","resolution":{"observed_at":"2026-08-07T14:38:27.538654Z","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-07T14:38:44.012829Z","title":"Loftr: Detector-free local feature matching with transformers,","venue":null,"work_id":"8d12cdf4-33cc-401e-a315-44f46fad7324","year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.589475Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:6033935eb1c68b7bfa243f5ae0228a6f2343603bcd00ff2fa0ba7d11fb895bd5","observation_id":"f85e8d8a-30ce-431c-8e96-950f4b422168","resolution":{"observed_at":"2026-08-07T14:38:44.198095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:43.839885Z","title":"Cost aggregation with 4D convolutional swin transformer for few-shot segmentation,","venue":null,"work_id":"c273b689-ffe2-46e8-a0c5-112756d1e497","year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.646975Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:9d15edf99eb640c45078d0a0103c0db5f824ab2feff8abbb57ea1a9f749ec7eb","observation_id":"7e24adf3-9872-448e-8502-815363fff1b1","resolution":{"observed_at":"2026-08-07T14:38:43.904591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:27.706030Z","title":"Swin transformer: Hierarchical vision transformer using shifted windows,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.706030Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:24a3e328627af19c9daf898e1dd93e630d245a1bb59a604cf59cca85a615946b","observation_id":"7fc28435-6497-4aa6-8257-49b80d53f4d4","resolution":{"observed_at":"2026-08-07T14:38:27.706030Z","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-07T14:38:43.539973Z","title":"Neural matching fields: Implicit representation of matching fields for visual correspondence,","venue":null,"work_id":"9b787c2c-1499-46d1-8d0f-59ddb9cd37c7","year":2022},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.753141Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:1e95c767d4f2c2325b2c9564e58b9a63d6290f8e4537de9c747f7e5ebe76962f","observation_id":"217dbf63-a26b-4d4c-ae51-dd53fca50828","resolution":{"observed_at":"2026-08-07T14:38:43.679425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:43.275163Z","title":"Convolutional neural network architecture for geometric matching,","venue":null,"work_id":"d8e15806-5d83-4fae-97c1-b6c4e4794b76","year":2017},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.814561Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e2738926759678cdca9550bef9fd78552dbd98633bcbcb7b7cc41d3d501c5f0a","observation_id":"df8d1264-ce99-4b4c-ae1e-bea9a6791ef7","resolution":{"observed_at":"2026-08-07T14:38:43.369207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:42.940918Z","title":"Attentive semantic alignment with offset-aware correlation kernels,","venue":null,"work_id":"142327f6-6a79-4f1c-bef0-75173ffee30e","year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.905135Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:04f09b2bf35544f72637b64811237fd9fd900439d134c207c77b4f608c818b16","observation_id":"ba7acb1a-646d-4f2c-97f0-5d3089915a9d","resolution":{"observed_at":"2026-08-07T14:38:43.108183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:42.624984Z","title":"Recurrent transformer networks for semantic correspondence,","venue":null,"work_id":"de1aa339-f582-4ed3-87fb-ca7216d83b78","year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.923080Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:825b35a9c36ed20ea724cf786ab3f2a4a4534b1676a59123daa0b3610e437aac","observation_id":"87c9e5fc-85c5-4a2c-a719-f7595aae2e52","resolution":{"observed_at":"2026-08-07T14:38:42.765232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:42.382815Z","title":"Parn: Pyramidal affine regression networks for dense semantic correspondence,","venue":null,"work_id":"2d4a5165-0ea8-481d-be6c-568e86e332aa","year":2018},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.926411Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:bd0c88986e3c5510c4838ce0e50d897aac81679fb9a12b19c890238e3f35a958","observation_id":"69ecf404-775f-412b-932c-2a43c40143b8","resolution":{"observed_at":"2026-08-07T14:38:42.518800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:42.117719Z","title":"Efficient neighbourhood consensus networks via submanifold sparse convolutions,","venue":null,"work_id":"75637a66-e7cb-4505-b8b8-71e8c3479c71","year":2020},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:27.954842Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:f68a0a9fb9c6201de2e7ee1f735b29d78abbc360de6e434931b3988b7f2af375","observation_id":"3df23511-ffed-4efe-aada-f634ead4c2ec","resolution":{"observed_at":"2026-08-07T14:38:42.234244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:41.854248Z","title":"Dkm: Dense kernelized feature matching for geometry estimation,","venue":null,"work_id":"c5b461e3-893d-4603-a34c-6154de74748f","year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:28.000920Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:e75b0db862e574ef7f1de76f6e34fba5343a6ca13777d995d7493e3654caca16","observation_id":"d3d0a490-3846-48de-88ee-f5cb47e43b93","resolution":{"observed_at":"2026-08-07T14:38:42.006197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:41.641857Z","title":"Weakly supervised learning of semantic correspondence through cas- caded online correspondence refinement,","venue":null,"work_id":"abb64823-d4fb-40be-a9f4-0610e9f84731","year":2023},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:28.049667Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:c605ab51f5924c4add173a32e6ddfe6979611b45e3532ecd10e75822bbbc725d","observation_id":"eec7a8e9-9f53-4e13-b067-36d4057f3dde","resolution":{"observed_at":"2026-08-07T14:38:41.754879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T14:38:28.147191Z","title":"Imagenet: A large-scale hierarchical image database,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:28.147191Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:46b772388b5b3a7ba21b7fbda5bc3ceb9f0f52336bf5d663e460c37ceb8d421d","observation_id":"081420eb-0bfb-42df-a2cf-68b86fda0a34","resolution":{"observed_at":"2026-08-07T14:38:28.147191Z","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-07T14:38:41.304018Z","title":"FlowWeb: Joint image set alignment by weaving consistent, pixel-wise correspondences,","venue":null,"work_id":"b951378a-9794-470c-aeb5-ec14e1522d0c","year":2015},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:28.214583Z"},"links":{"citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:5113ae291172a08ea60f8b56fb2ea1504410bfd64f81f47aa147a02d59bad550","observation_id":"57bede0f-0ce3-4fad-903a-1dc779d41dbb","resolution":{"observed_at":"2026-08-07T14:38:41.437482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.08341","last_updated":"2019-01-24T10:48:39Z","snapshot_observed_at":"2026-08-12T11:31:34.457082Z","submitted_at":"2019-01-24T10:48:39Z","title":"Semantic Matching by Weakly Supervised 2D Point Set Registration","version":1},"cited_work":{"arxiv_id":"1901.08341","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.08341","snapshot_observed_at":"2026-08-07T14:38:33.365473Z","title":"Semantic Matching by Weakly Supervised 2D Point Set Registration","venue":"cs.CV","work_id":"db2378c4-b91f-4532-bd4c-f93c11825f07","year":2019},"citing_paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","version":4},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:28.291480Z"},"links":{"cited_paper":"/paper/1901.08341","citing_paper":"/paper/2505.18060"},"observation_digest":"sha256:55421a67eba5e1a52ce4404e7310848e7c0fef6bacd09851d600e75b3bff4be8","observation_id":"90c6c652-9245-4d8e-9014-0d93f91cc145","resolution":{"observed_at":"2026-08-07T14:38:33.431925Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18060","last_updated":"2026-06-28T05:51:41Z","latest_version":4,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-10T05:08:50.069263Z","submitted_at":"2025-05-23T16:07:16Z","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":69,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":138},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 138 outbound references and 1 inbound Pith citation observation for arXiv:2505.18060."}