{"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/conv-bn-no-relu","entry":"conv_bn_no_relu","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":7,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_fixture":0,"ran":4,"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":"2411.02537","arxiv_id_is_arxiv":true,"paper":"/paper/inquire-a-natural-world-text-to-image","title":"INQUIRE: A Natural World Text-to-Image Retrieval Benchmark","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biubug6/Pytorch_Retinaface","path":"models/net.py","file_url":"https://github.com/biubug6/Pytorch_Retinaface/blob/HEAD/models/net.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":"aacb8f654f54d534","code_sha256_prefix":"aacb8f654f54d534","mcp_get_code":{"code_sha256":"aacb8f654f54d534"}},{"arxiv_id":"2403.17008","arxiv_id_is_arxiv":true,"paper":"/paper/flashface-human-image-personalization-with","title":"FlashFace: Human Image Personalization with High-fidelity Identity Preservation","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ali-vilab/FlashFace","path":"ldm/models/retinaface.py","file_url":"https://github.com/ali-vilab/FlashFace/blob/HEAD/ldm/models/retinaface.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ali-vilab/FlashFace, 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":"d7862be631491ece","code_sha256_prefix":"d7862be631491ece","mcp_get_code":{"code_sha256":"d7862be631491ece"}},{"arxiv_id":"2303.17176","arxiv_id_is_arxiv":true,"paper":"/paper/a-view-from-somewhere-human-centric-face","title":"A View From Somewhere: Human-Centric Face Representations","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukimasano/PASS","path":"PASSify/face/models/net.py","file_url":"https://github.com/yukimasano/PASS/blob/HEAD/PASSify/face/models/net.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":"aacb8f654f54d534","code_sha256_prefix":"aacb8f654f54d534","mcp_get_code":{"code_sha256":"aacb8f654f54d534"}},{"arxiv_id":"2203.11593","arxiv_id_is_arxiv":true,"paper":"/paper/unified-negative-pair-generation-toward-well","title":"Unified Negative Pair Generation toward Well-discriminative Feature Space for Face Recognition","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jung-jun-uk/unpg","path":"detection/retinaface/models/net.py","file_url":"https://github.com/jung-jun-uk/unpg/blob/HEAD/detection/retinaface/models/net.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":"aacb8f654f54d534","code_sha256_prefix":"aacb8f654f54d534","mcp_get_code":{"code_sha256":"aacb8f654f54d534"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2275519762/RetinaFace_Pytorch","path":"models/net.py","file_url":"https://github.com/2275519762/RetinaFace_Pytorch/blob/HEAD/models/net.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":"aacb8f654f54d534","code_sha256_prefix":"aacb8f654f54d534","mcp_get_code":{"code_sha256":"aacb8f654f54d534"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuisongZhou/RetinaFace.pytorch","path":"models/net.py","file_url":"https://github.com/RuisongZhou/RetinaFace.pytorch/blob/HEAD/models/net.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":"3dfbecba8d9d1dba","code_sha256_prefix":"3dfbecba8d9d1dba","mcp_get_code":{"code_sha256":"3dfbecba8d9d1dba"}},{"arxiv_id":"1703.07332","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-are-we-from-solving-the-2d-3d-face","title":"How far are we from solving the 2D & 3D Face Alignment problem? (and a dataset of 230,000 3D facial landmarks)","date":"2017-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1adrianb/face-alignment","path":"face_alignment/detection/retinaface/net_retinaface.py","file_url":"https://github.com/1adrianb/face-alignment/blob/HEAD/face_alignment/detection/retinaface/net_retinaface.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":"aacb8f654f54d534","code_sha256_prefix":"aacb8f654f54d534","mcp_get_code":{"code_sha256":"aacb8f654f54d534"}},{"arxiv_id":"Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wang-zidu/3DDFA-V3","path":"face_box/retinaface/net.py","file_url":"https://github.com/wang-zidu/3DDFA-V3/blob/HEAD/face_box/retinaface/net.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":"5f62c7f2cf1e0f84","code_sha256_prefix":"5f62c7f2cf1e0f84","mcp_get_code":{"code_sha256":"5f62c7f2cf1e0f84"}}],"record_sha256":"ab703792142f63d08d7686a2ed9340a62f94d6dab3a9be524c88b4587d5c5f31","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}