{"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/einsum","entry":"einsum","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":6,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":3},"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":"2504.02298","arxiv_id_is_arxiv":true,"paper":"/paper/space-spike-aware-consistency-enhancement-for","title":"SPACE: SPike-Aware Consistency Enhancement for Test-Time Adaptation in Spiking Neural Networks","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanxyluo/SPACE","path":"cifar10/r11/tta_utils.py","file_url":"https://github.com/ethanxyluo/SPACE/blob/HEAD/cifar10/r11/tta_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a39998ce276324f","code_sha256_prefix":"8a39998ce276324f","mcp_get_code":{"code_sha256":"8a39998ce276324f"}},{"arxiv_id":"2404.10237","arxiv_id_is_arxiv":true,"paper":"/paper/moe-tinymed-mixture-of-experts-for-tiny","title":"Med-MoE: Mixture of Domain-Specific Experts for Lightweight Medical Vision-Language Models","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangsongtao/tinymed","path":"moe/sharded_moe.py","file_url":"https://github.com/jiangsongtao/tinymed/blob/HEAD/moe/sharded_moe.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":"97286a837fefce75","code_sha256_prefix":"97286a837fefce75","mcp_get_code":{"code_sha256":"97286a837fefce75"}},{"arxiv_id":"2402.07871","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-laws-for-fine-grained-mixture-of","title":"Scaling Laws for Fine-Grained Mixture of Experts","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-random/llm-random","path":"lizrd/core/misc.py","file_url":"https://github.com/llm-random/llm-random/blob/HEAD/lizrd/core/misc.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":"4418dc5a6351b911","code_sha256_prefix":"4418dc5a6351b911","mcp_get_code":{"code_sha256":"4418dc5a6351b911"}},{"arxiv_id":"2209.14371","arxiv_id_is_arxiv":true,"paper":"/paper/pyerrors-a-python-framework-for-error","title":"pyerrors: a python framework for error analysis of Monte Carlo data","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"fjosw/pyerrors","path":"pyerrors/linalg.py","file_url":"https://github.com/fjosw/pyerrors/blob/HEAD/pyerrors/linalg.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":"38dd090b28275033","code_sha256_prefix":"38dd090b28275033","mcp_get_code":{"code_sha256":"38dd090b28275033"}},{"arxiv_id":"1710.11417","arxiv_id_is_arxiv":true,"paper":"/paper/treeqn-and-atreec-differentiable-tree","title":"TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxwhirl/treeqn","path":"treeqn/utils/einsum.py","file_url":"https://github.com/oxwhirl/treeqn/blob/HEAD/treeqn/utils/einsum.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":"f8881023e7c02b13","code_sha256_prefix":"f8881023e7c02b13","mcp_get_code":{"code_sha256":"f8881023e7c02b13"}},{"arxiv_id":"2024.findings-emnlp.221","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.221","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiangsongtao/Med-MoE","path":"moe/sharded_moe.py","file_url":"https://github.com/jiangsongtao/Med-MoE/blob/HEAD/moe/sharded_moe.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":"97286a837fefce75","code_sha256_prefix":"97286a837fefce75","mcp_get_code":{"code_sha256":"97286a837fefce75"}}],"record_sha256":"5f35290cb79d2a5928f483198c8754b8eb0ecd33b0d728f8b8bc8df785dc8f5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}