{"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/build-norm","entry":"build_norm","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":5,"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":2,"ran_fixture":0,"ran":2,"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":"2604.22826","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22826","title":"Shape: A Self-Supervised 3D Geometry Foundation Model for Industrial CAD Analysis","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"simd-ai/shape","path":"shape_foundation/models/gaot_backbone.py","file_url":"https://github.com/simd-ai/shape/blob/HEAD/shape_foundation/models/gaot_backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e8414eff8669ce6","code_sha256_prefix":"1e8414eff8669ce6","mcp_get_code":{"code_sha256":"1e8414eff8669ce6"}},{"arxiv_id":"2602.04669","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04669","title":"Delving into Muon and Beyond: Deep Analysis and Extensions","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Ocram7/BeyondMuon","path":"model.py","file_url":"https://github.com/Ocram7/BeyondMuon/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee769a4ab47b0aca","code_sha256_prefix":"ee769a4ab47b0aca","mcp_get_code":{"code_sha256":"ee769a4ab47b0aca"}},{"arxiv_id":"2410.10733","arxiv_id_is_arxiv":true,"paper":"/paper/deep-compression-autoencoder-for-efficient","title":"Deep Compression Autoencoder for Efficient High-Resolution Diffusion Models","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/efficientvit","path":"efficientvit/models/efficientvit/dc_ae.py","file_url":"https://github.com/mit-han-lab/efficientvit/blob/HEAD/efficientvit/models/efficientvit/dc_ae.py","status":"unverified","verification_level":0,"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":"71068d4faddfa7bb","code_sha256_prefix":"71068d4faddfa7bb","mcp_get_code":{"code_sha256":"71068d4faddfa7bb"}},{"arxiv_id":"2007.11622","arxiv_id_is_arxiv":true,"paper":"/paper/tiny-transfer-learning-towards-memory","title":"TinyTL: Reduce Activations, Not Trainable Parameters for Efficient On-Device Learning","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/tinyML","path":"netaug/models/base/layers.py","file_url":"https://github.com/mit-han-lab/tinyML/blob/HEAD/netaug/models/base/layers.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":"c30d44c8efdb7774","code_sha256_prefix":"c30d44c8efdb7774","mcp_get_code":{"code_sha256":"c30d44c8efdb7774"}},{"arxiv_id":"1809.07454","arxiv_id_is_arxiv":true,"paper":"/paper/tasnet-surpassing-ideal-time-frequency","title":"Conv-TasNet: Surpassing Ideal Time-Frequency Magnitude Masking for Speech Separation","date":"2018-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"funcwj/conv-tasnet","path":"nnet/conv_tas_net.py","file_url":"https://github.com/funcwj/conv-tasnet/blob/HEAD/nnet/conv_tas_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":"cc51e06c5fd96123","code_sha256_prefix":"cc51e06c5fd96123","mcp_get_code":{"code_sha256":"cc51e06c5fd96123"}}],"record_sha256":"c856c680f64b9005d89813e3622a0c01b9ab8cd66959dbcac634c335a7874d96","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}