{"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/mul","entry":"mul","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":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":0,"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":0,"ran":1,"unverified":5},"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":"2507.17013","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.17013","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"laplax-org/laplax","path":"laplax/curv/ggn.py","file_url":"https://github.com/laplax-org/laplax/blob/HEAD/laplax/curv/ggn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d5fee41cbb50c3d9","code_sha256_prefix":"d5fee41cbb50c3d9","mcp_get_code":{"code_sha256":"d5fee41cbb50c3d9"}},{"arxiv_id":"2406.02924","arxiv_id_is_arxiv":true,"paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/pruner-zero","path":"lib/gptree.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/gptree.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dff0648acd37c706","code_sha256_prefix":"dff0648acd37c706","mcp_get_code":{"code_sha256":"dff0648acd37c706"}},{"arxiv_id":"2310.18285","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-federated-learning-with-group","title":"Unlocking the Potential of Prompt-Tuning in Bridging Generalized and Personalized Federated Learning","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-tea/SGPT","path":"models/vit_models_pr.py","file_url":"https://github.com/ubc-tea/SGPT/blob/HEAD/models/vit_models_pr.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":"ed12305ac7a0e8c6","code_sha256_prefix":"ed12305ac7a0e8c6","mcp_get_code":{"code_sha256":"ed12305ac7a0e8c6"}},{"arxiv_id":"2305.17190","arxiv_id_is_arxiv":true,"paper":"/paper/multiplication-free-transformer-training-via-1","title":"Multiplication-Free Transformer Training via Piecewise Affine Operations","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/piecewise-affine-multiplication","path":"pam/pam_ops.py","file_url":"https://github.com/epfml/piecewise-affine-multiplication/blob/HEAD/pam/pam_ops.py","status":"unverified","verification_level":0,"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":"85332a013577bdd1","code_sha256_prefix":"85332a013577bdd1","mcp_get_code":{"code_sha256":"85332a013577bdd1"}},{"arxiv_id":"2302.12170","arxiv_id_is_arxiv":true,"paper":"/paper/language-model-crossover-variation-through","title":"Language Model Crossover: Variation through Few-Shot Prompting","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carperai/openelm","path":"src/openelm/benchmarks/benchmark_tinygp.py","file_url":"https://github.com/carperai/openelm/blob/HEAD/src/openelm/benchmarks/benchmark_tinygp.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":"7bcf15d75988ef3a","code_sha256_prefix":"7bcf15d75988ef3a","mcp_get_code":{"code_sha256":"7bcf15d75988ef3a"}},{"arxiv_id":"2102.07818","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-to-programmable","title":"Certified Robustness to Programmable Transformations in LSTMs","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foreverzyh/certified_lstms","path":"src/ibp.py","file_url":"https://github.com/foreverzyh/certified_lstms/blob/HEAD/src/ibp.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":"fb42c3a0a1c88cb9","code_sha256_prefix":"fb42c3a0a1c88cb9","mcp_get_code":{"code_sha256":"fb42c3a0a1c88cb9"}},{"arxiv_id":"1909.00986","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-to-adversarial-word","title":"Certified Robustness to Adversarial Word Substitutions","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robinjia/certified-word-sub","path":"src/ibp.py","file_url":"https://github.com/robinjia/certified-word-sub/blob/HEAD/src/ibp.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":"32e94bdfe3f0afad","code_sha256_prefix":"32e94bdfe3f0afad","mcp_get_code":{"code_sha256":"32e94bdfe3f0afad"}},{"arxiv_id":"2023.findings-acl.42","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.42","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JHL-HUST/EIBC-IBP","path":"src/ibp.py","file_url":"https://github.com/JHL-HUST/EIBC-IBP/blob/HEAD/src/ibp.py","status":"unverified","verification_level":0,"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":"0fece5d3e06af29a","code_sha256_prefix":"0fece5d3e06af29a","mcp_get_code":{"code_sha256":"0fece5d3e06af29a"}}],"record_sha256":"44c37ee49c1e1f6ebb0c5d4b76370798f9dd82ffb960b6a3def6addf57a94a0e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}