{"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/draw-bbox","entry":"draw_bbox","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":5,"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":"2608.30688","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30688","title":"UFPR-PEs: A Brazilian Face Recognition Benchmark with Self-Declared Race/Color Labels","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"UFPR-IPASP-PR/UFPR-PEs","path":"face_detection/detect_crop_faces_retinaface.py","file_url":"https://github.com/UFPR-IPASP-PR/UFPR-PEs/blob/HEAD/face_detection/detect_crop_faces_retinaface.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, UFPR-IPASP-PR/UFPR-PEs (NOASSERTION)","code_sha256":"b82ac783ef9235d9","code_sha256_prefix":"b82ac783ef9235d9","mcp_get_code":{"code_sha256":"b82ac783ef9235d9"}},{"arxiv_id":"2203.03339","arxiv_id_is_arxiv":true,"paper":"/paper/l2cs-net-fine-grained-gaze-estimation-in","title":"L2CS-Net: Fine-Grained Gaze Estimation in Unconstrained Environments","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmednull/l2cs-net","path":"l2cs/vis.py","file_url":"https://github.com/ahmednull/l2cs-net/blob/HEAD/l2cs/vis.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":"1db8413dd5010d6d","code_sha256_prefix":"1db8413dd5010d6d","mcp_get_code":{"code_sha256":"1db8413dd5010d6d"}},{"arxiv_id":"2112.07957","arxiv_id_is_arxiv":true,"paper":"/paper/fear-fast-efficient-accurate-and-robust","title":"FEAR: Fast, Efficient, Accurate and Robust Visual Tracker","date":"2021-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pinatafarms/feartracker","path":"demo_video.py","file_url":"https://github.com/pinatafarms/feartracker/blob/HEAD/demo_video.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":"5c2fa49800b3e405","code_sha256_prefix":"5c2fa49800b3e405","mcp_get_code":{"code_sha256":"5c2fa49800b3e405"}},{"arxiv_id":"2004.01888","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nolanzzz/MTMCT","path":"util.py","file_url":"https://github.com/nolanzzz/MTMCT/blob/HEAD/util.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":"5f61628f4d5e3b95","code_sha256_prefix":"5f61628f4d5e3b95","mcp_get_code":{"code_sha256":"5f61628f4d5e3b95"}},{"arxiv_id":"1909.11895","arxiv_id_is_arxiv":true,"paper":"/paper/joint-task-self-supervised-learning-for","title":"Joint-task Self-supervised Learning for Temporal Correspondence","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liusifei/UVC","path":"libs/train_utils.py","file_url":"https://github.com/Liusifei/UVC/blob/HEAD/libs/train_utils.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":"a5d852d21a97fde4","code_sha256_prefix":"a5d852d21a97fde4","mcp_get_code":{"code_sha256":"a5d852d21a97fde4"}},{"arxiv_id":"1904.07850","arxiv_id_is_arxiv":true,"paper":"/paper/objects-as-points","title":"Objects as Points","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlongRide/CenterNet_anchor_free","path":"1_util.py","file_url":"https://github.com/AlongRide/CenterNet_anchor_free/blob/HEAD/1_util.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":"5f61628f4d5e3b95","code_sha256_prefix":"5f61628f4d5e3b95","mcp_get_code":{"code_sha256":"5f61628f4d5e3b95"}},{"arxiv_id":"1803.10683","arxiv_id_is_arxiv":true,"paper":"/paper/pose2seg-detection-free-human-instance","title":"Pose2Seg: Detection Free Human Instance Segmentation","date":"2018-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liruilong940607/OCHumanApi","path":"ochumanApi/vis.py","file_url":"https://github.com/liruilong940607/OCHumanApi/blob/HEAD/ochumanApi/vis.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":"7ea3f744b9047938","code_sha256_prefix":"7ea3f744b9047938","mcp_get_code":{"code_sha256":"7ea3f744b9047938"}}],"record_sha256":"7061bdbcdf03960de1dc86b388f94865380e3e600ffb3e792374c9636e308e5a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}