{"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/expand-boxes","entry":"expand_boxes","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":3,"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":"2408.12569","arxiv_id_is_arxiv":true,"paper":"/paper/sapiens-foundation-for-human-vision-models","title":"Sapiens: Foundation for Human Vision Models","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibaiGorordo/Sapiens-Pytorch-Inference","path":"sapiens_inference/predictor.py","file_url":"https://github.com/ibaiGorordo/Sapiens-Pytorch-Inference/blob/HEAD/sapiens_inference/predictor.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":"e2ee7c364e6d3b69","code_sha256_prefix":"e2ee7c364e6d3b69","mcp_get_code":{"code_sha256":"e2ee7c364e6d3b69"}},{"arxiv_id":"2308.08182","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptive-detection-with","title":"Unsupervised Domain Adaptive Detection with Network Stability Analysis","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiankongzhang/nsa","path":"detection/layers/mask_ops.py","file_url":"https://github.com/tiankongzhang/nsa/blob/HEAD/detection/layers/mask_ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tiankongzhang/nsa when it was checked","code_sha256":"5362c4106bc79217","code_sha256_prefix":"5362c4106bc79217","mcp_get_code":{"code_sha256":"5362c4106bc79217"}},{"arxiv_id":"2010.13757","arxiv_id_is_arxiv":true,"paper":"/paper/gan-mask-r-cnn-instance-semantic-segmentation","title":"Instance Semantic Segmentation Benefits from Generative Adversarial Networks","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quangle2110/GAN_Mask-RCNN","path":"maskrcnn-benchmark/maskrcnn_benchmark/modeling/roi_heads/mask_head/inference.py","file_url":"https://github.com/quangle2110/GAN_Mask-RCNN/blob/HEAD/maskrcnn-benchmark/maskrcnn_benchmark/modeling/roi_heads/mask_head/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tiankongzhang/nsa, and GitHub detected no licence in that repository when it was checked","code_sha256":"5362c4106bc79217","code_sha256_prefix":"5362c4106bc79217","mcp_get_code":{"code_sha256":"5362c4106bc79217"}},{"arxiv_id":"1904.01355","arxiv_id_is_arxiv":true,"paper":"/paper/fcos-fully-convolutional-one-stage-object","title":"FCOS: Fully Convolutional One-Stage Object Detection","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuananh1007/Faster-R-CNN-and-Mask-R-CNN-in-PyTorch-1.0","path":"maskrcnn_benchmark/modeling/roi_heads/mask_head/inference.py","file_url":"https://github.com/tuananh1007/Faster-R-CNN-and-Mask-R-CNN-in-PyTorch-1.0/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/mask_head/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, tuananh1007/Faster-R-CNN-and-Mask-R-CNN-in-PyTorch-1.0, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5362c4106bc79217","code_sha256_prefix":"5362c4106bc79217","mcp_get_code":{"code_sha256":"5362c4106bc79217"}},{"arxiv_id":"1811.12596","arxiv_id_is_arxiv":true,"paper":"/paper/parsing-r-cnn-for-instance-level-human","title":"Parsing R-CNN for Instance-Level Human Analysis","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soeaver/Parsing-R-CNN","path":"rcnn/modeling/parsing_rcnn/inference.py","file_url":"https://github.com/soeaver/Parsing-R-CNN/blob/HEAD/rcnn/modeling/parsing_rcnn/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb0a4da500640f09","code_sha256_prefix":"eb0a4da500640f09","mcp_get_code":{"code_sha256":"eb0a4da500640f09"}}],"record_sha256":"d8849aed491cd90cc347793d6b7c04eaee9642ad290f1e35ab62a35c86878087","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}