{"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/hard-shrink-relu","entry":"hard_shrink_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":6,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":6,"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":4,"unverified":1},"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":"2307.00755","arxiv_id_is_arxiv":true,"paper":"/paper/graph-level-anomaly-detection-via","title":"Graph-level Anomaly Detection via Hierarchical Memory Networks","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niuchx/himnet","path":"GCN_embedding.py","file_url":"https://github.com/niuchx/himnet/blob/HEAD/GCN_embedding.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":"2ec8df88ec229583","code_sha256_prefix":"2ec8df88ec229583","mcp_get_code":{"code_sha256":"2ec8df88ec229583"}},{"arxiv_id":"2111.13495","arxiv_id_is_arxiv":true,"paper":"/paper/in-painting-radiography-images-for","title":"SQUID: Deep Feature In-Painting for Unsupervised Anomaly Detection","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiangexiang/squid","path":"models/memory.py","file_url":"https://github.com/tiangexiang/squid/blob/HEAD/models/memory.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":"3a7e6b79fae3b99d","code_sha256_prefix":"3a7e6b79fae3b99d","mcp_get_code":{"code_sha256":"3a7e6b79fae3b99d"}},{"arxiv_id":"2108.06852","arxiv_id_is_arxiv":true,"paper":"/paper/a-hybrid-video-anomaly-detection-framework","title":"A Hybrid Video Anomaly Detection Framework via Memory-Augmented Flow Reconstruction and Flow-Guided Frame Prediction","date":"2021-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiUzHiAn/hf2vad","path":"models/ml_memAE_sc.py","file_url":"https://github.com/LiUzHiAn/hf2vad/blob/HEAD/models/ml_memAE_sc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22ed0e6535db75a1","code_sha256_prefix":"22ed0e6535db75a1","mcp_get_code":{"code_sha256":"22ed0e6535db75a1"}},{"arxiv_id":"1904.02639","arxiv_id_is_arxiv":true,"paper":"/paper/memorizing-normality-to-detect-anomaly-memory","title":"Memorizing Normality to Detect Anomaly: Memory-augmented Deep Autoencoder for Unsupervised Anomaly Detection","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donggong1/memae-anomaly-detection","path":"models/memory_module.py","file_url":"https://github.com/donggong1/memae-anomaly-detection/blob/HEAD/models/memory_module.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":"9a26454b2ff613bb","code_sha256_prefix":"9a26454b2ff613bb","mcp_get_code":{"code_sha256":"9a26454b2ff613bb"}},{"arxiv_id":"Ma_ReMP-AD_Retrieval-enhanced_Multi-modal_Prompt_Fusion_for_Few-Shot_Industrial_Visual_Anomaly_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ma_ReMP-AD_Retrieval-enhanced_Multi-modal_Prompt_Fusion_for_Few-Shot_Industrial_Visual_Anomaly_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cshcma/ReMP-AD","path":"modules/ICTR.py","file_url":"https://github.com/cshcma/ReMP-AD/blob/HEAD/modules/ICTR.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":"e58658d8c2b843b1","code_sha256_prefix":"e58658d8c2b843b1","mcp_get_code":{"code_sha256":"e58658d8c2b843b1"}},{"arxiv_id":"136730727","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136730727 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"louisYen/S3R","path":"anomaly/models/modules/memory_module.py","file_url":"https://github.com/louisYen/S3R/blob/HEAD/anomaly/models/modules/memory_module.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":"9a26454b2ff613bb","code_sha256_prefix":"9a26454b2ff613bb","mcp_get_code":{"code_sha256":"9a26454b2ff613bb"}}],"record_sha256":"2c2f11699110731b29904d76bfe659e393e0bd59b2ba3feb61cde6a3b52c4804","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}