{"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/cmc","entry":"cmc","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":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":2,"unverified":2},"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":"2605.20735","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20735","title":"Lowering the Barrier to IREX Participation: Open-Source Algorithms, Toolkit, and Benchmarking for Iris Recognition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"CVRL/OpenSourceIrisRecognition","path":"methods/ArcIris/Python/1N_matching.py","file_url":"https://github.com/CVRL/OpenSourceIrisRecognition/blob/HEAD/methods/ArcIris/Python/1N_matching.py","status":"ran","verification_level":1,"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, CVRL/OpenSourceIrisRecognition when it was checked","code_sha256":"7763a16836cbc3d5","code_sha256_prefix":"7763a16836cbc3d5","mcp_get_code":{"code_sha256":"7763a16836cbc3d5"}},{"arxiv_id":"2101.10774","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25d4a263fb17282e","code_sha256_prefix":"25d4a263fb17282e","mcp_get_code":{"code_sha256":"25d4a263fb17282e"}},{"arxiv_id":"1904.02998","arxiv_id_is_arxiv":true,"paper":"/paper/relation-aware-global-attention","title":"Relation-Aware Global Attention for Person Re-identification","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Relation-Aware-Global-Attention-Networks","path":"reid/evaluation_metrics/ranking.py","file_url":"https://github.com/microsoft/Relation-Aware-Global-Attention-Networks/blob/HEAD/reid/evaluation_metrics/ranking.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":"b39a10404aa7ed0b","code_sha256_prefix":"b39a10404aa7ed0b","mcp_get_code":{"code_sha256":"b39a10404aa7ed0b"}},{"arxiv_id":"1904.01990","arxiv_id_is_arxiv":true,"paper":"/paper/invariance-matters-exemplar-memory-for-domain","title":"Invariance Matters: Exemplar Memory for Domain Adaptive Person Re-identification","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhunzhong07/ECN","path":"reid/evaluation_metrics/ranking.py","file_url":"https://github.com/zhunzhong07/ECN/blob/HEAD/reid/evaluation_metrics/ranking.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":"b39a10404aa7ed0b","code_sha256_prefix":"b39a10404aa7ed0b","mcp_get_code":{"code_sha256":"b39a10404aa7ed0b"}},{"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":"d829b83e56e02c65","code_sha256_prefix":"d829b83e56e02c65","mcp_get_code":{"code_sha256":"d829b83e56e02c65"}},{"arxiv_id":"1512.04150","arxiv_id_is_arxiv":true,"paper":"/paper/learning-deep-features-for-discriminative","title":"Learning Deep Features for Discriminative Localization","date":"2015-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HRanWang/SA","path":"reid/evaluation_metrics/ranking.py","file_url":"https://github.com/HRanWang/SA/blob/HEAD/reid/evaluation_metrics/ranking.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":"45d780ae624e4a07","code_sha256_prefix":"45d780ae624e4a07","mcp_get_code":{"code_sha256":"45d780ae624e4a07"}}],"record_sha256":"1d76d7d867c01beee707a1d25c8a213134bab4010ee86fb5bb4747ba38901df1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}