{"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/is-power-of-2","entry":"is_power_of_2","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":9,"n_places_pointer_only":1,"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":4,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2510.02228","arxiv_id_is_arxiv":true,"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":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NX-AI/mlstm_kernels (NOASSERTION)","code_sha256":"78c9d83eed016b5f","code_sha256_prefix":"78c9d83eed016b5f","mcp_get_code":{"code_sha256":"78c9d83eed016b5f"}},{"arxiv_id":"2406.19298","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6523d8d6272a3cc5","code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}},{"arxiv_id":"2406.02528","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9760951c9f233ba8","code_sha256_prefix":"9760951c9f233ba8","mcp_get_code":{"code_sha256":"9760951c9f233ba8"}},{"arxiv_id":"2402.19481","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a7bd5509044f904","code_sha256_prefix":"0a7bd5509044f904","mcp_get_code":{"code_sha256":"0a7bd5509044f904"}},{"arxiv_id":"2310.10537","arxiv_id_is_arxiv":true,"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":"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":"401cf9eddca5daee","code_sha256_prefix":"401cf9eddca5daee","mcp_get_code":{"code_sha256":"401cf9eddca5daee"}},{"arxiv_id":"2306.12517","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9760951c9f233ba8","code_sha256_prefix":"9760951c9f233ba8","mcp_get_code":{"code_sha256":"9760951c9f233ba8"}},{"arxiv_id":"1902.01568","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6523d8d6272a3cc5","code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"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":"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":"ebf700690a8ac36b","code_sha256_prefix":"ebf700690a8ac36b","mcp_get_code":{"code_sha256":"ebf700690a8ac36b"}},{"arxiv_id":"1802.05983","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6523d8d6272a3cc5","code_sha256_prefix":"6523d8d6272a3cc5","mcp_get_code":{"code_sha256":"6523d8d6272a3cc5"}}],"record_sha256":"7ca2459f2c516e173082c2d89581f304910503bc1927b30839e1e5fbb21ca8da","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}