{"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/make-loss","entry":"make_loss","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":17,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":14,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":14,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":5,"n_places_pointer_only_link_open":3,"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":0,"unverified":14},"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":"2510.23301","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-23301","title":"MDReID: Modality-Decoupled Learning for Any-to-Any Multi-Modal Object Re-Identification","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"stone96123/MDReID","path":"layers/make_loss.py","file_url":"https://github.com/stone96123/MDReID/blob/HEAD/layers/make_loss.py","status":"unverified","verification_level":0,"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, stone96123/MDReID when it was checked","code_sha256":"ec30e45d4554b0e6","code_sha256_prefix":"ec30e45d4554b0e6","mcp_get_code":{"code_sha256":"ec30e45d4554b0e6"}},{"arxiv_id":"2501.19374","arxiv_id_is_arxiv":true,"paper":"/paper/fixing-the-double-penalty-in-data-driven","title":"Fixing the Double Penalty in Data-Driven Weather Forecasting Through a Modified Spherical Harmonic Loss Function","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csubich/graphcast","path":"trainer/loss_utils.py","file_url":"https://github.com/csubich/graphcast/blob/HEAD/trainer/loss_utils.py","status":"unverified","verification_level":0,"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":"a9ccb9594aa81ac4","code_sha256_prefix":"a9ccb9594aa81ac4","mcp_get_code":{"code_sha256":"a9ccb9594aa81ac4"}},{"arxiv_id":"2412.10650","arxiv_id_is_arxiv":true,"paper":"/paper/demo-decoupled-feature-based-mixture-of","title":"DeMo: Decoupled Feature-Based Mixture of Experts for Multi-Modal Object Re-Identification","date":"2024-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"924973292/demo","path":"layers/make_loss.py","file_url":"https://github.com/924973292/demo/blob/HEAD/layers/make_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from stone96123/MDReID, and GitHub detected no licence in that repository when it was checked","code_sha256":"ec30e45d4554b0e6","code_sha256_prefix":"ec30e45d4554b0e6","mcp_get_code":{"code_sha256":"ec30e45d4554b0e6"}},{"arxiv_id":"2403.10254","arxiv_id_is_arxiv":true,"paper":"/paper/magic-tokens-select-diverse-tokens-for-multi","title":"Magic Tokens: Select Diverse Tokens for Multi-modal Object Re-Identification","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"924973292/EDITOR","path":"layers/make_loss.py","file_url":"https://github.com/924973292/EDITOR/blob/HEAD/layers/make_loss.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":"2e6109d5214f6e2a","code_sha256_prefix":"2e6109d5214f6e2a","mcp_get_code":{"code_sha256":"2e6109d5214f6e2a"}},{"arxiv_id":"2312.09627","arxiv_id_is_arxiv":true,"paper":"/paper/tf-clip-learning-text-free-clip-for-video","title":"TF-CLIP: Learning Text-free CLIP for Video-based Person Re-Identification","date":"2023-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asuradayuci/tf-clip","path":"loss/make_loss.py","file_url":"https://github.com/asuradayuci/tf-clip/blob/HEAD/loss/make_loss.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":"38f935583212d5cc","code_sha256_prefix":"38f935583212d5cc","mcp_get_code":{"code_sha256":"38f935583212d5cc"}},{"arxiv_id":"2312.09612","arxiv_id_is_arxiv":true,"paper":"/paper/top-reid-multi-spectral-object-re","title":"TOP-ReID: Multi-spectral Object Re-Identification with Token Permutation","date":"2023-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"924973292/top-reid","path":"layers/make_loss.py","file_url":"https://github.com/924973292/top-reid/blob/HEAD/layers/make_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from stone96123/MDReID, and GitHub detected no licence in that repository when it was checked","code_sha256":"ec30e45d4554b0e6","code_sha256_prefix":"ec30e45d4554b0e6","mcp_get_code":{"code_sha256":"ec30e45d4554b0e6"}},{"arxiv_id":"2306.13856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raywang335/L2RCLIP","path":"loss/make_loss.py","file_url":"https://github.com/raywang335/L2RCLIP/blob/HEAD/loss/make_loss.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":"0fe9165ed9ea4d70","code_sha256_prefix":"0fe9165ed9ea4d70","mcp_get_code":{"code_sha256":"0fe9165ed9ea4d70"}},{"arxiv_id":"2302.14335","arxiv_id_is_arxiv":true,"paper":"/paper/dc-former-diverse-and-compact-transformer-for","title":"DC-Former: Diverse and Compact Transformer for Person Re-Identification","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-research/Diverse-and-Compact-Transformer","path":"loss/make_loss.py","file_url":"https://github.com/ant-research/Diverse-and-Compact-Transformer/blob/HEAD/loss/make_loss.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":"9eadacf338161ccb","code_sha256_prefix":"9eadacf338161ccb","mcp_get_code":{"code_sha256":"9eadacf338161ccb"}},{"arxiv_id":"2111.12084","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-pre-training-for-transformer","title":"Self-Supervised Pre-Training for Transformer-Based Person Re-Identification","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-cv/TransReID-SSL","path":"transreid_pytorch/loss/make_loss.py","file_url":"https://github.com/damo-cv/TransReID-SSL/blob/HEAD/transreid_pytorch/loss/make_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, damo-cv/TransReID-SSL, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"b26b436199409345","code_sha256_prefix":"b26b436199409345","mcp_get_code":{"code_sha256":"b26b436199409345"}},{"arxiv_id":"2109.06165","arxiv_id_is_arxiv":true,"paper":"/paper/cdtrans-cross-domain-transformer-for","title":"CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptation","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cdtrans/cdtrans","path":"loss/make_loss.py","file_url":"https://github.com/cdtrans/cdtrans/blob/HEAD/loss/make_loss.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":"2b5e77e0deb72f1b","code_sha256_prefix":"2b5e77e0deb72f1b","mcp_get_code":{"code_sha256":"2b5e77e0deb72f1b"}},{"arxiv_id":"2105.09701","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-vehicle-re","title":"An Empirical Study of Vehicle Re-Identification on the AI City Challenge","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michuanhaohao/AICITY2021_Track2_DMT","path":"loss/make_loss.py","file_url":"https://github.com/michuanhaohao/AICITY2021_Track2_DMT/blob/HEAD/loss/make_loss.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":"4b889f410e8c0400","code_sha256_prefix":"4b889f410e8c0400","mcp_get_code":{"code_sha256":"4b889f410e8c0400"}},{"arxiv_id":"1903.07071","arxiv_id_is_arxiv":true,"paper":"/paper/bags-of-tricks-and-a-strong-baseline-for-deep","title":"Bag of Tricks and A Strong Baseline for Deep Person Re-identification","date":"2019-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lulujianjie/person-reid-tiny-baseline","path":"loss/make_loss.py","file_url":"https://github.com/lulujianjie/person-reid-tiny-baseline/blob/HEAD/loss/make_loss.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":"4006e936d30ac573","code_sha256_prefix":"4006e936d30ac573","mcp_get_code":{"code_sha256":"4006e936d30ac573"}},{"arxiv_id":"1804.01438","arxiv_id_is_arxiv":true,"paper":"/paper/learning-discriminative-features-with","title":"Learning Discriminative Features with Multiple Granularities for Person Re-Identification","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangTaoAs/MGN_ReID","path":"loss/make_loss.py","file_url":"https://github.com/WangTaoAs/MGN_ReID/blob/HEAD/loss/make_loss.py","status":"unverified","verification_level":0,"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":"78f5737686a6d6fd","code_sha256_prefix":"78f5737686a6d6fd","mcp_get_code":{"code_sha256":"78f5737686a6d6fd"}},{"arxiv_id":"1609.01775","arxiv_id_is_arxiv":true,"paper":"/paper/performance-measures-and-a-data-set-for-multi","title":"Performance Measures and a Data Set for Multi-Target, Multi-Camera Tracking","date":"2016-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hh23333/tsd","path":"loss/make_loss.py","file_url":"https://github.com/hh23333/tsd/blob/HEAD/loss/make_loss.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":"098df16b204ff65f","code_sha256_prefix":"098df16b204ff65f","mcp_get_code":{"code_sha256":"098df16b204ff65f"}},{"arxiv_id":"aaai_32878","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32878","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"924973292/DeMo","path":"layers/make_loss.py","file_url":"https://github.com/924973292/DeMo/blob/HEAD/layers/make_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from stone96123/MDReID, and GitHub detected no licence in that repository when it was checked","code_sha256":"ec30e45d4554b0e6","code_sha256_prefix":"ec30e45d4554b0e6","mcp_get_code":{"code_sha256":"ec30e45d4554b0e6"}},{"arxiv_id":"aaai_28398","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28398","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ziwang1121/HTT","path":"loss/make_loss.py","file_url":"https://github.com/ziwang1121/HTT/blob/HEAD/loss/make_loss.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":"d82f0ad0e206efec","code_sha256_prefix":"d82f0ad0e206efec","mcp_get_code":{"code_sha256":"d82f0ad0e206efec"}},{"arxiv_id":"aaai_25225","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25225","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Syliz517/CLIP-ReID","path":"loss/make_loss.py","file_url":"https://github.com/Syliz517/CLIP-ReID/blob/HEAD/loss/make_loss.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":"5f0548f20386c258","code_sha256_prefix":"5f0548f20386c258","mcp_get_code":{"code_sha256":"5f0548f20386c258"}}],"record_sha256":"8b9e41ae01591de59b6109131216c5ee748a054621173102afdaabbade04a4e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}