{"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/noop","entry":"noop","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":13,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":16,"n_places_pointer_only":14,"n_places_pointer_only_link_open":8,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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":"2608.27831","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27831","title":"RealSWE: A Compositional Evaluation of Coding Agents under Realistic User Requests","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"sirosen/repro","path":"mypy-issues/paramspec/no_op.py","file_url":"https://github.com/sirosen/repro/blob/HEAD/mypy-issues/paramspec/no_op.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sirosen/repro when it was checked","code_sha256":"4339100997dd6812","code_sha256_prefix":"4339100997dd6812","mcp_get_code":{"code_sha256":"4339100997dd6812"}},{"arxiv_id":"2506.05982","arxiv_id_is_arxiv":true,"paper":"/paper/mca-bench-a-multimodal-benchmark-for","title":"MCA-Bench: A Multimodal Benchmark for Evaluating CAPTCHA Robustness Against VLM-based Attacks","date":"2025-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific-2/code-12","path":"Fixup-Initialization/model_build.py","file_url":"https://github.com/MindSpore-scientific-2/code-12/blob/HEAD/Fixup-Initialization/model_build.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"2407.06645","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-law-the-story-behind-data-compression","title":"Entropy Law: The Story Behind Data Compression and LLM Performance","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindCode-4/code-11","path":"Fixup-Initialization/model_build.py","file_url":"https://github.com/MindCode-4/code-11/blob/HEAD/Fixup-Initialization/model_build.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"2407.00342","arxiv_id_is_arxiv":true,"paper":"/paper/korean-aspect-based-sentiment-analysis-via","title":"KPC-cF: Aspect-Based Sentiment Analysis via Implicit-Feature Alignment with Corpus Filtering","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindCode-4/code-7","path":"Fixup-Initialization/model_build.py","file_url":"https://github.com/MindCode-4/code-7/blob/HEAD/Fixup-Initialization/model_build.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"2308.02117","arxiv_id_is_arxiv":true,"paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/vqgraph","path":"vq.py","file_url":"https://github.com/yangling0818/vqgraph/blob/HEAD/vq.py","status":"unverified","verification_level":0,"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, yangling0818/vqgraph when it was checked","code_sha256":"02dd009b7cb924bb","code_sha256_prefix":"02dd009b7cb924bb","mcp_get_code":{"code_sha256":"02dd009b7cb924bb"}},{"arxiv_id":"2212.09840","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-sparse-network-for-time-series","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QiaoXiao7282/DSN","path":"model/SCNN.py","file_url":"https://github.com/QiaoXiao7282/DSN/blob/HEAD/model/SCNN.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, QiaoXiao7282/DSN when it was checked","code_sha256":"917beac5ac21d3fe","code_sha256_prefix":"917beac5ac21d3fe","mcp_get_code":{"code_sha256":"917beac5ac21d3fe"}},{"arxiv_id":"2206.00845","arxiv_id_is_arxiv":true,"paper":"/paper/hyperspherical-consistency-regularization","title":"Hyperspherical Consistency Regularization","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nanzhaogang/contrib","path":"application/Fixup-Initialization/model_build.py","file_url":"https://github.com/nanzhaogang/contrib/blob/HEAD/application/Fixup-Initialization/model_build.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"2110.06366","arxiv_id_is_arxiv":true,"paper":"/paper/time-masking-for-temporal-language-models","title":"Time Masking for Temporal Language Models","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guyrosin/temporal_attention","path":"tokenization_utils_fast.py","file_url":"https://github.com/guyrosin/temporal_attention/blob/HEAD/tokenization_utils_fast.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7dc7a4c0ec126f86","code_sha256_prefix":"7dc7a4c0ec126f86","mcp_get_code":{"code_sha256":"7dc7a4c0ec126f86"}},{"arxiv_id":"2106.10161","arxiv_id_is_arxiv":true,"paper":"/paper/golos-russian-dataset-for-speech-research","title":"Golos: Russian Dataset for Speech Research","date":"2021-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1hb6s7t/contrib","path":"application/Fixup-Initialization/model_build.py","file_url":"https://github.com/1hb6s7t/contrib/blob/HEAD/application/Fixup-Initialization/model_build.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"2004.03497","arxiv_id_is_arxiv":true,"paper":"/paper/progen-language-modeling-for-protein","title":"ProGen: Language Modeling for Protein Generation","date":"2020-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/progen-jax","path":"progen_transformer/utils.py","file_url":"https://github.com/lucidrains/progen-jax/blob/HEAD/progen_transformer/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"1908.08681","arxiv_id_is_arxiv":true,"paper":"/paper/mish-a-self-regularized-non-monotonic-neural","title":"Mish: A Self Regularized Non-Monotonic Activation Function","date":"2019-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lessw2020/mish","path":"mxresnet.py","file_url":"https://github.com/lessw2020/mish/blob/HEAD/mxresnet.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"1906.03028","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-reparameterisation-of-probabilistic","title":"Automatic Reparameterisation of Probabilistic Programs","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mgorinova/autoreparam","path":"experiments.py","file_url":"https://github.com/mgorinova/autoreparam/blob/HEAD/experiments.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 Abhimanyu08/Fixup_Initialization, and GitHub detected no licence in that repository when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"1906.03028","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-reparameterisation-of-probabilistic","title":"Automatic Reparameterisation of Probabilistic Programs","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mgorinova/autoreparam","path":"interleaved.py","file_url":"https://github.com/mgorinova/autoreparam/blob/HEAD/interleaved.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":"aba14daf28d3175a","code_sha256_prefix":"aba14daf28d3175a","mcp_get_code":{"code_sha256":"aba14daf28d3175a"}},{"arxiv_id":"1904.05049","arxiv_id_is_arxiv":true,"paper":"/paper/drop-an-octave-reducing-spatial-redundancy-in","title":"Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks with Octave Convolution","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kk1694/octaveconv-pytorch","path":"octxresnet.py","file_url":"https://github.com/kk1694/octaveconv-pytorch/blob/HEAD/octxresnet.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, kk1694/octaveconv-pytorch when it was checked","code_sha256":"e08d9496019166da","code_sha256_prefix":"e08d9496019166da","mcp_get_code":{"code_sha256":"e08d9496019166da"}},{"arxiv_id":"1901.09321","arxiv_id_is_arxiv":true,"paper":"/paper/fixup-initialization-residual-learning","title":"Fixup Initialization: Residual Learning Without Normalization","date":"2019-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Abhimanyu08/Fixup_Initialization","path":"model_build.py","file_url":"https://github.com/Abhimanyu08/Fixup_Initialization/blob/HEAD/model_build.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, Abhimanyu08/Fixup_Initialization when it was checked","code_sha256":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","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":"5e2ed23acb71ee11","code_sha256_prefix":"5e2ed23acb71ee11","mcp_get_code":{"code_sha256":"5e2ed23acb71ee11"}}],"record_sha256":"71fc6e719fcf4cef61e95a57342d870d69bfc9692488113a09d475bcbc0b2f4e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}