{"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/evaluate-py","entry":"evaluate_py","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":4,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"unverified":3},"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":"2101.10774","paper":"/paper/lightweight-multi-branch-network-for-person","title":"Lightweight Multi-Branch Network for Person Re-Identification","date":"2021-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jixunbo/LightMBN","path":"utils/functions.py","file_url":"https://github.com/jixunbo/LightMBN/blob/HEAD/utils/functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa18aef74cbf877a","mcp_get_code":{"code_sha256":"fa18aef74cbf877a"}},{"arxiv_id":"2001.04193","paper":"/paper/deep-learning-for-person-re-identification-a","title":"Deep Learning for Person Re-identification: A Survey and Outlook","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haoyu1004/AGW_mindspore","path":"src/metrics/rank.py","file_url":"https://github.com/Haoyu1004/AGW_mindspore/blob/HEAD/src/metrics/rank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ecbd84f325abbab0","mcp_get_code":{"code_sha256":"ecbd84f325abbab0"}},{"arxiv_id":"1908.01114","paper":"/paper/abd-net-attentive-but-diverse-person-re","title":"ABD-Net: Attentive but Diverse Person Re-Identification","date":"2019-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/ABD-Net","path":"torchreid/eval_metrics.py","file_url":"https://github.com/TAMU-VITA/ABD-Net/blob/HEAD/torchreid/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c4da11cacaff831","mcp_get_code":{"code_sha256":"6c4da11cacaff831"}},{"arxiv_id":"1905.13143","paper":"/paper/semantics-aligned-representation-learning-for","title":"Semantics-Aligned Representation Learning for Person Re-identification","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Semantics-Aligned-Representation-Learning-for-Person-Re-identification","path":"torchreid/eval_metrics.py","file_url":"https://github.com/microsoft/Semantics-Aligned-Representation-Learning-for-Person-Re-identification/blob/HEAD/torchreid/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c4da11cacaff831","mcp_get_code":{"code_sha256":"6c4da11cacaff831"}},{"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/metrics/rank.py","file_url":"https://github.com/2han9x1a0release/RLCC/blob/HEAD/openunreid/core/metrics/rank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99f281b515b56572","mcp_get_code":{"code_sha256":"99f281b515b56572"}}]}