{"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/k-reciprocal-neigh","entry":"k_reciprocal_neigh","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":6,"n_papers_ran":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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2204.09826","paper":"/paper/simmc-simple-masked-contrastive-learning-of","title":"SimMC: Simple Masked Contrastive Learning of Skeleton Representations for Unsupervised Person Re-Identification","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kali-Hac/SimMC","path":"utils/faiss_rerank.py","file_url":"https://github.com/Kali-Hac/SimMC/blob/HEAD/utils/faiss_rerank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1904.07223","paper":"/paper/joint-discriminative-and-generative-learning","title":"Joint Discriminative and Generative Learning for Person Re-identification","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Proxim123/person-reID-No1-","path":"re_ranking.py","file_url":"https://github.com/Proxim123/person-reID-No1-/blob/HEAD/re_ranking.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1812.03282","paper":"/paper/spatial-temporal-person-re-identification","title":"Spatial-Temporal Person Re-identification","date":"2018-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SurajDonthi/Multi-Camera-Person-Re-Identification","path":"mtmct_reid/re_ranking.py","file_url":"https://github.com/SurajDonthi/Multi-Camera-Person-Re-Identification/blob/HEAD/mtmct_reid/re_ranking.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1811.07130","paper":"/paper/batch-feature-erasing-for-person-re","title":"Batch DropBlock Network for Person Re-identification and Beyond","date":"2018-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daizuozhuo/batch-dropblock-network","path":"trainers/re_ranking.py","file_url":"https://github.com/daizuozhuo/batch-dropblock-network/blob/HEAD/trainers/re_ranking.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1805.09501","paper":"/paper/autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2han9x1a0release/RLCC","path":"openunreid/core/utils/compute_dist.py","file_url":"https://github.com/2han9x1a0release/RLCC/blob/HEAD/openunreid/core/utils/compute_dist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1804.01438","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":"ZJULearning/PTL","path":"functions.py","file_url":"https://github.com/ZJULearning/PTL/blob/HEAD/functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}}]}