{"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/sizeof-fmt","entry":"sizeof_fmt","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":5,"ran_fixture":0,"ran":1,"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":"2411.12537","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, automl/unlocking_state_tracking when it was checked","code_sha256":"0292a5d351b11c64","code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2411.12537","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, automl/unlocking_state_tracking when it was checked","code_sha256":"f5a04c30a95f92b6","code_sha256_prefix":"f5a04c30a95f92b6","mcp_get_code":{"code_sha256":"f5a04c30a95f92b6"}},{"arxiv_id":"2408.06277","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YunyiShen/SBIRR when it was checked","code_sha256":"8924c0af3b27df7b","code_sha256_prefix":"8924c0af3b27df7b","mcp_get_code":{"code_sha256":"8924c0af3b27df7b"}},{"arxiv_id":"2406.06484","arxiv_id_is_arxiv":true,"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,"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":"0292a5d351b11c64","code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2312.06635","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0292a5d351b11c64","code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"2203.13278","arxiv_id_is_arxiv":true,"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":"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":"8e2cdf074541b1a3","code_sha256_prefix":"8e2cdf074541b1a3","mcp_get_code":{"code_sha256":"8e2cdf074541b1a3"}},{"arxiv_id":"2106.02081","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 YunyiShen/SBIRR, and GitHub detected no licence in that repository when it was checked","code_sha256":"8924c0af3b27df7b","code_sha256_prefix":"8924c0af3b27df7b","mcp_get_code":{"code_sha256":"8924c0af3b27df7b"}},{"arxiv_id":"2103.14006","arxiv_id_is_arxiv":true,"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":"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":"8e2cdf074541b1a3","code_sha256_prefix":"8e2cdf074541b1a3","mcp_get_code":{"code_sha256":"8e2cdf074541b1a3"}},{"arxiv_id":"2004.12832","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61e01e539c37a709","code_sha256_prefix":"61e01e539c37a709","mcp_get_code":{"code_sha256":"61e01e539c37a709"}},{"arxiv_id":"1911.03584","arxiv_id_is_arxiv":true,"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":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 GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data, and GitHub detected no licence in that repository when it was checked","code_sha256":"b6bef72aa7ff57a5","code_sha256_prefix":"b6bef72aa7ff57a5","mcp_get_code":{"code_sha256":"b6bef72aa7ff57a5"}},{"arxiv_id":"1905.05583","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data when it was checked","code_sha256":"b6bef72aa7ff57a5","code_sha256_prefix":"b6bef72aa7ff57a5","mcp_get_code":{"code_sha256":"b6bef72aa7ff57a5"}},{"arxiv_id":"openreview_WsNpCXq6SG","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0292a5d351b11c64","code_sha256_prefix":"0292a5d351b11c64","mcp_get_code":{"code_sha256":"0292a5d351b11c64"}},{"arxiv_id":"openreview_WsNpCXq6SG","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id 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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 automl/unlocking_state_tracking, and GitHub detected no licence in that repository when it was checked","code_sha256":"f5a04c30a95f92b6","code_sha256_prefix":"f5a04c30a95f92b6","mcp_get_code":{"code_sha256":"f5a04c30a95f92b6"}}],"record_sha256":"2a6e4d04289ab48a86653a688a388bab103ea679c88195c94ecd5a3d3e0d37fd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}