{"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/round-pass","entry":"round_pass","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":2,"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":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":13,"n_places_pointer_only":13,"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":1,"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":"2501.13492","arxiv_id_is_arxiv":true,"paper":"/paper/quantized-spike-driven-transformer","title":"Quantized Spike-driven Transformer","date":"2025-01-23","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":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":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}},{"arxiv_id":"2407.20708","arxiv_id_is_arxiv":true,"paper":"/paper/integer-valued-training-and-spike-driven","title":"Integer-Valued Training and Spike-Driven Inference Spiking Neural Network for High-performance and Energy-efficient Object Detection","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biclab/spikeyolo","path":"SpikeYOLO_for_Gen1/_quan_base_plus.py","file_url":"https://github.com/biclab/spikeyolo/blob/HEAD/SpikeYOLO_for_Gen1/_quan_base_plus.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, biclab/spikeyolo, is not in the permissive set Syntology serves inline","code_sha256":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}},{"arxiv_id":"2406.03470","arxiv_id_is_arxiv":true,"paper":"/paper/spikezip-tf-conversion-is-all-you-need-for","title":"SpikeZIP-TF: Conversion is All You Need for Transformer-based SNN","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Intelligent-Computing-Research-Group/SpikeZIP-TF","path":"spike_quan_layer.py","file_url":"https://github.com/Intelligent-Computing-Research-Group/SpikeZIP-TF/blob/HEAD/spike_quan_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Intelligent-Computing-Research-Group/SpikeZIP-TF when it was checked","code_sha256":"ed1a69e092272dba","code_sha256_prefix":"ed1a69e092272dba","mcp_get_code":{"code_sha256":"ed1a69e092272dba"}},{"arxiv_id":"2404.05662","arxiv_id_is_arxiv":true,"paper":"/paper/binarydm-towards-accurate-binarization-of","title":"BinaryDM: Accurate Weight Binarization for Efficient Diffusion Models","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingyu-zheng/binarydm","path":"ours_util.py","file_url":"https://github.com/xingyu-zheng/binarydm/blob/HEAD/ours_util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xingyu-zheng/binarydm when it was checked","code_sha256":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}},{"arxiv_id":"2302.02210","arxiv_id_is_arxiv":true,"paper":"/paper/oscillation-free-quantization-for-low-bit","title":"Oscillation-free Quantization for Low-bit Vision Transformers","date":"2023-02-04","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":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":"ed1a69e092272dba","code_sha256_prefix":"ed1a69e092272dba","mcp_get_code":{"code_sha256":"ed1a69e092272dba"}},{"arxiv_id":"2203.08368","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-precision-neural-network-quantization","title":"Mixed-Precision Neural Network Quantization via Learned Layer-wise Importance","date":"2022-03-16","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":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":"ed1a69e092272dba","code_sha256_prefix":"ed1a69e092272dba","mcp_get_code":{"code_sha256":"ed1a69e092272dba"}},{"arxiv_id":"2201.07703","arxiv_id_is_arxiv":true,"paper":"/paper/q-vit-fully-differentiable-quantization-for","title":"Q-ViT: Fully Differentiable Quantization for Vision Transformer","date":"2022-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhexinli/Q-ViT-DeiT","path":"quantization/lsq_layer.py","file_url":"https://github.com/zhexinli/Q-ViT-DeiT/blob/HEAD/quantization/lsq_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, zhexinli/Q-ViT-DeiT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}},{"arxiv_id":"2103.12369","arxiv_id_is_arxiv":true,"paper":"/paper/recu-reviving-the-dead-weights-in-binary","title":"ReCU: Reviving the Dead Weights in Binary Neural Networks","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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":"5111a3243a80feb0","code_sha256_prefix":"5111a3243a80feb0","mcp_get_code":{"code_sha256":"5111a3243a80feb0"}},{"arxiv_id":"2004.09576","arxiv_id_is_arxiv":true,"paper":"/paper/lsq-improving-low-bit-quantization-through","title":"LSQ+: Improving low-bit quantization through learnable offsets and better initialization","date":"2020-04-20","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":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":"ed1a69e092272dba","code_sha256_prefix":"ed1a69e092272dba","mcp_get_code":{"code_sha256":"ed1a69e092272dba"}},{"arxiv_id":"2003.03488","arxiv_id_is_arxiv":true,"paper":"/paper/reactnet-towards-precise-binary-neural","title":"ReActNet: Towards Precise Binary Neural Network with Generalized Activation Functions","date":"2020-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevetsui/rebnn","path":"2_step2_rebnn/rebnn.py","file_url":"https://github.com/stevetsui/rebnn/blob/HEAD/2_step2_rebnn/rebnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stevetsui/rebnn when it was checked","code_sha256":"5111a3243a80feb0","code_sha256_prefix":"5111a3243a80feb0","mcp_get_code":{"code_sha256":"5111a3243a80feb0"}},{"arxiv_id":"1902.08153","arxiv_id_is_arxiv":true,"paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiyoonkm/columnquant","path":"LSQ.py","file_url":"https://github.com/jiyoonkm/columnquant/blob/HEAD/LSQ.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiyoonkm/columnquant when it was checked","code_sha256":"ed1a69e092272dba","code_sha256_prefix":"ed1a69e092272dba","mcp_get_code":{"code_sha256":"ed1a69e092272dba"}},{"arxiv_id":"1902.08153","arxiv_id_is_arxiv":true,"paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hustzxd/LSQuantization","path":"lsq.py","file_url":"https://github.com/hustzxd/LSQuantization/blob/HEAD/lsq.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hustzxd/LSQuantization when it was checked","code_sha256":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}},{"arxiv_id":"aaai_28109","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28109","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YanjingLi0202/Bi-ViT","path":"_binary_base_plus.py","file_url":"https://github.com/YanjingLi0202/Bi-ViT/blob/HEAD/_binary_base_plus.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 hustzxd/LSQuantization, and GitHub detected no licence in that repository when it was checked","code_sha256":"40027e5e78ca8837","code_sha256_prefix":"40027e5e78ca8837","mcp_get_code":{"code_sha256":"40027e5e78ca8837"}}],"record_sha256":"e8ca9bff6d8bee5da836e85e4f45c4e0cd0a7604b2139570bb02aa3e52e294bb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}