{"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/pack","entry":"pack","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":4,"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":"2606.26560","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-26560","title":"Erase-then-Delta Attention: Decoupling Erase and Write Addresses in Delta-Rule Linear Attention","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"QwenLM/FlashQLA","path":"flash_qla/utils/pack.py","file_url":"https://github.com/QwenLM/FlashQLA/blob/HEAD/flash_qla/utils/pack.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28c1d6470ca9d60e","code_sha256_prefix":"28c1d6470ca9d60e","mcp_get_code":{"code_sha256":"28c1d6470ca9d60e"}},{"arxiv_id":"2505.17595","arxiv_id_is_arxiv":true,"paper":"/paper/neuqi-near-optimal-uniform-quantization","title":"NeUQI: Near-Optimal Uniform Quantization Parameter Initialization","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"efsotr/NeUQI","path":"quant.py","file_url":"https://github.com/efsotr/NeUQI/blob/HEAD/quant.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, efsotr/NeUQI when it was checked","code_sha256":"fb688eae460ef923","code_sha256_prefix":"fb688eae460ef923","mcp_get_code":{"code_sha256":"fb688eae460ef923"}},{"arxiv_id":"2402.10193","arxiv_id_is_arxiv":true,"paper":"/paper/bitdelta-your-fine-tune-may-only-be-worth-one","title":"BitDelta: Your Fine-Tune May Only Be Worth One Bit","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FasterDecoding/BitDelta","path":"bitdelta/binary_gemm_kernel.py","file_url":"https://github.com/FasterDecoding/BitDelta/blob/HEAD/bitdelta/binary_gemm_kernel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3857e2268fd2be5c","code_sha256_prefix":"3857e2268fd2be5c","mcp_get_code":{"code_sha256":"3857e2268fd2be5c"}},{"arxiv_id":"2310.11239","arxiv_id_is_arxiv":true,"paper":"/paper/lidar-based-4d-occupancy-completion-and","title":"LiDAR-based 4D Occupancy Completion and Forecasting","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4ce/occ4cast","path":"data_processing/raymodel/ray_model.py","file_url":"https://github.com/ai4ce/occ4cast/blob/HEAD/data_processing/raymodel/ray_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30c3d12600120a4f","code_sha256_prefix":"30c3d12600120a4f","mcp_get_code":{"code_sha256":"30c3d12600120a4f"}},{"arxiv_id":"2310.02710","arxiv_id_is_arxiv":true,"paper":"/paper/local-search-gflownets","title":"Local Search GFlowNets","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbsxodud-11/ls_gfn","path":"gflownet/utils.py","file_url":"https://github.com/dbsxodud-11/ls_gfn/blob/HEAD/gflownet/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, dbsxodud-11/ls_gfn when it was checked","code_sha256":"1c23da6bab23ab31","code_sha256_prefix":"1c23da6bab23ab31","mcp_get_code":{"code_sha256":"1c23da6bab23ab31"}},{"arxiv_id":"2310.00386","arxiv_id_is_arxiv":true,"paper":"/paper/order-preserving-gflownets","title":"Order-Preserving GFlowNets","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhangchen/op-gfn","path":"single/GFN-Mole/gflownet/utils.py","file_url":"https://github.com/yhangchen/op-gfn/blob/HEAD/single/GFN-Mole/gflownet/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, yhangchen/op-gfn when it was checked","code_sha256":"1c23da6bab23ab31","code_sha256_prefix":"1c23da6bab23ab31","mcp_get_code":{"code_sha256":"1c23da6bab23ab31"}},{"arxiv_id":"2110.04175","arxiv_id_is_arxiv":true,"paper":"/paper/relaysum-for-decentralized-deep-learning-on","title":"RelaySum for Decentralized Deep Learning on Heterogeneous Data","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/relaysgd","path":"utils/communication.py","file_url":"https://github.com/epfml/relaysgd/blob/HEAD/utils/communication.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f96920bd7f29b071","code_sha256_prefix":"f96920bd7f29b071","mcp_get_code":{"code_sha256":"f96920bd7f29b071"}},{"arxiv_id":"2008.01425","arxiv_id_is_arxiv":true,"paper":"/paper/powergossip-practical-low-rank-communication","title":"PowerGossip: Practical Low-Rank Communication Compression in Decentralized Deep Learning","date":"2020-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"f96920bd7f29b071","code_sha256_prefix":"f96920bd7f29b071","mcp_get_code":{"code_sha256":"f96920bd7f29b071"}},{"arxiv_id":"1910.06379","arxiv_id_is_arxiv":true,"paper":"/paper/dual-path-rnn-efficient-long-sequence","title":"Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fgnt/padertorch","path":"padertorch/modules/dual_path_rnn.py","file_url":"https://github.com/fgnt/padertorch/blob/HEAD/padertorch/modules/dual_path_rnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27419265dcbf8198","code_sha256_prefix":"27419265dcbf8198","mcp_get_code":{"code_sha256":"27419265dcbf8198"}},{"arxiv_id":"1901.09458","arxiv_id_is_arxiv":true,"paper":"/paper/learning-transformation-synchronization","title":"Learning Transformation Synchronization","date":"2019-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangruhuang/Learning2Sync","path":"util.py","file_url":"https://github.com/xiangruhuang/Learning2Sync/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4bbd8bbc9476c9c0","code_sha256_prefix":"4bbd8bbc9476c9c0","mcp_get_code":{"code_sha256":"4bbd8bbc9476c9c0"}}],"record_sha256":"da9c2fd33f54d0a7911e2f6df8bab6dfa28fb58e1b30c12cad744b42d5e346ea","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}