{"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/stanford-online-products/papers/ran/1","list_of":"/dataset/stanford-online-products","dataset":"Stanford Online Products","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,22],"of":22,"counts":{"papers_with_a_benchmark_row":40,"with_a_code_link":35,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":40,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/stanford-online-products/papers/ran/1","prev":null,"next":null,"papers":[{"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":2,"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/hierarchical-average-precision-training-for","slug":"hierarchical-average-precision-training-for","title":"Hierarchical Average Precision Training for Pertinent Image Retrieval","date":"2022-07-05","arxiv_id":"2207.04873","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":1,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["elias-ramzi/happier"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-average-precision-training-for#ran","syntology_url":"https://syntology.ai/paper/2207.04873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04873"}}}},{"paper":"/paper/attributable-visual-similarity-learning","slug":"attributable-visual-similarity-learning","title":"Attributable Visual Similarity Learning","date":"2022-03-28","arxiv_id":"2203.14932","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["zbr17/avsl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/attributable-visual-similarity-learning#ran","syntology_url":"https://syntology.ai/paper/2203.14932","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14932"}}}},{"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/integrating-language-guidance-into-vision","slug":"integrating-language-guidance-into-vision","title":"Integrating Language Guidance into Vision-based Deep Metric Learning","date":"2022-03-16","arxiv_id":"2203.08543","rows_on_this_dataset":1,"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":{"repos":["explainableml/languageguidance_for_dml"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/integrating-language-guidance-into-vision#ran","syntology_url":"https://syntology.ai/paper/2203.08543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08543"}}}},{"paper":"/paper/non-isotropy-regularization-for-proxy-based","slug":"non-isotropy-regularization-for-proxy-based","title":"Non-isotropy Regularization for Proxy-based Deep Metric Learning","date":"2022-03-16","arxiv_id":"2203.08547","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["explainableml/nonisotropicproxydml"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/non-isotropy-regularization-for-proxy-based#ran","syntology_url":"https://syntology.ai/paper/2203.08547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08547"}}}},{"paper":"/paper/cross-modal-retrieval-with-querybank","slug":"cross-modal-retrieval-with-querybank","title":"Cross Modal Retrieval with Querybank Normalisation","date":"2021-12-23","arxiv_id":"2112.12777","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ioanacroi/qb-norm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cross-modal-retrieval-with-querybank#ran","syntology_url":"https://syntology.ai/paper/2112.12777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12777"}}}},{"paper":"/paper/robust-and-decomposable-average-precision-for","slug":"robust-and-decomposable-average-precision-for","title":"Robust and Decomposable Average Precision for Image Retrieval","date":"2021-10-01","arxiv_id":"2110.01445","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["elias-ramzi/roadmap"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/robust-and-decomposable-average-precision-for#ran","syntology_url":"https://syntology.ai/paper/2110.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01445"}}}},{"paper":"/paper/recall-k-surrogate-loss-with-large-batches","slug":"recall-k-surrogate-loss-with-large-batches","title":"Recall@k Surrogate Loss with Large Batches and Similarity Mixup","date":"2021-08-25","arxiv_id":"2108.11179","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["yash0307/RecallatK_surrogate","yash0307/recallatk"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recall-k-surrogate-loss-with-large-batches#ran","syntology_url":"https://syntology.ai/paper/2108.11179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11179"}}}},{"paper":"/paper/towards-interpretable-deep-metric-learning","slug":"towards-interpretable-deep-metric-learning","title":"Towards Interpretable Deep Metric Learning with Structural Matching","date":"2021-08-12","arxiv_id":"2108.05889","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":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["wl-zhao/diml"],"state":"official (archive's flag): 2 ran","n_ran":2,"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/towards-interpretable-deep-metric-learning#ran","syntology_url":"https://syntology.ai/paper/2108.05889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05889"}}}},{"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/s2sd-simultaneous-similarity-based-self","slug":"s2sd-simultaneous-similarity-based-self","title":"S2SD: Simultaneous Similarity-based Self-Distillation for Deep Metric Learning","date":"2020-09-17","arxiv_id":"2009.08348","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["MLforHealth/S2SD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/s2sd-simultaneous-similarity-based-self#ran","syntology_url":"https://syntology.ai/paper/2009.08348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08348"}}}},{"paper":"/paper/smooth-ap-smoothing-the-path-towards-large","slug":"smooth-ap-smoothing-the-path-towards-large","title":"Smooth-AP: Smoothing the Path Towards Large-Scale Image Retrieval","date":"2020-07-23","arxiv_id":"2007.12163","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/smooth-ap-smoothing-the-path-towards-large#ran","syntology_url":"https://syntology.ai/paper/2007.12163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12163"}}}},{"paper":"/paper/diva-diverse-visual-feature-aggregation","slug":"diva-diverse-visual-feature-aggregation","title":"DiVA: Diverse Visual Feature Aggregation for Deep Metric Learning","date":"2020-04-28","arxiv_id":"2004.13458","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["Confusezius/ECCV2020_DiVA_MultiFeature_DML"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/diva-diverse-visual-feature-aggregation#ran","syntology_url":"https://syntology.ai/paper/2004.13458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13458"}}}},{"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/pads-policy-adapted-sampling-for-visual","slug":"pads-policy-adapted-sampling-for-visual","title":"PADS: Policy-Adapted Sampling for Visual Similarity Learning","date":"2020-03-24","arxiv_id":"2003.11113","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["Confusezius/CVPR2020_PADS"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pads-policy-adapted-sampling-for-visual#ran","syntology_url":"https://syntology.ai/paper/2003.11113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11113"}}}},{"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/circle-loss-a-unified-perspective-of-pair","slug":"circle-loss-a-unified-perspective-of-pair","title":"Circle Loss: A Unified Perspective of Pair Similarity Optimization","date":"2020-02-25","arxiv_id":"2002.10857","rows_on_this_dataset":1,"code_links":16,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/circle-loss-a-unified-perspective-of-pair#ran","syntology_url":"https://syntology.ai/paper/2002.10857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10857"}}}},{"paper":"/paper/compounding-the-performance-improvements-of","slug":"compounding-the-performance-improvements-of","title":"Compounding the Performance Improvements of Assembled Techniques in a Convolutional Neural Network","date":"2020-01-17","arxiv_id":"2001.06268","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":8,"pointer_only_for_licence":0,"official":{"repos":["clovaai/assembled-cnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/compounding-the-performance-improvements-of#ran","syntology_url":"https://syntology.ai/paper/2001.06268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06268"}}}},{"paper":"/paper/the-group-loss-for-deep-metric-learning","slug":"the-group-loss-for-deep-metric-learning","title":"The Group Loss for Deep Metric Learning","date":"2019-12-01","arxiv_id":"1912.00385","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":18,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["dvl-tum/group_loss"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-group-loss-for-deep-metric-learning#ran","syntology_url":"https://syntology.ai/paper/1912.00385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00385"}}}},{"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":"28eccb97947e0b7b33fa39e3213e881f030d199cdeda00877513bc74967d67a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}