{"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/to","entry":"to","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":11,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":15,"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":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"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":"2407.07564","arxiv_id_is_arxiv":true,"paper":"/paper/trainable-highly-expressive-activation","title":"Trainable Highly-expressive Activation Functions","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bgu-cs-vil/ditac","path":"ditac/utils/cpab_t.py","file_url":"https://github.com/bgu-cs-vil/ditac/blob/HEAD/ditac/utils/cpab_t.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":"c40a4a89747caf9e","code_sha256_prefix":"c40a4a89747caf9e","mcp_get_code":{"code_sha256":"c40a4a89747caf9e"}},{"arxiv_id":"2404.07846","arxiv_id_is_arxiv":true,"paper":"/paper/tbsn-transformer-based-blind-spot-network-for","title":"Rethinking Transformer-Based Blind-Spot Network for Self-Supervised Image Denoising","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nagejacob/tbsn","path":"network/base_function.py","file_url":"https://github.com/nagejacob/tbsn/blob/HEAD/network/base_function.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, nagejacob/tbsn, is not in the permissive set Syntology serves inline","code_sha256":"0bb26a83df4e7b0b","code_sha256_prefix":"0bb26a83df4e7b0b","mcp_get_code":{"code_sha256":"0bb26a83df4e7b0b"}},{"arxiv_id":"2404.03658","arxiv_id_is_arxiv":true,"paper":"/paper/know-your-neighbors-improving-single-view","title":"Know Your Neighbors: Improving Single-View Reconstruction via Spatial Vision-Language Reasoning","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruili3/Know-Your-Neighbors","path":"utils/array_operations.py","file_url":"https://github.com/ruili3/Know-Your-Neighbors/blob/HEAD/utils/array_operations.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, ruili3/Know-Your-Neighbors when it was checked","code_sha256":"3e9b5afd90a4aba3","code_sha256_prefix":"3e9b5afd90a4aba3","mcp_get_code":{"code_sha256":"3e9b5afd90a4aba3"}},{"arxiv_id":"2310.14047","arxiv_id_is_arxiv":true,"paper":"/paper/meaeq-mount-model-extraction-attacks-with","title":"MeaeQ: Mount Model Extraction Attacks with Efficient Queries","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"C-W-D/MeaeQ","path":"utils/tools.py","file_url":"https://github.com/C-W-D/MeaeQ/blob/HEAD/utils/tools.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":"0bfbcd38797df955","code_sha256_prefix":"0bfbcd38797df955","mcp_get_code":{"code_sha256":"0bfbcd38797df955"}},{"arxiv_id":"2310.11881","arxiv_id_is_arxiv":true,"paper":"/paper/a-comparative-study-of-image-restoration","title":"A Comparative Study of Image Restoration Networks for General Backbone Network Design","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrew0613/x-restormer","path":"xrestormer/archs/xrestormer_arch.py","file_url":"https://github.com/andrew0613/x-restormer/blob/HEAD/xrestormer/archs/xrestormer_arch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0bb26a83df4e7b0b","code_sha256_prefix":"0bb26a83df4e7b0b","mcp_get_code":{"code_sha256":"0bb26a83df4e7b0b"}},{"arxiv_id":"2310.02980","arxiv_id_is_arxiv":true,"paper":"/paper/never-train-from-scratch-fair-comparison-of","title":"Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idoamos/not-from-scratch","path":"local_attention/local_attention.py","file_url":"https://github.com/idoamos/not-from-scratch/blob/HEAD/local_attention/local_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f092dd8a37a00a6e","code_sha256_prefix":"f092dd8a37a00a6e","mcp_get_code":{"code_sha256":"f092dd8a37a00a6e"}},{"arxiv_id":"2306.00398","arxiv_id_is_arxiv":true,"paper":"/paper/preference-grounded-token-level-guidance-for-1","title":"Preference-grounded Token-level Guidance for Language Model Fine-tuning","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinyueqin/denserewardrlhf-ppo","path":"denserlhf/trainer/ppo_utils/experience_maker.py","file_url":"https://github.com/yinyueqin/denserewardrlhf-ppo/blob/HEAD/denserlhf/trainer/ppo_utils/experience_maker.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"938b6f55326552be","code_sha256_prefix":"938b6f55326552be","mcp_get_code":{"code_sha256":"938b6f55326552be"}},{"arxiv_id":"2303.11249","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-data-suitable-for-a-locally","title":"What Makes Data Suitable for a Locally Connected Neural Network? A Necessary and Sufficient Condition Based on Quantum Entanglement","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/local-attention","path":"local_attention/local_attention.py","file_url":"https://github.com/lucidrains/local-attention/blob/HEAD/local_attention/local_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f092dd8a37a00a6e","code_sha256_prefix":"f092dd8a37a00a6e","mcp_get_code":{"code_sha256":"f092dd8a37a00a6e"}},{"arxiv_id":"2108.12630","arxiv_id_is_arxiv":true,"paper":"/paper/groupformer-group-activity-recognition-with","title":"GroupFormer: Group Activity Recognition with Clustered Spatial-Temporal Transformer","date":"2021-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xueyee/GroupFormer","path":"group/models/cluster_transformer.py","file_url":"https://github.com/xueyee/GroupFormer/blob/HEAD/group/models/cluster_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f092dd8a37a00a6e","code_sha256_prefix":"f092dd8a37a00a6e","mcp_get_code":{"code_sha256":"f092dd8a37a00a6e"}},{"arxiv_id":"2107.11442","arxiv_id_is_arxiv":true,"paper":"/paper/compressing-neural-networks-towards","title":"Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucaslie/torchprune","path":"src/torchprune/torchprune/util/tensor.py","file_url":"https://github.com/lucaslie/torchprune/blob/HEAD/src/torchprune/torchprune/util/tensor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e32720b53dfa1acf","code_sha256_prefix":"e32720b53dfa1acf","mcp_get_code":{"code_sha256":"e32720b53dfa1acf"}},{"arxiv_id":"2103.12731","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-local-self-attention-for-parameter","title":"Scaling Local Self-Attention for Parameter Efficient Visual Backbones","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xmu-xiaoma666/External-Attention-pytorch","path":"model/attention/HaloAttention.py","file_url":"https://github.com/xmu-xiaoma666/External-Attention-pytorch/blob/HEAD/model/attention/HaloAttention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0bb26a83df4e7b0b","code_sha256_prefix":"0bb26a83df4e7b0b","mcp_get_code":{"code_sha256":"0bb26a83df4e7b0b"}},{"arxiv_id":"2002.05202","arxiv_id_is_arxiv":true,"paper":"/paper/glu-variants-improve-transformer","title":"GLU Variants Improve Transformer","date":"2020-02-12","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":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":"7417c98099ec4e15","code_sha256_prefix":"7417c98099ec4e15","mcp_get_code":{"code_sha256":"7417c98099ec4e15"}},{"arxiv_id":"1911.05507","arxiv_id_is_arxiv":true,"paper":"/paper/compressive-transformers-for-long-range-1","title":"Compressive Transformers for Long-Range Sequence Modelling","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/compressive-transformer-pytorch","path":"compressive_transformer_pytorch/compressive_transformer_pytorch.py","file_url":"https://github.com/lucidrains/compressive-transformer-pytorch/blob/HEAD/compressive_transformer_pytorch/compressive_transformer_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7417c98099ec4e15","code_sha256_prefix":"7417c98099ec4e15","mcp_get_code":{"code_sha256":"7417c98099ec4e15"}},{"arxiv_id":"1910.06764","arxiv_id_is_arxiv":true,"paper":"/paper/stabilizing-transformers-for-reinforcement-1","title":"Stabilizing Transformers for Reinforcement Learning","date":"2019-10-13","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":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":"7417c98099ec4e15","code_sha256_prefix":"7417c98099ec4e15","mcp_get_code":{"code_sha256":"7417c98099ec4e15"}},{"arxiv_id":"1812.01243","arxiv_id_is_arxiv":true,"paper":"/paper/factorized-attention-self-attention-with","title":"Efficient Attention: Attention with Linear Complexities","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/memory-transformer-xl","path":"memory_transformer_xl/memory_transformer_xl.py","file_url":"https://github.com/lucidrains/memory-transformer-xl/blob/HEAD/memory_transformer_xl/memory_transformer_xl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7417c98099ec4e15","code_sha256_prefix":"7417c98099ec4e15","mcp_get_code":{"code_sha256":"7417c98099ec4e15"}}],"record_sha256":"927a43ca72046dd853db24256ffadc5daeb33ec147af6e789469c91651c99a19","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}