{"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/tripletloss","entry":"TripletLoss","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":6,"n_papers_ran_no_instrument_failure":6,"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":7,"n_samples_ran":6,"n_samples_constructed":2,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":7,"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":6,"unverified":1},"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":"2308.04380","arxiv_id_is_arxiv":true,"paper":"/paper/your-negative-may-not-be-true-negative","title":"Your Negative May not Be True Negative: Boosting Image-Text Matching with False Negative Elimination","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luminosityx/fne","path":"loss.py","file_url":"https://github.com/luminosityx/fne/blob/HEAD/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, luminosityx/fne, is not in the permissive set Syntology serves inline","code_sha256":"c039a7b633159cd9","code_sha256_prefix":"c039a7b633159cd9","mcp_get_code":{"code_sha256":"c039a7b633159cd9"}},{"arxiv_id":"2207.06652","arxiv_id_is_arxiv":true,"paper":"/paper/every-preference-changes-differently-neural","title":"Everyone's Preference Changes Differently: Weighted Multi-Interest Retrieval Model","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shihui2010/mip","path":"modules/named_models.py","file_url":"https://github.com/shihui2010/mip/blob/HEAD/modules/named_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bad0b84ee7c194b1","code_sha256_prefix":"bad0b84ee7c194b1","mcp_get_code":{"code_sha256":"bad0b84ee7c194b1"}},{"arxiv_id":"2204.02597","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-predicates-learning-for-scene","title":"Fine-Grained Predicates Learning for Scene Graph Generation","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinyulyu/fgpl","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/loss.py","file_url":"https://github.com/xinyulyu/fgpl/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xinyulyu/fgpl when it was checked","code_sha256":"b33af276d20651f6","code_sha256_prefix":"b33af276d20651f6","mcp_get_code":{"code_sha256":"b33af276d20651f6"}},{"arxiv_id":"2203.16533","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-pre-training-for-person-re","title":"Large-Scale Pre-training for Person Re-identification with Noisy Labels","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifzhang/FairMOT","path":"src/lib/models/losses.py","file_url":"https://github.com/ifzhang/FairMOT/blob/HEAD/src/lib/models/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f7aac120b9147a0","code_sha256_prefix":"8f7aac120b9147a0","mcp_get_code":{"code_sha256":"8f7aac120b9147a0"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EchoItLiu/SelfGait","path":"trainer.py","file_url":"https://github.com/EchoItLiu/SelfGait/blob/HEAD/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EchoItLiu/SelfGait when it was checked","code_sha256":"e693eee1106320c1","code_sha256_prefix":"e693eee1106320c1","mcp_get_code":{"code_sha256":"e693eee1106320c1"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tamerthamoqa/facenet-pytorch-glint360k","path":"losses/triplet_loss.py","file_url":"https://github.com/tamerthamoqa/facenet-pytorch-glint360k/blob/HEAD/losses/triplet_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"670ffaa5bf0a16fe","code_sha256_prefix":"670ffaa5bf0a16fe","mcp_get_code":{"code_sha256":"670ffaa5bf0a16fe"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iwasakishuto/DeepScreening","path":"deepscreening/tripletloss.py","file_url":"https://github.com/iwasakishuto/DeepScreening/blob/HEAD/deepscreening/tripletloss.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":"3a2a30ab2e8281ef","code_sha256_prefix":"3a2a30ab2e8281ef","mcp_get_code":{"code_sha256":"3a2a30ab2e8281ef"}}],"record_sha256":"4b73b03c6671da93c76c0ba1c968c3f1b0e2b6576a6f65597eab8cbb305ec5a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}