{"as_of":"2026-08-08T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c719e0c9732643e6e76e4398a1f76cf66448d119a63ab0dd8d8e4a3c4b0463d","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:46:12.738566Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.17844/citation-record","integrity":"/paper/2505.17844/integrity","json":"/paper/2505.17844/citation-record.json","paper":"/paper/2505.17844"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.05884","last_updated":"2023-04-12T14:25:52Z","snapshot_observed_at":"2026-07-06T15:14:51.848836Z","submitted_at":"2023-04-12T14:25:52Z","title":"Unicom: Universal and Compact Representation Learning for Image Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.05884","snapshot_observed_at":"2026-08-07T14:46:07.679904Z","title":"Unicom: Universal and compact representation learning for image retrieval","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:07.679904Z"},"links":{"cited_paper":"/paper/2304.05884","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:b3cdca9082297935607e522679a1815e4e3812b4aaf1a52b2236db0570250ee8","observation_id":"2c30f509-527f-4c5f-9dca-3bbf61a40bad","resolution":{"observed_at":"2026-08-07T14:46:07.679904Z","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:46:19.789341Z","title":"Practical and optimal lsh for angular distance","venue":null,"work_id":"cd11f378-79a7-44ad-9847-276eb3fedd24","year":2015},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:07.756003Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:fb2b0d1b29c8b916882d37af8f325481911960b0c470940f833e5ae41ce2cd77","observation_id":"2e8c04e4-39a7-43ec-b56f-7b5dad74919e","resolution":{"observed_at":"2026-08-07T14:46:19.909842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-07T14:46:07.863458Z","title":"Ms marco: A human generated machine reading comprehension dataset","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:07.863458Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:3c9756532526b97bfc5f09f3532e21577935027469422881cca5d4e37dacfb48","observation_id":"8b76c099-f324-49d5-aa75-dcfb97d80072","resolution":{"observed_at":"2026-08-07T14:46:07.863458Z","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:46:07.955936Z","title":"Deep metric learning to rank","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:07.955936Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:c7ade433489496d8d1236fb44a823ac366cac22aae0e2f6a5f50d2bc67ee823b","observation_id":"2d6b6caa-3efe-420c-8e79-129edb3c03dc","resolution":{"observed_at":"2026-08-07T14:46:07.955936Z","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:46:08.017143Z","title":"Charikar","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.017143Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:f015eb2a305f23a297c3a130b475c023ad56cf038de5dba6edb960e9e8665c0e","observation_id":"1f4c8126-91d3-4035-a08f-1a3c6f1240f3","resolution":{"observed_at":"2026-08-07T14:46:08.017143Z","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:46:08.094995Z","title":"Chopra, R","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.094995Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:eca6f9137b00410c894e08a72fe1f8f41746994fbc0c05db1b63012d38df1c7b","observation_id":"a9debbe3-8583-4972-afe6-6f3db85dea9d","resolution":{"observed_at":"2026-08-07T14:46:08.094995Z","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:46:19.572984Z","title":"Debiased contrastive learning","venue":null,"work_id":"d5bc3e28-b3b4-4d9f-a3e0-0761383e55f8","year":2020},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.157206Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:cd5ca401d675a26b97925f0322d92702ccfc0812c9444524e9ea3e7d88202f87","observation_id":"47a99d28-ba5e-4474-bb44-073ef3d4dad2","resolution":{"observed_at":"2026-08-07T14:46:19.672202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:08.254000Z","title":"Mirrokni","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.254000Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:27411762ae841e6f8da152413a6891a5df92a0e5850010246311dc0230d9cd2e","observation_id":"f3cde8b2-4850-4159-8262-fdcffa91e34d","resolution":{"observed_at":"2026-08-07T14:46:08.254000Z","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:46:19.287494Z","title":"Sample4geo: Hard negative sampling for cross-view geo-localisation","venue":null,"work_id":"503063b6-1b2e-4484-a35f-f143410196f5","year":2023},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.360145Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:e80e9e2c9931d9d49e4881142ae08b03a5105112a5eb4a6f94e125180ae89daf","observation_id":"45b07934-e332-472b-9466-a4fe299b82bf","resolution":{"observed_at":"2026-08-07T14:46:19.427223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:18.947942Z","title":"Orientation-guided con- trastive learning for uav-view geo-localisation","venue":null,"work_id":"69343aff-ef2b-4787-94f6-e9077cddf2fd","year":2023},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.422033Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:ca468033f482cb3ae80a3caae24b87e6b3854f9e8881eeec2cb8effecb5f6f06","observation_id":"1983c1a5-8fff-4320-92c9-bc03d30341b1","resolution":{"observed_at":"2026-08-07T14:46:19.069118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:18.461090Z","title":"Optimizing geo-localization with k-means re-ranking in challenging weather conditions","venue":null,"work_id":"72c04795-b7e0-462c-98b9-ec6da493b589","year":2024},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.514821Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:535c20913e68dcafef8d91a0ea18549d1558f1d4221ce87227c124ea2df304ec","observation_id":"32175633-0c13-4a20-853b-aea292a9c4b6","resolution":{"observed_at":"2026-08-07T14:46:18.555546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:18.170445Z","title":"Deep feature learning with relative distance comparison for person re-identification","venue":null,"work_id":"a5a709b0-cd6a-4300-ad8f-9f5a7d7272c3","year":2015},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.591936Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:f1b0a5d1fd8d70a603ca30acf11261ef51b4fc6d4abe9589a9d0b80ed8b60145","observation_id":"cf6805fb-2ac0-4123-8bc5-e09141d07f67","resolution":{"observed_at":"2026-08-07T14:46:18.261732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-07T14:46:08.674726Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.674726Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:75c9bd7db4fee4e99bba52f0f181f2d34b7b55b1e1cf32720fb335a879b17641","observation_id":"b06e91fc-9e5f-4f22-962f-3fd13697187c","resolution":{"observed_at":"2026-08-07T14:46:08.674726Z","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:46:08.770822Z","title":"The faiss library","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.770822Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:c4ef487661c7dacc78f74a38d369f8b1c7fa458e79eb52c9aaae53067bdf0f09","observation_id":"c81f0def-7c0c-4df4-a53b-962851df0a0e","resolution":{"observed_at":"2026-08-07T14:46:08.770822Z","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:46:08.833841Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.833841Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:72681229469248df59924df87a4109f7570f163f9339863978e214f877410d02","observation_id":"b11dbc3d-1b33-4fbf-9fe8-00e95ad610f3","resolution":{"observed_at":"2026-08-07T14:46:08.833841Z","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:46:17.969456Z","title":"Hard-negatives or non-negatives? a hard- negative selection strategy for cross-modal retrieval using the improved marginal ranking loss","venue":null,"work_id":"56649d55-6855-40a1-bb1a-2ad1ab9ad554","year":2021},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.887801Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:1f82aa64ce82eeac06ea90cb98dd3c765c1cf60d6a9a0430775f94b7dc48fe70","observation_id":"c361608d-f4e4-40a8-b053-72fbb46a3a4e","resolution":{"observed_at":"2026-08-07T14:46:18.054249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.10506","last_updated":"2019-09-23T17:52:34Z","snapshot_observed_at":"2026-07-06T08:23:56.729786Z","submitted_at":"2019-09-23T17:52:34Z","title":"Learning Dense Representations for Entity Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.10506","snapshot_observed_at":"2026-08-07T14:46:08.975727Z","title":"Learning dense representations for entity retrieval","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:08.975727Z"},"links":{"cited_paper":"/paper/1909.10506","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:b7ec63f3b3c21c451b5a26aa0020f201018b78236e8243ce3c197e437075ade0","observation_id":"56a68170-757c-47e3-a78b-d74320e1f6d3","resolution":{"observed_at":"2026-08-07T14:46:08.975727Z","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":"10.1109/tpami.2012.193","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:46:13.055982Z","title":"Iterative quantiza- tion: A procrustean approach to learning binary codes for large-scale image retrieval","venue":null,"work_id":"633d08f1-ebf4-45c7-a048-570c6506c800","year":2013},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.027298Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:0f0baac661d86a48a714f0f15187d623fdefd6acc97e5c19a1d84e3f0a02cc1a","observation_id":"189fd92a-cbc3-4291-9bb3-3419cbf8e396","resolution":{"observed_at":"2026-08-07T14:46:13.212691Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2437.35556","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:46:13.919898Z","title":"Clip-reident: Contrastive training for player re-identification","venue":null,"work_id":"7c3549d1-0424-4226-a286-9c8f725cc8e0","year":2022},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.111691Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:078c0353a5c6692dfb3433cbbd488631ca6c1f2f5fd1921c9521c2eeaf6213ea","observation_id":"1518e7cd-3a1d-497a-8919-3b75f4a72775","resolution":{"observed_at":"2026-08-07T14:46:14.010553Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:17.836026Z","title":"Approximate nearest neighbor: Towards removing the curse of dimensionality","venue":null,"work_id":"1c749f3a-83d8-4005-976b-07fb5bd74bc8","year":2012},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.170709Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:76a996fa1748e7ed98e205990a50eea2a537bee0b072cc31404c6e9308b0fc91","observation_id":"e46c6d9f-2e59-41d1-bb78-397c742ee835","resolution":{"observed_at":"2026-08-07T14:46:17.883578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:17.662541Z","title":"Approximate nearest neighbor: Towards removing the curse of dimensionality","venue":null,"work_id":"b25bd4a3-ef0c-4b64-8d6d-037b07945d25","year":2012},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.225363Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:76fd55cad4dabbe25e6dc7d5e059eb93b0ad12bd448f382bc56ef3e1d4c8ca81","observation_id":"56541e11-53e9-495d-b765-cd4a28bb2367","resolution":{"observed_at":"2026-08-07T14:46:17.747223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07737","last_updated":"2017-11-21T15:35:07Z","snapshot_observed_at":"2026-08-04T09:19:45.912586Z","submitted_at":"2017-03-22T16:34:29Z","title":"In Defense of the Triplet Loss for Person Re-Identification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07737","snapshot_observed_at":"2026-08-07T14:46:09.288916Z","title":"In defense of the triplet loss for person re-identification","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.288916Z"},"links":{"cited_paper":"/paper/1703.07737","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:858da3b8e9f1fd73626b5488005cea152b3d60241f71441cd82fe9727aaf2c44","observation_id":"261079b1-fbc2-47a0-b351-2d11666aee64","resolution":{"observed_at":"2026-08-07T14:46:09.288916Z","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:46:09.385044Z","title":"Scaling up visual and vision-language representation learning with noisy text supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.385044Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:10f1a283db175ca5bda5aec04036a26700cdac7663538102e6ab9ef355b0b192","observation_id":"a2ced383-a87b-4a94-8165-d741ec6d0fa5","resolution":{"observed_at":"2026-08-07T14:46:09.385044Z","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:46:09.573885Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.573885Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:8e50704a672dca2eae1758cdc3a1d6740ce11fbe624712e68a84ba7263ce729b","observation_id":"973bee41-ee9a-4ac3-a93f-6aed2d208d1a","resolution":{"observed_at":"2026-08-07T14:46:09.573885Z","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:46:09.776092Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.776092Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:e01a4013518febdff2147fd9e65ff528e35d9c4d3f5c244fe8261ae7d4709f74","observation_id":"917860f2-a195-4879-afd7-a68415224998","resolution":{"observed_at":"2026-08-07T14:46:09.776092Z","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:46:17.494253Z","title":"Lending orientation to neural networks for cross-view geo- localization","venue":null,"work_id":"fe65d122-2de6-4b36-8817-05ff66456cf8","year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:09.979685Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:1c5b498002cd7769a523d884b3aced098b0374ad1a3a70bdc0f29ca845ce5a4c","observation_id":"8ad7f28c-c7ab-413a-b163-4fef439f58a9","resolution":{"observed_at":"2026-08-07T14:46:17.550144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-07T14:46:10.091056Z","title":"Roberta: A robustly optimized bert pretraining approach","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.091056Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:0254d7339609df7194356dbf34ec0a9cdbbc4d1e5f41ad2602b6101e0cf4950a","observation_id":"7aa16aaf-5d78-4322-9396-f71fd4a67815","resolution":{"observed_at":"2026-08-07T14:46:10.091056Z","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:46:10.175000Z","title":"A convnet for the 2020s","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.175000Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:91b22fbe540238906646b286533934f8aa6d44ee4b36b422e097d0e00d9072c6","observation_id":"157161bd-fa3b-4b21-b5de-983ab929612c","resolution":{"observed_at":"2026-08-07T14:46:10.175000Z","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:46:17.264530Z","title":"Deepfashion: Powering robust clothes recognition and retrieval with rich annotations","venue":null,"work_id":"86b65bef-f3ff-4d7b-aae5-c14960c5efd1","year":2016},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.244894Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:b9f33c844d448426fd56c61c3dbc9525b171672c35a29e27318e685e5c38c7f2","observation_id":"3dc2ae9e-435c-477f-907c-97cdc7882d24","resolution":{"observed_at":"2026-08-07T14:46:17.386741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:17.125600Z","title":"Deep metric learning via lifted structured feature embedding","venue":null,"work_id":"d08cd324-566f-4ef1-9961-bf00a2359748","year":2016},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.320693Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:6e68f585b1389d5d00b0a1ee8b0ec98df354c99a8bbd761c1e8c81fd1fb50f31","observation_id":"21babe84-e040-441f-bd5f-bacec0deb0e7","resolution":{"observed_at":"2026-08-07T14:46:17.185960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-07T14:46:10.404931Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.404931Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:0fdbb7187c4ae6a1b1c7598a8ee0a4c801c83fb422f7c20f39063886b8ab3875","observation_id":"2f51d460-6669-4980-821e-54c95dfff03b","resolution":{"observed_at":"2026-08-07T14:46:10.404931Z","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:46:16.958006Z","title":"Recall@ k surrogate loss with large batches and similarity mixup","venue":null,"work_id":"89b6caa1-ebae-4fe4-9fb8-97c9fef64dab","year":2022},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.485106Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:25b5ee0c3228acbeb52f908ca304d9c77628b377d5ca6247b0b878ba934ee657","observation_id":"4ae252c1-c50b-48f2-9c71-96f6e190a204","resolution":{"observed_at":"2026-08-07T14:46:17.041978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:16.783639Z","title":"Wordnet:: Similarity-measuring the relatedness of concepts","venue":null,"work_id":"529c627c-d037-4623-8840-80381999a6e2","year":2004},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.569046Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:4281698872cd923d491d4f8ead4c03f1cd53df918dcf211a24da80d581ac09c7","observation_id":"aec9b96c-73ba-4226-a3dc-51f17f4fd85c","resolution":{"observed_at":"2026-08-07T14:46:16.842700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08191","last_updated":"2021-05-12T07:52:32Z","snapshot_observed_at":"2026-07-06T10:05:01.082738Z","submitted_at":"2020-10-16T06:54:05Z","title":"RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.08191","snapshot_observed_at":"2026-08-07T14:46:10.638784Z","title":"Rocketqa: An optimized training approach to dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.638784Z"},"links":{"cited_paper":"/paper/2010.08191","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:58cd52c47a0bb62a4da4100407e7d8c34e832374abb803c33759ebf93fc3feb1","observation_id":"21cd1b9a-aeff-4632-9096-c0b0afcdeeaa","resolution":{"observed_at":"2026-08-07T14:46:10.638784Z","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:46:10.715095Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.715095Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:442b1ff845c4c3a523e05f99af74fdc2280b8f9c05d75d1ad5ed70e9c49129a0","observation_id":"8a7a4778-83a1-4a52-b50a-f511c5ba5dfa","resolution":{"observed_at":"2026-08-07T14:46:10.715095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-07T14:46:10.806794Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.806794Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:be30b5294309cbda99e2dee765ce53ef59d9720501a51b8eb890f6ddaa5239fc","observation_id":"95fe6cd1-dcab-40dd-86b8-ed59ca51d992","resolution":{"observed_at":"2026-08-07T14:46:10.806794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09813","last_updated":"2020-10-05T06:30:56Z","snapshot_observed_at":"2026-08-06T22:52:30.854160Z","submitted_at":"2020-04-21T08:20:25Z","title":"Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09813","snapshot_observed_at":"2026-08-07T14:46:10.890869Z","title":"Making monolingual sentence embeddings multilingual using knowledge distillation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.890869Z"},"links":{"cited_paper":"/paper/2004.09813","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:8e6363417487053d7dc79c952f48e412bfd54d26ca4b1444ad8b1ab6598e4170","observation_id":"73ef5830-4d9e-4edc-bd09-ba3ee6ff6923","resolution":{"observed_at":"2026-08-07T14:46:10.890869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04592","last_updated":"2021-01-24T22:19:30Z","snapshot_observed_at":"2026-08-07T09:28:19.837584Z","submitted_at":"2020-10-09T14:18:53Z","title":"Contrastive Learning with Hard Negative Samples","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04592","snapshot_observed_at":"2026-08-07T14:46:10.981366Z","title":"Contrastive learning with hard negative samples","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:10.981366Z"},"links":{"cited_paper":"/paper/2010.04592","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:5b175556c6ba59604b345a51fd2ea17081b4fa2f209883265a4468d48766cce6","observation_id":"b7e5273a-afbd-4361-b311-fd968ca59915","resolution":{"observed_at":"2026-08-07T14:46:10.981366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-07T14:46:11.094849Z","title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.094849Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:3461934185061b8add3789e3827f1ab7a0670196245db02e61a37616d7956cd2","observation_id":"0a681f1e-2e24-4f9c-9e0c-787a846e4f29","resolution":{"observed_at":"2026-08-07T14:46:11.094849Z","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:46:11.186626Z","title":"Facenet: A unified embedding for face recognition and clustering","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.186626Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:3ae7ca7d0e2279bf46d752474eb6bc4febc660b4d27fee58f9cd4b3d9f0a5d79","observation_id":"af9d48ad-e717-4678-8d92-b335f638b1f6","resolution":{"observed_at":"2026-08-07T14:46:11.186626Z","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:46:16.549217Z","title":"Learning to hash for indexing big data—a survey","venue":null,"work_id":"b58f3ec5-3126-4da0-8fcb-514c07947ee2","year":2015},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.440222Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:7d691156eb47f1fe89b38e57b55f2e0ea6458739a4538ede7d6874f0b1571f42","observation_id":"70ca1e61-08ce-4634-aece-ec06f99305e1","resolution":{"observed_at":"2026-08-07T14:46:16.609818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:16.394307Z","title":"Multi-similarity loss with general pair weighting for deep metric learning","venue":null,"work_id":"4be77296-7bb9-4b2c-95b5-f477352d0acf","year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.533360Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:c03d1838031f53901d3f0aa9ff8a522123dfe07e36d5c5aa36efb2b697cf88b8","observation_id":"46bfdfff-25d9-406e-bc34-01014ec727c0","resolution":{"observed_at":"2026-08-07T14:46:16.471992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:16.176215Z","title":"Pytorch image models","venue":null,"work_id":"cbd68401-27f5-4883-8cdb-be2e5dfcd59c","year":2019},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.652525Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:6458bbc6448920c15e262b45ddbfef2ffd9d7944e9684ed20bfb7919a764e246","observation_id":"1c437191-b447-44e2-bdf3-667ffd43e177","resolution":{"observed_at":"2026-08-07T14:46:16.258851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:11.779688Z","title":"Wide-area image geolocalization with aerial reference imagery","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.779688Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:fe1fe73c5f1a7b50d43cb7f4ef1c20e2aeaeeecafbc96e119bf05eb16c4bc893","observation_id":"0d26ead8-7ba8-47b6-9be7-35125e51dcbd","resolution":{"observed_at":"2026-08-07T14:46:11.779688Z","resolver_source":null,"status":"malformed_identifier"},"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:46:15.927190Z","title":"Sampling matters in deep embedding learning","venue":null,"work_id":"94bf9401-41ea-479d-bd2b-d04328b29b52","year":2017},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.863239Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:d25d9140a8f18a5e3cbe2e9a78fe1c2ff1ac120f904cb61e184b69c7d7e65852","observation_id":"d1f59874-f41f-471f-9df8-135ba48fe005","resolution":{"observed_at":"2026-08-07T14:46:16.028595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00808","last_updated":"2020-10-20T22:17:19Z","snapshot_observed_at":"2026-08-06T15:45:53.027828Z","submitted_at":"2020-07-01T23:15:56Z","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00808","snapshot_observed_at":"2026-08-07T14:46:11.991617Z","title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:11.991617Z"},"links":{"cited_paper":"/paper/2007.00808","citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:b0f157b4170b86b774213989748c77eedeb42caa37d4470533005e7267d6cf0f","observation_id":"fb6e014e-92a4-4241-a3db-378eddb38c86","resolution":{"observed_at":"2026-08-07T14:46:11.991617Z","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:46:15.731410Z","title":"Improved embeddings with easy positive triplet mining","venue":null,"work_id":"fc9fa55d-87b2-494d-a0ad-275a1893e734","year":2020},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.123848Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:9249caebf6c609704fc99765d0e938d531e83cb1bc06c5fb053d4ecee16b7758","observation_id":"8feb1852-6db5-49a4-8168-4e50cf57d773","resolution":{"observed_at":"2026-08-07T14:46:15.813682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:15.497564Z","title":"Hard-aware deeply cascaded embedding","venue":null,"work_id":"34343e57-ddc1-4257-aa08-7c8e782135d4","year":2017},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.233493Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:06abf55d34035db5ccf95adcd20a18c5dc960fe2459894b6a889cc4c9656c725","observation_id":"8d0f3494-b731-40d9-b886-fd7c4efd2011","resolution":{"observed_at":"2026-08-07T14:46:15.581219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:12.344098Z","title":"Sigmoid loss for language image pre-training","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.344098Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:d0e4f4bb71c5a161a08ff60e4149229c5c17672a980fe29d880d89305c269cae","observation_id":"9b09d322-8498-4285-9262-b8170d491231","resolution":{"observed_at":"2026-08-07T14:46:12.344098Z","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:46:15.188362Z","title":"Multi-camera multi-player tracking with deep player identification in sports video","venue":null,"work_id":"6831529b-d7a1-4028-9b3c-cc4ac95002d9","year":2020},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.513510Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:3419e88c85b758a6aadc6959cf6ec7847657f145ef185f3b377b54843dcc83ed","observation_id":"e8ca962b-90bf-45d8-9962-343463ba6b1f","resolution":{"observed_at":"2026-08-07T14:46:15.318300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:14.979662Z","title":"Vigor: Cross-view image geo-localization beyond one-to-one retrieval","venue":null,"work_id":"02f41dd1-0b21-4b4f-b4b1-66672df1a307","year":2021},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.628658Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:a0de019b79f707cacf6f33851f8fc76de8d772069e11533741712a5eec91064b","observation_id":"cdabad64-3ce6-4b75-80b4-567263ba0667","resolution":{"observed_at":"2026-08-07T14:46:15.059231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:46:14.722218Z","title":"cross\" and","venue":null,"work_id":"af5c39fb-4c8a-468e-9c87-9843a46a47d8","year":2022},"citing_paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:12.738566Z"},"links":{"citing_paper":"/paper/2505.17844"},"observation_digest":"sha256:0740f091111d67374a3e3e78ba0084e22ec5a4d96cc6c2daf9c4b5b80ad04c85","observation_id":"2df3f004-aab6-416a-979a-10154667a2c5","resolution":{"observed_at":"2026-08-07T14:46:14.806345Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17844","last_updated":"2025-05-23T12:58:42Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-08T12:25:33.487726Z","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":26,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":52},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2505.17844."}