{"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":"/code/criterion-2","entry":"Criterion","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":2},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2401.00617","arxiv_id_is_arxiv":true,"paper":"/paper/towards-improved-proxy-based-deep-metric","title":"Towards Improved Proxy-based Deep Metric Learning via Data-Augmented Domain Adaptation","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noahsark/dada","path":"criteria/dadaproxy.py","file_url":"https://github.com/noahsark/dada/blob/HEAD/criteria/dadaproxy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c68928c620a7b621","code_sha256_prefix":"c68928c620a7b621","mcp_get_code":{"code_sha256":"c68928c620a7b621"}},{"arxiv_id":"2310.00116","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-via-dynamic-margin","title":"Certified Robustness via Dynamic Margin Maximization and Improved Lipschitz Regularization","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"o4lc/crm-liplt","path":"Losses/GloRo.py","file_url":"https://github.com/o4lc/crm-liplt/blob/HEAD/Losses/GloRo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a311dbca0ad5db0","code_sha256_prefix":"1a311dbca0ad5db0","mcp_get_code":{"code_sha256":"1a311dbca0ad5db0"}},{"arxiv_id":"2207.03784","arxiv_id_is_arxiv":true,"paper":"/paper/a-non-isotropic-probabilistic-take-on-proxy","title":"A Non-isotropic Probabilistic Take on Proxy-based Deep Metric Learning","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplainableML/Probabilistic_Deep_Metric_Learning","path":"criteria/proxynca_nivmf.py","file_url":"https://github.com/ExplainableML/Probabilistic_Deep_Metric_Learning/blob/HEAD/criteria/proxynca_nivmf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ExplainableML/Probabilistic_Deep_Metric_Learning when it was checked","code_sha256":"331aa6e031ef162b","code_sha256_prefix":"331aa6e031ef162b","mcp_get_code":{"code_sha256":"331aa6e031ef162b"}},{"arxiv_id":"2112.07380","arxiv_id_is_arxiv":true,"paper":"/paper/tracer-extreme-attention-guided-salient","title":"TRACER: Extreme Attention Guided Salient Object Tracing Network","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Karel911/TRACER","path":"util/losses.py","file_url":"https://github.com/Karel911/TRACER/blob/HEAD/util/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f5bd6bccbeb5626f","code_sha256_prefix":"f5bd6bccbeb5626f","mcp_get_code":{"code_sha256":"f5bd6bccbeb5626f"}},{"arxiv_id":"2107.09562","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-generalization-under-out-of","title":"Characterizing Generalization under Out-Of-Distribution Shifts in Deep Metric Learning","date":"2021-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Confusezius/Characterizing_Generalization_in_DeepMetricLearning","path":"criteria/multisimilarity.py","file_url":"https://github.com/Confusezius/Characterizing_Generalization_in_DeepMetricLearning/blob/HEAD/criteria/multisimilarity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Confusezius/Characterizing_Generalization_in_DeepMetricLearning when it was checked","code_sha256":"e6afdf3a7fb7a934","code_sha256_prefix":"e6afdf3a7fb7a934","mcp_get_code":{"code_sha256":"e6afdf3a7fb7a934"}},{"arxiv_id":"2002.08473","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-training-strategies-and","title":"Revisiting Training Strategies and Generalization Performance in Deep Metric Learning","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Confusezius/ECCV2020_DiVA_MultiFeature_DML","path":"criteria/stacked_self_distill.py","file_url":"https://github.com/Confusezius/ECCV2020_DiVA_MultiFeature_DML/blob/HEAD/criteria/stacked_self_distill.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Confusezius/ECCV2020_DiVA_MultiFeature_DML when it was checked","code_sha256":"03d1431453ef1a6b","code_sha256_prefix":"03d1431453ef1a6b","mcp_get_code":{"code_sha256":"03d1431453ef1a6b"}}],"record_sha256":"cf4e17994e334d7f47facb02cd1ef36bec72d6aba6f4f63bfd963ee016d99179","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}