{"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/merge-matches","entry":"merge_matches","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":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":5,"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":"2302.11813","paper":"/paper/deep-oc-sort-multi-pedestrian-tracking-by","title":"Deep OC-SORT: Multi-Pedestrian Tracking by Adaptive Re-Identification","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gerardmaggiolino/deep-oc-sort","path":"trackers/byte_tracker/matching.py","file_url":"https://github.com/gerardmaggiolino/deep-oc-sort/blob/HEAD/trackers/byte_tracker/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de19615aab6efe36","mcp_get_code":{"code_sha256":"de19615aab6efe36"}},{"arxiv_id":"2206.14651","paper":"/paper/bot-sort-robust-associations-multi-pedestrian","title":"BoT-SORT: Robust Associations Multi-Pedestrian Tracking","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niraharon/bot-sort","path":"tracker/matching.py","file_url":"https://github.com/niraharon/bot-sort/blob/HEAD/tracker/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de19615aab6efe36","mcp_get_code":{"code_sha256":"de19615aab6efe36"}},{"arxiv_id":"2110.06864","paper":"/paper/bytetrack-multi-object-tracking-by-1","title":"ByteTrack: Multi-Object Tracking by Associating Every Detection Box","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadirnar/bytetrack-pip","path":"bytetracker/matching.py","file_url":"https://github.com/kadirnar/bytetrack-pip/blob/HEAD/bytetracker/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de19615aab6efe36","mcp_get_code":{"code_sha256":"de19615aab6efe36"}},{"arxiv_id":"2010.12138","paper":"/paper/rethinking-the-competition-between-detection","title":"Rethinking the competition between detection and ReID in Multi-Object Tracking","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongdao/Towards-Realtime-MOT","path":"tracker/matching.py","file_url":"https://github.com/Zhongdao/Towards-Realtime-MOT/blob/HEAD/tracker/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de19615aab6efe36","mcp_get_code":{"code_sha256":"de19615aab6efe36"}},{"arxiv_id":"1909.12605","paper":"/paper/towards-real-time-multi-object-tracking","title":"Towards Real-Time Multi-Object Tracking","date":"2019-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bellekci/Towards-Realtime-MOT-windows-py37","path":"tracker/matching.py","file_url":"https://github.com/bellekci/Towards-Realtime-MOT-windows-py37/blob/HEAD/tracker/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de19615aab6efe36","mcp_get_code":{"code_sha256":"de19615aab6efe36"}}]}