{"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/next-power-of-2","entry":"next_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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":0,"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":"2505.13430","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-quantized-neural-networks-with","title":"Fine-tuning Quantized Neural Networks with Zeroth-order Optimization","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maifoundations/qzo","path":"large_language_models/aqlm_inference_kernel/triton_kernel_dequant.py","file_url":"https://github.com/maifoundations/qzo/blob/HEAD/large_language_models/aqlm_inference_kernel/triton_kernel_dequant.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":"9782bd07382e951c","code_sha256_prefix":"9782bd07382e951c","mcp_get_code":{"code_sha256":"9782bd07382e951c"}},{"arxiv_id":"2407.13974","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-for-remote-physiological","title":"Continual Learning for Remote Physiological Measurement: Minimize Forgetting and Simplify Inference","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MayYoY/rPPGDIL","path":"evaluate/postprocess.py","file_url":"https://github.com/MayYoY/rPPGDIL/blob/HEAD/evaluate/postprocess.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning, and GitHub detected no licence in that repository when it was checked","code_sha256":"c9fc8e4585882848","code_sha256_prefix":"c9fc8e4585882848","mcp_get_code":{"code_sha256":"c9fc8e4585882848"}},{"arxiv_id":"2405.14852","arxiv_id_is_arxiv":true,"paper":"/paper/pv-tuning-beyond-straight-through-estimation","title":"PV-Tuning: Beyond Straight-Through Estimation for Extreme LLM Compression","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vahe1994/aqlm","path":"inference_lib/src/aqlm/inference_kernels/triton_kernel.py","file_url":"https://github.com/vahe1994/aqlm/blob/HEAD/inference_lib/src/aqlm/inference_kernels/triton_kernel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9782bd07382e951c","code_sha256_prefix":"9782bd07382e951c","mcp_get_code":{"code_sha256":"9782bd07382e951c"}},{"arxiv_id":"2405.08363","arxiv_id_is_arxiv":true,"paper":"/paper/unmarker-a-universal-attack-on-defensive","title":"UnMarker: A Universal Attack on Defensive Image Watermarking","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrekassis/ai-watermark","path":"modules/attack/diffusion/diffusion_attack.py","file_url":"https://github.com/andrekassis/ai-watermark/blob/HEAD/modules/attack/diffusion/diffusion_attack.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, andrekassis/ai-watermark when it was checked","code_sha256":"c9fc8e4585882848","code_sha256_prefix":"c9fc8e4585882848","mcp_get_code":{"code_sha256":"c9fc8e4585882848"}},{"arxiv_id":"2309.15812","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-networks-with-oriented-1d-1","title":"Convolutional Networks with Oriented 1D Kernels","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/oriented1d","path":"models/dwoconv1d/dwoconv1d.py","file_url":"https://github.com/princeton-vl/oriented1d/blob/HEAD/models/dwoconv1d/dwoconv1d.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":"7ed144fc94a8a372","code_sha256_prefix":"7ed144fc94a8a372","mcp_get_code":{"code_sha256":"7ed144fc94a8a372"}},{"arxiv_id":"2208.14571","arxiv_id_is_arxiv":true,"paper":"/paper/truncated-matrix-power-iteration-for","title":"Truncated Matrix Power Iteration for Differentiable DAG Learning","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning","path":"dag/tmpi.py","file_url":"https://github.com/zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning/blob/HEAD/dag/tmpi.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning when it was checked","code_sha256":"c9fc8e4585882848","code_sha256_prefix":"c9fc8e4585882848","mcp_get_code":{"code_sha256":"c9fc8e4585882848"}},{"arxiv_id":"2208.14571","arxiv_id_is_arxiv":true,"paper":"/paper/truncated-matrix-power-iteration-for","title":"Truncated Matrix Power Iteration for Differentiable DAG Learning","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning","path":"dag/tmpi.py","file_url":"https://github.com/zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning/blob/HEAD/dag/tmpi.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zzhang1987/truncated-matrix-power-iteration-for-differentiable-dag-learning when it was checked","code_sha256":"931e413aa2667826","code_sha256_prefix":"931e413aa2667826","mcp_get_code":{"code_sha256":"931e413aa2667826"}},{"arxiv_id":"2203.09893","arxiv_id_is_arxiv":true,"paper":"/paper/a-lightweight-instrument-agnostic-model-for","title":"A Lightweight Instrument-Agnostic Model for Polyphonic Note Transcription and Multipitch Estimation","date":"2022-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spotify/basic-pitch","path":"basic_pitch/layers/nnaudio.py","file_url":"https://github.com/spotify/basic-pitch/blob/HEAD/basic_pitch/layers/nnaudio.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44c2b26e93e92ea6","code_sha256_prefix":"44c2b26e93e92ea6","mcp_get_code":{"code_sha256":"44c2b26e93e92ea6"}}],"record_sha256":"3831b40a6d859154c4a66718cbb8d68c29f9c0dba3469559eed3014446e26994","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}