{"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-pow2","entry":"is_pow2","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":4,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2605.19660","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-19660","title":"OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ZunhaiSu/OScaR-KV-Quant","path":"kv_cache_compression/quarot_utils.py","file_url":"https://github.com/ZunhaiSu/OScaR-KV-Quant/blob/HEAD/kv_cache_compression/quarot_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":"13baf68cd36c7523","code_sha256_prefix":"13baf68cd36c7523","mcp_get_code":{"code_sha256":"13baf68cd36c7523"}},{"arxiv_id":"2412.00648","arxiv_id_is_arxiv":true,"paper":"/paper/dfrot-achieving-outlier-free-and-massive","title":"DFRot: Achieving Outlier-Free and Massive Activation-Free for Rotated LLMs with Refined Rotation","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"e36d941e3a44f9df","code_sha256_prefix":"e36d941e3a44f9df","mcp_get_code":{"code_sha256":"e36d941e3a44f9df"}},{"arxiv_id":"2410.13229","arxiv_id_is_arxiv":true,"paper":"/paper/quamba-a-post-training-quantization-recipe","title":"Quamba: A Post-Training Quantization Recipe for Selective State Space Models","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enyac-group/quamba","path":"quamba/hadamard_utils.py","file_url":"https://github.com/enyac-group/quamba/blob/HEAD/quamba/hadamard_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyac-group/quamba when it was checked","code_sha256":"e36d941e3a44f9df","code_sha256_prefix":"e36d941e3a44f9df","mcp_get_code":{"code_sha256":"e36d941e3a44f9df"}},{"arxiv_id":"2404.00456","arxiv_id_is_arxiv":true,"paper":"/paper/quarot-outlier-free-4-bit-inference-in","title":"QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs","date":"2024-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingyangxiang/dfrot","path":"scripts/optimize_procrustes_alter.py","file_url":"https://github.com/jingyangxiang/dfrot/blob/HEAD/scripts/optimize_procrustes_alter.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jingyangxiang/dfrot when it was checked","code_sha256":"e36d941e3a44f9df","code_sha256_prefix":"e36d941e3a44f9df","mcp_get_code":{"code_sha256":"e36d941e3a44f9df"}},{"arxiv_id":"2402.17762","arxiv_id_is_arxiv":true,"paper":"/paper/massive-activations-in-large-language-models","title":"Massive Activations in Large Language Models","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"e36d941e3a44f9df","code_sha256_prefix":"e36d941e3a44f9df","mcp_get_code":{"code_sha256":"e36d941e3a44f9df"}},{"arxiv_id":"2312.12726","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-shape-radiance-ambiguity-in-radiance-1","title":"Reducing Shape-Radiance Ambiguity in Radiance Fields with a Closed-Form Color Estimation Method","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qihangGH/Closed-form-color-field","path":"svox2/utils.py","file_url":"https://github.com/qihangGH/Closed-form-color-field/blob/HEAD/svox2/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":"1c02c1337d08c079","code_sha256_prefix":"1c02c1337d08c079","mcp_get_code":{"code_sha256":"1c02c1337d08c079"}},{"arxiv_id":"2208.06787","arxiv_id_is_arxiv":true,"paper":"/paper/hdr-plenoxels-self-calibrating-high-dynamic","title":"HDR-Plenoxels: Self-Calibrating High Dynamic Range Radiance Fields","date":"2022-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"postech-ami/hdr-plenoxels","path":"svox2/utils.py","file_url":"https://github.com/postech-ami/hdr-plenoxels/blob/HEAD/svox2/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":"1c02c1337d08c079","code_sha256_prefix":"1c02c1337d08c079","mcp_get_code":{"code_sha256":"1c02c1337d08c079"}},{"arxiv_id":"2206.07695","arxiv_id_is_arxiv":true,"paper":"/paper/voxgraf-fast-3d-aware-image-synthesis-with","title":"VoxGRAF: Fast 3D-Aware Image Synthesis with Sparse Voxel Grids","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/voxgraf","path":"voxgraf-plenoxels/svox2/utils.py","file_url":"https://github.com/autonomousvision/voxgraf/blob/HEAD/voxgraf-plenoxels/svox2/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":"1c02c1337d08c079","code_sha256_prefix":"1c02c1337d08c079","mcp_get_code":{"code_sha256":"1c02c1337d08c079"}}],"record_sha256":"042398e87030249593fd1845da07148089b82c7c614d9981ed4cad620f58ee19","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}