{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/is-power-of-2","entry":"is_power_of_2","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":6,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2510.02228","paper":"/paper/arxiv-2510-02228","title":"xLSTM Scaling Laws: Competitive Performance with Linear Time-Complexity","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"NX-AI/mlstm_kernels","path":"mlstm_kernels/utils/kernels.py","file_url":"https://github.com/NX-AI/mlstm_kernels/blob/HEAD/mlstm_kernels/utils/kernels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"78c9d83eed016b5f","mcp_get_code":{"code_sha256":"78c9d83eed016b5f"}},{"arxiv_id":"2406.19298","paper":"/paper/compositional-image-decomposition-with","title":"Compositional Image Decomposition with Diffusion Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/Beta-VAE","path":"dataset.py","file_url":"https://github.com/1Konny/Beta-VAE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}},{"arxiv_id":"2406.02528","paper":"/paper/scalable-matmul-free-language-modeling","title":"Scalable MatMul-free Language Modeling","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ridgerchu/matmulfreellm","path":"mmfreelm/modules/feature_map.py","file_url":"https://github.com/ridgerchu/matmulfreellm/blob/HEAD/mmfreelm/modules/feature_map.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9760951c9f233ba8","mcp_get_code":{"code_sha256":"9760951c9f233ba8"}},{"arxiv_id":"2402.19481","paper":"/paper/distrifusion-distributed-parallel-inference","title":"DistriFusion: Distributed Parallel Inference for High-Resolution Diffusion Models","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/distrifuser","path":"distrifuser/utils.py","file_url":"https://github.com/mit-han-lab/distrifuser/blob/HEAD/distrifuser/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a7bd5509044f904","mcp_get_code":{"code_sha256":"0a7bd5509044f904"}},{"arxiv_id":"2310.10537","paper":"/paper/microscaling-data-formats-for-deep-learning","title":"Microscaling Data Formats for Deep Learning","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rocm/tensorcast","path":"tcast/utils.py","file_url":"https://github.com/rocm/tensorcast/blob/HEAD/tcast/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"401cf9eddca5daee","mcp_get_code":{"code_sha256":"401cf9eddca5daee"}},{"arxiv_id":"2306.12517","paper":"/paper/ffcv-accelerating-training-by-removing-data-1","title":"FFCV: Accelerating Training by Removing Data Bottlenecks","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"libffcv/ffcv","path":"ffcv/utils.py","file_url":"https://github.com/libffcv/ffcv/blob/HEAD/ffcv/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9760951c9f233ba8","mcp_get_code":{"code_sha256":"9760951c9f233ba8"}},{"arxiv_id":"1902.01568","paper":"/paper/relevance-factor-vae-learning-and-identifying","title":"Relevance Factor VAE: Learning and Identifying Disentangled Factors","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThomasMrY/RF-VAE","path":"dataset.py","file_url":"https://github.com/ThomasMrY/RF-VAE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}},{"arxiv_id":"1812.04948","paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/chainer-stylegan","path":"src/hdf5_tools/folder_to_multisize_hdf5.py","file_url":"https://github.com/pfnet-research/chainer-stylegan/blob/HEAD/src/hdf5_tools/folder_to_multisize_hdf5.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ebf700690a8ac36b","mcp_get_code":{"code_sha256":"ebf700690a8ac36b"}},{"arxiv_id":"1802.05983","paper":"/paper/disentangling-by-factorising","title":"Disentangling by Factorising","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/FactorVAE","path":"dataset.py","file_url":"https://github.com/1Konny/FactorVAE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}}]}