{"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/calculate-roc","entry":"calculate_roc","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":6,"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":11,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":17,"n_places_pointer_only":8,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":4,"ran":6,"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":"2609.01141","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01141","title":"Revisiting Face Recognition for Monozygotic Twins: The Celeb Twins Test Set","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mzang20/CTTS","path":"verification.py","file_url":"https://github.com/mzang20/CTTS/blob/HEAD/verification.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":"9099bff90b8fbd1d","code_sha256_prefix":"9099bff90b8fbd1d","mcp_get_code":{"code_sha256":"9099bff90b8fbd1d"}},{"arxiv_id":"2405.15020","arxiv_id_is_arxiv":true,"paper":"/paper/adjointdeis-efficient-gradients-for-diffusion","title":"AdjointDEIS: Efficient Gradients for Diffusion Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdbtrs/ElasticFace","path":"eval/verification.py","file_url":"https://github.com/fdbtrs/ElasticFace/blob/HEAD/eval/verification.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fdbtrs/ElasticFace when it was checked","code_sha256":"075d6cd5e0436c87","code_sha256_prefix":"075d6cd5e0436c87","mcp_get_code":{"code_sha256":"075d6cd5e0436c87"}},{"arxiv_id":"2105.04714","arxiv_id_is_arxiv":true,"paper":"/paper/sample-and-computation-redistribution-for","title":"Sample and Computation Redistribution for Efficient Face Detection","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aralhekimoglu/face","path":"recognition/oneflow_face/validation_util.py","file_url":"https://github.com/aralhekimoglu/face/blob/HEAD/recognition/oneflow_face/validation_util.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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 linghu8812/pytorch_insightface, and GitHub detected no licence in that repository when it was checked","code_sha256":"5f529c4af000c070","code_sha256_prefix":"5f529c4af000c070","mcp_get_code":{"code_sha256":"5f529c4af000c070"}},{"arxiv_id":"2103.14803","arxiv_id_is_arxiv":true,"paper":"/paper/2103-14803","title":"Face Transformer for Recognition","date":"2021-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyy/Face-Transformer","path":"util/verification.py","file_url":"https://github.com/zhongyy/Face-Transformer/blob/HEAD/util/verification.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":"508a8168bc7cb3cc","code_sha256_prefix":"508a8168bc7cb3cc","mcp_get_code":{"code_sha256":"508a8168bc7cb3cc"}},{"arxiv_id":"2004.01461","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-centralization-a-new-optimization","title":"Gradient Centralization: A New Optimization Technique for Deep Neural Networks","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HamadYA/GhostFaceNets","path":"evals.py","file_url":"https://github.com/HamadYA/GhostFaceNets/blob/HEAD/evals.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":"c3af5327e1b4e163","code_sha256_prefix":"c3af5327e1b4e163","mcp_get_code":{"code_sha256":"c3af5327e1b4e163"}},{"arxiv_id":"2004.00288","arxiv_id_is_arxiv":true,"paper":"/paper/curricularface-adaptive-curriculum-learning","title":"CurricularFace: Adaptive Curriculum Learning Loss for Deep Face Recognition","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HuangYG123/CurricularFace","path":"util/verification.py","file_url":"https://github.com/HuangYG123/CurricularFace/blob/HEAD/util/verification.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":"5f5160da896b0198","code_sha256_prefix":"5f5160da896b0198","mcp_get_code":{"code_sha256":"5f5160da896b0198"}},{"arxiv_id":"1804.07573","arxiv_id_is_arxiv":true,"paper":"/paper/mobilefacenets-efficient-cnns-for-accurate","title":"MobileFaceNets: Efficient CNNs for Accurate Real-Time Face Verification on Mobile Devices","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrui94/insight_mx","path":"src/eval/verification.py","file_url":"https://github.com/zrui94/insight_mx/blob/HEAD/src/eval/verification.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zrui94/insight_mx when it was checked","code_sha256":"db4008738f6c3eae","code_sha256_prefix":"db4008738f6c3eae","mcp_get_code":{"code_sha256":"db4008738f6c3eae"}},{"arxiv_id":"1801.07698","arxiv_id_is_arxiv":true,"paper":"/paper/arcface-additive-angular-margin-loss-for-deep","title":"ArcFace: Additive Angular Margin Loss for Deep Face Recognition","date":"2018-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"db4008738f6c3eae","code_sha256_prefix":"db4008738f6c3eae","mcp_get_code":{"code_sha256":"db4008738f6c3eae"}},{"arxiv_id":"1801.07698","arxiv_id_is_arxiv":true,"paper":"/paper/arcface-additive-angular-margin-loss-for-deep","title":"ArcFace: Additive Angular Margin Loss for Deep Face Recognition","date":"2018-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmonterom/face_recognition_TF2","path":"evaluation.py","file_url":"https://github.com/dmonterom/face_recognition_TF2/blob/HEAD/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dmonterom/face_recognition_TF2 when it was checked","code_sha256":"64b45da43b8ab573","code_sha256_prefix":"64b45da43b8ab573","mcp_get_code":{"code_sha256":"64b45da43b8ab573"}},{"arxiv_id":"1801.07698","arxiv_id_is_arxiv":true,"paper":"/paper/arcface-additive-angular-margin-loss-for-deep","title":"ArcFace: Additive Angular Margin Loss for Deep Face Recognition","date":"2018-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linghu8812/pytorch_insightface","path":"verification.py","file_url":"https://github.com/linghu8812/pytorch_insightface/blob/HEAD/verification.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, linghu8812/pytorch_insightface when it was checked","code_sha256":"5f529c4af000c070","code_sha256_prefix":"5f529c4af000c070","mcp_get_code":{"code_sha256":"5f529c4af000c070"}},{"arxiv_id":"1710.08092","arxiv_id_is_arxiv":true,"paper":"/paper/vggface2-a-dataset-for-recognising-faces","title":"VGGFace2: A dataset for recognising faces across pose and age","date":"2017-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"db4008738f6c3eae","code_sha256_prefix":"db4008738f6c3eae","mcp_get_code":{"code_sha256":"db4008738f6c3eae"}},{"arxiv_id":"1705.02304","arxiv_id_is_arxiv":true,"paper":"/paper/deep-speaker-an-end-to-end-neural-speaker","title":"Deep Speaker: an End-to-End Neural Speaker Embedding System","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qqueing/DeepSpeaker-pytorch","path":"eval_metrics.py","file_url":"https://github.com/qqueing/DeepSpeaker-pytorch/blob/HEAD/eval_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"625877b8d181dc24","code_sha256_prefix":"625877b8d181dc24","mcp_get_code":{"code_sha256":"625877b8d181dc24"}},{"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":"tbmoon/facenet","path":"eval_metrics.py","file_url":"https://github.com/tbmoon/facenet/blob/HEAD/eval_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":"ecb40e2478acb33f","code_sha256_prefix":"ecb40e2478acb33f","mcp_get_code":{"code_sha256":"ecb40e2478acb33f"}},{"arxiv_id":"1607.08221","arxiv_id_is_arxiv":true,"paper":"/paper/ms-celeb-1m-a-dataset-and-benchmark-for-large","title":"MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognition","date":"2016-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"db4008738f6c3eae","code_sha256_prefix":"db4008738f6c3eae","mcp_get_code":{"code_sha256":"db4008738f6c3eae"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LKLQQ/FaceNet","path":"src/eval_metrics.py","file_url":"https://github.com/LKLQQ/FaceNet/blob/HEAD/src/eval_metrics.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":"ecb40e2478acb33f","code_sha256_prefix":"ecb40e2478acb33f","mcp_get_code":{"code_sha256":"ecb40e2478acb33f"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"altndrr/persona","path":"src/utils/lfw.py","file_url":"https://github.com/altndrr/persona/blob/HEAD/src/utils/lfw.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":"198671905cf83bac","code_sha256_prefix":"198671905cf83bac","mcp_get_code":{"code_sha256":"198671905cf83bac"}},{"arxiv_id":"aaai_26699","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26699","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fuenwang/MixFairFace","path":"MixFairFace/Verify/RFW.py","file_url":"https://github.com/fuenwang/MixFairFace/blob/HEAD/MixFairFace/Verify/RFW.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":"c3af5327e1b4e163","code_sha256_prefix":"c3af5327e1b4e163","mcp_get_code":{"code_sha256":"c3af5327e1b4e163"}}],"record_sha256":"2b782ba1170d9993cde63150ccff6f6faa8119445bc687eade53b0de37787f38","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}