{"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/wrapped-partial","entry":"wrapped_partial","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"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":0,"n_places":12,"n_places_pointer_only":0,"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":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":"2308.10299","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-adversarial-transferability-by-block","title":"Boosting Adversarial Transferability by Block Shuffle and Rotation","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustworthy-ai-group/bsr","path":"nets/mobilenet_v1.py","file_url":"https://github.com/trustworthy-ai-group/bsr/blob/HEAD/nets/mobilenet_v1.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"2106.09309","arxiv_id_is_arxiv":true,"paper":"/paper/layer-folding-neural-network-depth-reduction","title":"Layer Folding: Neural Network Depth Reduction using Activation Linearization","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LayerFolding/Layer-Folding","path":"Folded-Mobilenets/mobilenet_v2.py","file_url":"https://github.com/LayerFolding/Layer-Folding/blob/HEAD/Folded-Mobilenets/mobilenet_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1910.06849","arxiv_id_is_arxiv":true,"paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/deep_gcns","path":"sem_seg/batch_inference.py","file_url":"https://github.com/lightaime/deep_gcns/blob/HEAD/sem_seg/batch_inference.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":"1e0de6b9c650bc32","code_sha256_prefix":"1e0de6b9c650bc32","mcp_get_code":{"code_sha256":"1e0de6b9c650bc32"}},{"arxiv_id":"1909.10364","arxiv_id_is_arxiv":true,"paper":"/paper/190910364","title":"Class-dependent Compression of Deep Neural Networks","date":"2019-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rahimentezari/Sensys-ml2020","path":"MobileNet/mobilenet_v1.py","file_url":"https://github.com/rahimentezari/Sensys-ml2020/blob/HEAD/MobileNet/mobilenet_v1.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1907.06616","arxiv_id_is_arxiv":true,"paper":"/paper/facebook-fairs-wmt19-news-translation-task","title":"Facebook FAIR's WMT19 News Translation Task Submission","date":"2019-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyberagentailab/mbr-anomaly","path":"utils/metrics.py","file_url":"https://github.com/cyberagentailab/mbr-anomaly/blob/HEAD/utils/metrics.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":"4a9fc72802d4b61c","code_sha256_prefix":"4a9fc72802d4b61c","mcp_get_code":{"code_sha256":"4a9fc72802d4b61c"}},{"arxiv_id":"1905.02231","arxiv_id_is_arxiv":true,"paper":"/paper/a-geometric-approach-to-obtain-a-birds-eye","title":"A Geometric Approach to Obtain a Bird's Eye View from an Image","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SAmmarAbbas/birds-eye-view","path":"nets/mobilenet_v1.py","file_url":"https://github.com/SAmmarAbbas/birds-eye-view/blob/HEAD/nets/mobilenet_v1.py","status":"ran","verification_level":1,"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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1808.00897","arxiv_id_is_arxiv":true,"paper":"/paper/bisenet-bilateral-segmentation-network-for","title":"BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentation","date":"2018-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CodePlay2016/BiSENet-TF","path":"frontends/mobilenet_v2.py","file_url":"https://github.com/CodePlay2016/BiSENet-TF/blob/HEAD/frontends/mobilenet_v2.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1710.06081","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-adversarial-attacks-with-momentum","title":"Boosting Adversarial Attacks with Momentum","date":"2017-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongyp13/Non-Targeted-Adversarial-Attacks","path":"nets/mobilenet_v1.py","file_url":"https://github.com/dongyp13/Non-Targeted-Adversarial-Attacks/blob/HEAD/nets/mobilenet_v1.py","status":"ran","verification_level":1,"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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1703.07737","arxiv_id_is_arxiv":true,"paper":"/paper/in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AsuradaYuci/tripletreid-zhushi","path":"nets/mobilenet_v1.py","file_url":"https://github.com/AsuradaYuci/tripletreid-zhushi/blob/HEAD/nets/mobilenet_v1.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1701.06487","arxiv_id_is_arxiv":true,"paper":"/paper/dirty-pixels-optimizing-image-classification","title":"Dirty Pixels: Towards End-to-End Image Processing and Perception","date":"2017-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-computational-imaging/DirtyPixels","path":"nets/mobilenet_isp.py","file_url":"https://github.com/princeton-computational-imaging/DirtyPixels/blob/HEAD/nets/mobilenet_isp.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}},{"arxiv_id":"1409.5185","arxiv_id_is_arxiv":true,"paper":"/paper/deeply-supervised-nets","title":"Deeply-Supervised Nets","date":"2014-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellisdg/3DUnetCNN","path":"unet3d/utils/filenames.py","file_url":"https://github.com/ellisdg/3DUnetCNN/blob/HEAD/unet3d/utils/filenames.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":"1e0de6b9c650bc32","code_sha256_prefix":"1e0de6b9c650bc32","mcp_get_code":{"code_sha256":"1e0de6b9c650bc32"}},{"arxiv_id":"Wang_Boosting_Adversarial_Transferability_by_Block_Shuffle_and_Rotation_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Boosting_Adversarial_Transferability_by_Block_Shuffle_and_Rotation_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Trustworthy-AI-Group/BSR","path":"nets/mobilenet_v1.py","file_url":"https://github.com/Trustworthy-AI-Group/BSR/blob/HEAD/nets/mobilenet_v1.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":"b6e06004f7efe660","code_sha256_prefix":"b6e06004f7efe660","mcp_get_code":{"code_sha256":"b6e06004f7efe660"}}],"record_sha256":"f631a2563e15a24f5194860354e2e478e1c4a9ab56ab17e53caa938f0412db7a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}