{"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/normalize-fn","entry":"normalize_fn","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":3,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":6,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2607.14921","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14921","title":"Random Logit Scaling: Defending Deep Neural Networks Against Black-Box Score-Based Adversarial Example Attacks","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HamidDasht/RLS-adversarial-defense","path":"utils/model_loader.py","file_url":"https://github.com/HamidDasht/RLS-adversarial-defense/blob/HEAD/utils/model_loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa397a3a5c14b31a","code_sha256_prefix":"aa397a3a5c14b31a","mcp_get_code":{"code_sha256":"aa397a3a5c14b31a"}},{"arxiv_id":"2408.01978","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01978","title":"AdvQDet: Detecting Query-Based Adversarial Attacks with Adversarial Contrastive Prompt Tuning","date":"2024-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinwong/advqdet","path":"acpt/utils.py","file_url":"https://github.com/xinwong/advqdet/blob/HEAD/acpt/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xinwong/advqdet when it was checked","code_sha256":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}},{"arxiv_id":"2406.05927","arxiv_id_is_arxiv":true,"paper":"/paper/meansparse-post-training-robustness","title":"MeanSparse: Post-Training Robustness Enhancement Through Mean-Centered Feature Sparsification","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spin-umass/meansparse","path":"CIFAR10_Linfinity/RaWRN-70-16/MeanSparse_robustarch_wide_resnet.py","file_url":"https://github.com/spin-umass/meansparse/blob/HEAD/CIFAR10_Linfinity/RaWRN-70-16/MeanSparse_robustarch_wide_resnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, spin-umass/meansparse when it was checked","code_sha256":"0e0f66ffb7a61530","code_sha256_prefix":"0e0f66ffb7a61530","mcp_get_code":{"code_sha256":"0e0f66ffb7a61530"}},{"arxiv_id":"2310.18274","arxiv_id_is_arxiv":true,"paper":"/paper/lipsim-a-provably-robust-perceptual","title":"LipSim: A Provably Robust Perceptual Similarity Metric","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saraghazanfari/lipsim","path":"lipsim/core/attack/ssa_attack.py","file_url":"https://github.com/saraghazanfari/lipsim/blob/HEAD/lipsim/core/attack/ssa_attack.py","status":"ran","verification_level":1,"contract_check":null,"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, saraghazanfari/lipsim when it was checked","code_sha256":"d0667bab2c0d4bd8","code_sha256_prefix":"d0667bab2c0d4bd8","mcp_get_code":{"code_sha256":"d0667bab2c0d4bd8"}},{"arxiv_id":"2310.17622","arxiv_id_is_arxiv":true,"paper":"/paper/combating-representation-learning-disparity-1","title":"Combating Representation Learning Disparity with Geometric Harmonization","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MediaBrain-SJTU/Geometric-Harmonization","path":"resnet.py","file_url":"https://github.com/MediaBrain-SJTU/Geometric-Harmonization/blob/HEAD/resnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 spin-umass/meansparse, and GitHub detected no licence in that repository when it was checked","code_sha256":"0e0f66ffb7a61530","code_sha256_prefix":"0e0f66ffb7a61530","mcp_get_code":{"code_sha256":"0e0f66ffb7a61530"}},{"arxiv_id":"2304.04620","arxiv_id_is_arxiv":true,"paper":"/paper/federated-incremental-semantic-segmentation","title":"Federated Incremental Semantic Segmentation","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiahuaDong/FISS","path":"utils/regularizer.py","file_url":"https://github.com/JiahuaDong/FISS/blob/HEAD/utils/regularizer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JiahuaDong/FISS when it was checked","code_sha256":"de93092939935cb0","code_sha256_prefix":"de93092939935cb0","mcp_get_code":{"code_sha256":"de93092939935cb0"}},{"arxiv_id":"2207.10899","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-adversarial-contrastive-learning","title":"Decoupled Adversarial Contrastive Learning for Self-supervised Adversarial Robustness","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}},{"arxiv_id":"2012.05434","arxiv_id_is_arxiv":true,"paper":"/paper/composite-adversarial-attacks","title":"Composite Adversarial Attacks","date":"2020-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vtddggg/CAA","path":"test_attacker.py","file_url":"https://github.com/vtddggg/CAA/blob/HEAD/test_attacker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}},{"arxiv_id":"2010.09080","arxiv_id_is_arxiv":true,"paper":"/paper/poisoned-classifiers-are-not-only-backdoored-1","title":"Poisoned classifiers are not only backdoored, they are fundamentally broken","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/breaking-poisoned-classifier","path":"code/badnet/alexnet_fc7out.py","file_url":"https://github.com/locuslab/breaking-poisoned-classifier/blob/HEAD/code/badnet/alexnet_fc7out.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}},{"arxiv_id":"2007.09271","arxiv_id_is_arxiv":true,"paper":"/paper/onlineaugment-online-data-augmentation-with","title":"OnlineAugment: Online Data Augmentation with Less Domain Knowledge","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqiangdon/online-augment","path":"models/normalize_mean_std.py","file_url":"https://github.com/zhiqiangdon/online-augment/blob/HEAD/models/normalize_mean_std.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}},{"arxiv_id":"1910.00033","arxiv_id_is_arxiv":true,"paper":"/paper/hidden-trigger-backdoor-attacks","title":"Hidden Trigger Backdoor Attacks","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UMBCvision/Hidden-Trigger-Backdoor-Attacks","path":"alexnet_fc7out.py","file_url":"https://github.com/UMBCvision/Hidden-Trigger-Backdoor-Attacks/blob/HEAD/alexnet_fc7out.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8bc8b691d2e94f84","code_sha256_prefix":"8bc8b691d2e94f84","mcp_get_code":{"code_sha256":"8bc8b691d2e94f84"}}],"record_sha256":"28d1c6908bfaf3681012333d91d0e0dd6387812c32c8be993d96c58f9bee1353","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}