{"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/k-reciprocal-neigh","entry":"k_reciprocal_neigh","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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":1,"unverified":0},"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":"2204.09826","arxiv_id_is_arxiv":true,"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":"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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1904.07223","arxiv_id_is_arxiv":true,"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":"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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1812.03282","arxiv_id_is_arxiv":true,"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":"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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1811.07130","arxiv_id_is_arxiv":true,"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":"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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"arxiv_id":"1805.09501","arxiv_id_is_arxiv":true,"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":"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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}},{"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":"ZJULearning/PTL","path":"functions.py","file_url":"https://github.com/ZJULearning/PTL/blob/HEAD/functions.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":"a610e67edff490e6","code_sha256_prefix":"a610e67edff490e6","mcp_get_code":{"code_sha256":"a610e67edff490e6"}}],"record_sha256":"17e49bae4cf176959b2a6af3703e90a4819e7e5a72da37bfa9cf13aef977d92e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}