{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/in-shop/papers/ran/1","list_of":"/dataset/in-shop","dataset":"In-Shop","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,8],"of":8,"counts":{"papers_with_a_benchmark_row":18,"with_a_code_link":13,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/in-shop/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/learning-semantic-proxies-from-visual-prompts","slug":"learning-semantic-proxies-from-visual-prompts","title":"Learning Semantic Proxies from Visual Prompts for Parameter-Efficient Fine-Tuning in Deep Metric Learning","date":"2024-02-04","arxiv_id":"2402.02340","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["noahsark/parameterefficient-dml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-semantic-proxies-from-visual-prompts#ran","syntology_url":"https://syntology.ai/paper/2402.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02340"}}}},{"paper":"/paper/unicom-universal-and-compact-representation","slug":"unicom-universal-and-compact-representation","title":"Unicom: Universal and Compact Representation Learning for Image Retrieval","date":"2023-04-12","arxiv_id":"2304.05884","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["deepglint/unicom"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicom-universal-and-compact-representation#ran","syntology_url":"https://syntology.ai/paper/2304.05884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05884"}}}},{"paper":"/paper/hyperbolic-vision-transformers-combining","slug":"hyperbolic-vision-transformers-combining","title":"Hyperbolic Vision Transformers: Combining Improvements in Metric Learning","date":"2022-03-21","arxiv_id":"2203.10833","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["htdt/hyp_metric"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperbolic-vision-transformers-combining#ran","syntology_url":"https://syntology.ai/paper/2203.10833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10833"}}}},{"paper":"/paper/it-takes-two-to-tango-mixup-for-deep-metric","slug":"it-takes-two-to-tango-mixup-for-deep-metric","title":"It Takes Two to Tango: Mixup for Deep Metric Learning","date":"2021-06-09","arxiv_id":"2106.04990","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["billpsomas/Metrix_ICLR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/it-takes-two-to-tango-mixup-for-deep-metric#ran","syntology_url":"https://syntology.ai/paper/2106.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04990"}}}},{"paper":"/paper/proxynca-revisiting-and-revitalizing-proxy","slug":"proxynca-revisiting-and-revitalizing-proxy","title":"ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysis","date":"2020-04-02","arxiv_id":"2004.01113","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proxynca-revisiting-and-revitalizing-proxy#ran","syntology_url":"https://syntology.ai/paper/2004.01113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01113"}}}},{"paper":"/paper/metric-learning-cross-entropy-vs-pairwise","slug":"metric-learning-cross-entropy-vs-pairwise","title":"A unifying mutual information view of metric learning: cross-entropy vs. pairwise losses","date":"2020-03-19","arxiv_id":"2003.08983","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jeromerony/dml_cross_entropy"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/metric-learning-cross-entropy-vs-pairwise#ran","syntology_url":"https://syntology.ai/paper/2003.08983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08983"}}}},{"paper":"/paper/improved-embeddings-with-easy-positive","slug":"improved-embeddings-with-easy-positive","title":"Improved Embeddings with Easy Positive Triplet Mining","date":"2019-04-08","arxiv_id":"1904.04370","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["littleredxh/EasyPositiveHardNegative"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-embeddings-with-easy-positive#ran","syntology_url":"https://syntology.ai/paper/1904.04370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04370"}}}},{"paper":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}}}}],"record_sha256":"cd18eca7578b52c7b7956bf4d2ef1ce9e4af13c473c550ea95f6ed4d425afad6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}