{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/sizeof-fmt","entry":"sizeof_fmt","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":9,"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":6,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":13,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"unverified":2},"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":"2411.12537","paper":"/paper/unlocking-state-tracking-in-linear-rnns","title":"Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/unlocking_state_tracking","path":"flash-linear-attention_mod/benchmarks/benchmark_training_throughput.py","file_url":"https://github.com/automl/unlocking_state_tracking/blob/HEAD/flash-linear-attention_mod/benchmarks/benchmark_training_throughput.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2411.12537","paper":"/paper/unlocking-state-tracking-in-linear-rnns","title":"Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/unlocking_state_tracking","path":"flash-linear-attention_mod/benchmarks/benchmark_generation.py","file_url":"https://github.com/automl/unlocking_state_tracking/blob/HEAD/flash-linear-attention_mod/benchmarks/benchmark_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f5a04c30a95f92b6","mcp_get_code":{"code_sha256":"f5a04c30a95f92b6"}},{"arxiv_id":"2408.06277","paper":"/paper/multi-marginal-schrodinger-bridges-with","title":"Multi-marginal Schrödinger Bridges with Iterative Reference Refinement","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YunyiShen/SBIRR","path":"package/SBIRR/mem_utils.py","file_url":"https://github.com/YunyiShen/SBIRR/blob/HEAD/package/SBIRR/mem_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8924c0af3b27df7b","mcp_get_code":{"code_sha256":"8924c0af3b27df7b"}},{"arxiv_id":"2406.06484","paper":"/paper/parallelizing-linear-transformers-with-the","title":"Parallelizing Linear Transformers with the Delta Rule over Sequence Length","date":"2024-06-10","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,"code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2312.06635","paper":"/paper/gated-linear-attention-transformers-with","title":"Gated Linear Attention Transformers with Hardware-Efficient Training","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fla-org/flash-linear-attention","path":"benchmarks/benchmark_training_throughput.py","file_url":"https://github.com/fla-org/flash-linear-attention/blob/HEAD/benchmarks/benchmark_training_throughput.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2203.13278","paper":"/paper/practical-blind-denoising-via-swin-conv-unet","title":"Practical Blind Image Denoising via Swin-Conv-UNet and Data Synthesis","date":"2022-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszn/scunet","path":"utils/utils_googledownload.py","file_url":"https://github.com/cszn/scunet/blob/HEAD/utils/utils_googledownload.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e2cdf074541b1a3","mcp_get_code":{"code_sha256":"8e2cdf074541b1a3"}},{"arxiv_id":"2106.02081","paper":"/paper/solving-schrodinger-bridges-via-maximum","title":"Solving Schrödinger Bridges via Maximum Likelihood","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"franciscovargas/GP_Sinkhorn","path":"gp_sinkhorn/mem_utils.py","file_url":"https://github.com/franciscovargas/GP_Sinkhorn/blob/HEAD/gp_sinkhorn/mem_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8924c0af3b27df7b","mcp_get_code":{"code_sha256":"8924c0af3b27df7b"}},{"arxiv_id":"2103.14006","paper":"/paper/designing-a-practical-degradation-model-for","title":"Designing a Practical Degradation Model for Deep Blind Image Super-Resolution","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cszn/BSRGAN","path":"utils/utils_googledownload.py","file_url":"https://github.com/cszn/BSRGAN/blob/HEAD/utils/utils_googledownload.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e2cdf074541b1a3","mcp_get_code":{"code_sha256":"8e2cdf074541b1a3"}},{"arxiv_id":"2004.12832","paper":"/paper/colbert-efficient-and-effective-passage","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"littlewine/zeco2","path":"python_pipeline.py","file_url":"https://github.com/littlewine/zeco2/blob/HEAD/python_pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"61e01e539c37a709","mcp_get_code":{"code_sha256":"61e01e539c37a709"}},{"arxiv_id":"1911.03584","paper":"/paper/on-the-relationship-between-self-attention-1","title":"On the Relationship between Self-Attention and Convolutional Layers","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/attention-cnn","path":"utils/logging.py","file_url":"https://github.com/epfml/attention-cnn/blob/HEAD/utils/logging.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,"code_sha256_prefix":"b6bef72aa7ff57a5","mcp_get_code":{"code_sha256":"b6bef72aa7ff57a5"}},{"arxiv_id":"1905.05583","paper":"/paper/how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data","path":"run_hbm.py","file_url":"https://github.com/GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data/blob/HEAD/run_hbm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b6bef72aa7ff57a5","mcp_get_code":{"code_sha256":"b6bef72aa7ff57a5"}},{"arxiv_id":"openreview_WsNpCXq6SG","paper":null,"title":"arXiv:openreview_WsNpCXq6SG","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AlayaDB-AI/FiX","path":"benchmarks/benchmark_training_throughput.py","file_url":"https://github.com/AlayaDB-AI/FiX/blob/HEAD/benchmarks/benchmark_training_throughput.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"openreview_WsNpCXq6SG","paper":null,"title":"arXiv:openreview_WsNpCXq6SG","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AlayaDB-AI/FiX","path":"benchmarks/benchmark_generation.py","file_url":"https://github.com/AlayaDB-AI/FiX/blob/HEAD/benchmarks/benchmark_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5a04c30a95f92b6","mcp_get_code":{"code_sha256":"f5a04c30a95f92b6"}}]}