{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/oim","entry":"oim","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2405.02832","paper":"/paper/fast-one-stage-unsupervised-domain-adaptive","title":"Fast One-Stage Unsupervised Domain Adaptive Person Search","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whbdmu/FOUS","path":"models/oim.py","file_url":"https://github.com/whbdmu/FOUS/blob/HEAD/models/oim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1d698b9b7f331685","mcp_get_code":{"code_sha256":"1d698b9b7f331685"}},{"arxiv_id":"1907.13315","paper":"/paper/self-training-with-progressive-augmentation","title":"Self-training with progressive augmentation for unsupervised cross-domain person re-identification","date":"2019-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxinyu-xyz/PAST-ReID","path":"reid/loss/oim.py","file_url":"https://github.com/zhangxinyu-xyz/PAST-ReID/blob/HEAD/reid/loss/oim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48cf1aad1e6a206d","mcp_get_code":{"code_sha256":"48cf1aad1e6a206d"}},{"arxiv_id":"1904.11397","paper":"/paper/deep-constrained-dominant-sets-for-person-re","title":"Deep Constrained Dominant Sets for Person Re-identification","date":"2019-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leule/DCDS","path":"reid/loss/oim.py","file_url":"https://github.com/leule/DCDS/blob/HEAD/reid/loss/oim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48cf1aad1e6a206d","mcp_get_code":{"code_sha256":"48cf1aad1e6a206d"}},{"arxiv_id":"1904.00537","paper":"/paper/perceive-where-to-focus-learning-visibility","title":"Perceive Where to Focus: Learning Visibility-aware Part-level Features for Partial Person Re-identification","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YifanSun-ReID/VPM-reID","path":"reid/loss/oim.py","file_url":"https://github.com/YifanSun-ReID/VPM-reID/blob/HEAD/reid/loss/oim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"48cf1aad1e6a206d","mcp_get_code":{"code_sha256":"48cf1aad1e6a206d"}},{"arxiv_id":"1807.11334","paper":"/paper/unsupervised-domain-adaptive-re","title":"Unsupervised Domain Adaptive Re-Identification: Theory and Practice","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LcDog/DomainAdaptiveReID","path":"reid/loss/oim.py","file_url":"https://github.com/LcDog/DomainAdaptiveReID/blob/HEAD/reid/loss/oim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48cf1aad1e6a206d","mcp_get_code":{"code_sha256":"48cf1aad1e6a206d"}}]}