{"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/bernoulli","entry":"bernoulli","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":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran":3,"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":"2606.19164","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19164","title":"Essential Subspace Merging for Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"kiddo127/ESM","path":"ESM-RoBERTa/sparsify.py","file_url":"https://github.com/kiddo127/ESM/blob/HEAD/ESM-RoBERTa/sparsify.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, kiddo127/ESM when it was checked","code_sha256":"f5f78d9bf8dfb1b1","code_sha256_prefix":"f5f78d9bf8dfb1b1","mcp_get_code":{"code_sha256":"f5f78d9bf8dfb1b1"}},{"arxiv_id":"2605.23473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23473","title":"Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"lamda-bbo/MCTS-VS","path":"utils.py","file_url":"https://github.com/lamda-bbo/MCTS-VS/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, lamda-bbo/MCTS-VS when it was checked","code_sha256":"07f6cc10df3d3e1e","code_sha256_prefix":"07f6cc10df3d3e1e","mcp_get_code":{"code_sha256":"07f6cc10df3d3e1e"}},{"arxiv_id":"2406.15479","arxiv_id_is_arxiv":true,"paper":"/paper/twin-merging-dynamic-integration-of-modular","title":"Twin-Merging: Dynamic Integration of Modular Expertise in Model Merging","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LZY-the-boys/Twin-Merging","path":"discriminative/sparsify.py","file_url":"https://github.com/LZY-the-boys/Twin-Merging/blob/HEAD/discriminative/sparsify.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 kiddo127/ESM, and GitHub detected no licence in that repository when it was checked","code_sha256":"f5f78d9bf8dfb1b1","code_sha256_prefix":"f5f78d9bf8dfb1b1","mcp_get_code":{"code_sha256":"f5f78d9bf8dfb1b1"}},{"arxiv_id":"2405.14768","arxiv_id_is_arxiv":true,"paper":"/paper/wise-rethinking-the-knowledge-memory-for","title":"WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/easyedit","path":"easyeditor/models/wise/WISE.py","file_url":"https://github.com/zjunlp/easyedit/blob/HEAD/easyeditor/models/wise/WISE.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e7272686fd1e3c2","code_sha256_prefix":"7e7272686fd1e3c2","mcp_get_code":{"code_sha256":"7e7272686fd1e3c2"}},{"arxiv_id":"2312.00935","arxiv_id_is_arxiv":true,"paper":"/paper/a-theory-of-unimodal-bias-in-multimodal","title":"Understanding Unimodal Bias in Multimodal Deep Linear Networks","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedizhang/unimodal-bias","path":"MNIST/model.py","file_url":"https://github.com/yedizhang/unimodal-bias/blob/HEAD/MNIST/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, yedizhang/unimodal-bias when it was checked","code_sha256":"0106d7269de18775","code_sha256_prefix":"0106d7269de18775","mcp_get_code":{"code_sha256":"0106d7269de18775"}},{"arxiv_id":"2202.11629","arxiv_id_is_arxiv":true,"paper":"/paper/a-complete-criterion-for-value-of-information","title":"A Complete Criterion for Value of Information in Soluble Influence Diagrams","date":"2022-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causalincentives/pycid","path":"pycid/core/cpd.py","file_url":"https://github.com/causalincentives/pycid/blob/HEAD/pycid/core/cpd.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":"5282a851cb47edd3","code_sha256_prefix":"5282a851cb47edd3","mcp_get_code":{"code_sha256":"5282a851cb47edd3"}},{"arxiv_id":"2002.02869","arxiv_id_is_arxiv":true,"paper":"/paper/differential-evolution-with-reversible-linear","title":"Differential Evolution with Reversible Linear Transformations","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmtomczak/reversible-de","path":"utils/distributions.py","file_url":"https://github.com/jmtomczak/reversible-de/blob/HEAD/utils/distributions.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":"03758131287250a5","code_sha256_prefix":"03758131287250a5","mcp_get_code":{"code_sha256":"03758131287250a5"}},{"arxiv_id":"1909.01506","arxiv_id_is_arxiv":true,"paper":"/paper/prediction-consistency-curvature","title":"Prediction, Consistency, Curvature: Representation Learning for Locally-Linear Control","date":"2019-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/PCC-pytorch","path":"losses.py","file_url":"https://github.com/VinAIResearch/PCC-pytorch/blob/HEAD/losses.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":"c7b34f2178af3050","code_sha256_prefix":"c7b34f2178af3050","mcp_get_code":{"code_sha256":"c7b34f2178af3050"}}],"record_sha256":"62cc22ab2932813dd88b34bee2cfc029b4bbccdb19b48f3bd6f48163968e140c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}