{"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/silu","entry":"silu","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":8,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":17,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":2,"unverified":2},"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":"2505.24244","arxiv_id_is_arxiv":true,"paper":"/paper/mamba-knockout-for-unraveling-factual","title":"Mamba Knockout for Unraveling Factual Information Flow","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nirendy/mamba-knockout","path":"src/experiments/knockout/mamba/mamba2/minimal_mamba2.py","file_url":"https://github.com/nirendy/mamba-knockout/blob/HEAD/src/experiments/knockout/mamba/mamba2/minimal_mamba2.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 human9000/nd-mamba2-torch, and GitHub detected no licence in that repository when it was checked","code_sha256":"8558535d4b8ed416","code_sha256_prefix":"8558535d4b8ed416","mcp_get_code":{"code_sha256":"8558535d4b8ed416"}},{"arxiv_id":"2406.16282","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-fine-tuning-memory-overhead-by","title":"Reducing Fine-Tuning Memory Overhead by Approximate and Memory-Sharing Backpropagation","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyyyychen/LowMemoryBP","path":"search_act/plot_results.py","file_url":"https://github.com/yyyyychen/LowMemoryBP/blob/HEAD/search_act/plot_results.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df56b7b4df2b7d62","code_sha256_prefix":"df56b7b4df2b7d62","mcp_get_code":{"code_sha256":"df56b7b4df2b7d62"}},{"arxiv_id":"2406.16282","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-fine-tuning-memory-overhead-by","title":"Reducing Fine-Tuning Memory Overhead by Approximate and Memory-Sharing Backpropagation","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyyyychen/lowmemorybp","path":"search_act/sa_search.py","file_url":"https://github.com/yyyyychen/lowmemorybp/blob/HEAD/search_act/sa_search.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc28c3f7ab3434fd","code_sha256_prefix":"fc28c3f7ab3434fd","mcp_get_code":{"code_sha256":"fc28c3f7ab3434fd"}},{"arxiv_id":"2406.16282","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-fine-tuning-memory-overhead-by","title":"Reducing Fine-Tuning Memory Overhead by Approximate and Memory-Sharing Backpropagation","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyyyychen/LowMemoryBP","path":"search_act/sa_search.py","file_url":"https://github.com/yyyyychen/LowMemoryBP/blob/HEAD/search_act/sa_search.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":"fbb6daa55e3cf79c","code_sha256_prefix":"fbb6daa55e3cf79c","mcp_get_code":{"code_sha256":"fbb6daa55e3cf79c"}},{"arxiv_id":"2405.21060","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-ssms-generalized-models-and","title":"Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Duality","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tommyip/mamba2-minimal","path":"mamba2.py","file_url":"https://github.com/tommyip/mamba2-minimal/blob/HEAD/mamba2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from human9000/nd-mamba2-torch, and GitHub detected no licence in that repository when it was checked","code_sha256":"8558535d4b8ed416","code_sha256_prefix":"8558535d4b8ed416","mcp_get_code":{"code_sha256":"8558535d4b8ed416"}},{"arxiv_id":"2404.12391","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-content-bias-in-frechet-video-distance","title":"On the Content Bias in Fréchet Video Distance","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songweige/tats","path":"tats/tats_vqgan.py","file_url":"https://github.com/songweige/tats/blob/HEAD/tats/tats_vqgan.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 yyang181/colormnet, and GitHub detected no licence in that repository when it was checked","code_sha256":"a8c56a46a8cde9c8","code_sha256_prefix":"a8c56a46a8cde9c8","mcp_get_code":{"code_sha256":"a8c56a46a8cde9c8"}},{"arxiv_id":"2404.06251","arxiv_id_is_arxiv":true,"paper":"/paper/colormnet-a-memory-based-deep-spatial","title":"ColorMNet: A Memory-based Deep Spatial-Temporal Feature Propagation Network for Video Colorization","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyang181/colormnet","path":"model/network.py","file_url":"https://github.com/yyang181/colormnet/blob/HEAD/model/network.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, yyang181/colormnet when it was checked","code_sha256":"a8c56a46a8cde9c8","code_sha256_prefix":"a8c56a46a8cde9c8","mcp_get_code":{"code_sha256":"a8c56a46a8cde9c8"}},{"arxiv_id":"2312.00752","arxiv_id_is_arxiv":true,"paper":"/paper/mamba-linear-time-sequence-modeling-with","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human9000/nd-mamba2-torch","path":"torchnssd/nd_mamba2.py","file_url":"https://github.com/human9000/nd-mamba2-torch/blob/HEAD/torchnssd/nd_mamba2.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, human9000/nd-mamba2-torch when it was checked","code_sha256":"8558535d4b8ed416","code_sha256_prefix":"8558535d4b8ed416","mcp_get_code":{"code_sha256":"8558535d4b8ed416"}},{"arxiv_id":"2310.16121","arxiv_id_is_arxiv":true,"paper":"/paper/19-parameters-is-all-you-need-tiny-neural","title":"19 Parameters Is All You Need: Tiny Neural Networks for Particle Physics","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abogatskiy/PELICAN-nano","path":"src/layers/generic_layers.py","file_url":"https://github.com/abogatskiy/PELICAN-nano/blob/HEAD/src/layers/generic_layers.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":"f1b30721af3f5563","code_sha256_prefix":"f1b30721af3f5563","mcp_get_code":{"code_sha256":"f1b30721af3f5563"}},{"arxiv_id":"2211.13221","arxiv_id_is_arxiv":true,"paper":"/paper/latent-video-diffusion-models-for-high","title":"Latent Video Diffusion Models for High-Fidelity Long Video Generation","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yingqinghe/lvdm","path":"lvdm/models/modules/aemodules3d.py","file_url":"https://github.com/yingqinghe/lvdm/blob/HEAD/lvdm/models/modules/aemodules3d.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 yyang181/colormnet, and GitHub detected no licence in that repository when it was checked","code_sha256":"a8c56a46a8cde9c8","code_sha256_prefix":"a8c56a46a8cde9c8","mcp_get_code":{"code_sha256":"a8c56a46a8cde9c8"}},{"arxiv_id":"2211.00454","arxiv_id_is_arxiv":true,"paper":"/paper/pelican-permutation-equivariant-and-lorentz","title":"PELICAN: Permutation Equivariant and Lorentz Invariant or Covariant Aggregator Network for Particle Physics","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abogatskiy/pelican","path":"src/layers/generic_layers.py","file_url":"https://github.com/abogatskiy/pelican/blob/HEAD/src/layers/generic_layers.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":"f1b30721af3f5563","code_sha256_prefix":"f1b30721af3f5563","mcp_get_code":{"code_sha256":"f1b30721af3f5563"}},{"arxiv_id":"2209.00530","arxiv_id_is_arxiv":true,"paper":"/paper/holomorphic-equilibrium-propagation-computes","title":"Holomorphic Equilibrium Propagation Computes Exact Gradients Through Finite Size Oscillations","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Laborieux-Axel/holomorphic_eqprop","path":"utils/functions.py","file_url":"https://github.com/Laborieux-Axel/holomorphic_eqprop/blob/HEAD/utils/functions.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":"b438bb89cb4b14aa","code_sha256_prefix":"b438bb89cb4b14aa","mcp_get_code":{"code_sha256":"b438bb89cb4b14aa"}},{"arxiv_id":"2206.08545","arxiv_id_is_arxiv":true,"paper":"/paper/nu-wave-2-a-general-neural-audio-upsampling","title":"NU-Wave 2: A General Neural Audio Upsampling Model for Various Sampling Rates","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/NU-Wave2-pytorch","path":"model.py","file_url":"https://github.com/rishikksh20/NU-Wave2-pytorch/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9caeeced554450f","code_sha256_prefix":"d9caeeced554450f","mcp_get_code":{"code_sha256":"d9caeeced554450f"}},{"arxiv_id":"2205.14807","arxiv_id_is_arxiv":true,"paper":"/paper/binauralgrad-a-two-stage-conditional","title":"BinauralGrad: A Two-Stage Conditional Diffusion Probabilistic Model for Binaural Audio Synthesis","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/neuralspeech","path":"BinauralGrad/src/binauralgrad/model.py","file_url":"https://github.com/microsoft/neuralspeech/blob/HEAD/BinauralGrad/src/binauralgrad/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea4b5e975b1e2ba8","code_sha256_prefix":"ea4b5e975b1e2ba8","mcp_get_code":{"code_sha256":"ea4b5e975b1e2ba8"}},{"arxiv_id":"2104.02321","arxiv_id_is_arxiv":true,"paper":"/paper/nu-wave-a-diffusion-probabilistic-model-for","title":"NU-Wave: A Diffusion Probabilistic Model for Neural Audio Upsampling","date":"2021-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/NU-Wave-pytorch","path":"model.py","file_url":"https://github.com/rishikksh20/NU-Wave-pytorch/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9caeeced554450f","code_sha256_prefix":"d9caeeced554450f","mcp_get_code":{"code_sha256":"d9caeeced554450f"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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":"d9caeeced554450f","code_sha256_prefix":"d9caeeced554450f","mcp_get_code":{"code_sha256":"d9caeeced554450f"}},{"arxiv_id":"1805.12114","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-in-a-handful-of","title":"Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByMic/PETS","path":"utils/ensemble.py","file_url":"https://github.com/ByMic/PETS/blob/HEAD/utils/ensemble.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, ByMic/PETS when it was checked","code_sha256":"35f8aeec75f44df1","code_sha256_prefix":"35f8aeec75f44df1","mcp_get_code":{"code_sha256":"35f8aeec75f44df1"}}],"record_sha256":"a4b3d96b29391a209cd6b20933df68d99428ddbae608ac66dc6a6a4184932551","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}