{"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-2","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":3,"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":0,"ran":6,"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":"2410.12730","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-generative-modeling-with","title":"Counterfactual Generative Modeling with Variational Causal Inference","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yulun-rayn/variational-causal-inference","path":"vci/model/model.py","file_url":"https://github.com/yulun-rayn/variational-causal-inference/blob/HEAD/vci/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dea1f055e5384287","code_sha256_prefix":"dea1f055e5384287","mcp_get_code":{"code_sha256":"dea1f055e5384287"}},{"arxiv_id":"2402.02097","arxiv_id_is_arxiv":true,"paper":"/paper/settling-decentralized-multi-agent","title":"Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigmabm/mace","path":"src/algo/r_mappo/hdd_net.py","file_url":"https://github.com/sigmabm/mace/blob/HEAD/src/algo/r_mappo/hdd_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sigmabm/mace when it was checked","code_sha256":"e59c1d4221cf2cc6","code_sha256_prefix":"e59c1d4221cf2cc6","mcp_get_code":{"code_sha256":"e59c1d4221cf2cc6"}},{"arxiv_id":"2305.15260","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-world-models-an-online-offline","title":"Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang067/CoWorld","path":"models.py","file_url":"https://github.com/qiwang067/CoWorld/blob/HEAD/models.py","status":"ran","verification_level":1,"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, qiwang067/CoWorld when it was checked","code_sha256":"44e6fedc5e22071c","code_sha256_prefix":"44e6fedc5e22071c","mcp_get_code":{"code_sha256":"44e6fedc5e22071c"}},{"arxiv_id":"2301.04104","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-diverse-domains-through-world","title":"Mastering Diverse Domains through World Models","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nm512/dreamerv3-torch","path":"dreamer.py","file_url":"https://github.com/nm512/dreamerv3-torch/blob/HEAD/dreamer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e681676cbd727836","code_sha256_prefix":"e681676cbd727836","mcp_get_code":{"code_sha256":"e681676cbd727836"}},{"arxiv_id":"2106.05241","arxiv_id_is_arxiv":true,"paper":"/paper/multi-facet-clustering-variational","title":"Multi-Facet Clustering Variational Autoencoders","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhiyuan1991/proVLAE","path":"model_ladder_pro_celbA.py","file_url":"https://github.com/Zhiyuan1991/proVLAE/blob/HEAD/model_ladder_pro_celbA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Zhiyuan1991/proVLAE (NOASSERTION)","code_sha256":"17b77e2df6e4b53f","code_sha256_prefix":"17b77e2df6e4b53f","mcp_get_code":{"code_sha256":"17b77e2df6e4b53f"}},{"arxiv_id":"1809.10341","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpaceLearner/DisenGraphRep","path":"models/infomax.py","file_url":"https://github.com/SpaceLearner/DisenGraphRep/blob/HEAD/models/infomax.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37bd33520c0762ac","code_sha256_prefix":"37bd33520c0762ac","mcp_get_code":{"code_sha256":"37bd33520c0762ac"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning","path":"algorithms/happo_policy.py","file_url":"https://github.com/anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning/blob/HEAD/algorithms/happo_policy.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":"ce4cd71349aedb12","code_sha256_prefix":"ce4cd71349aedb12","mcp_get_code":{"code_sha256":"ce4cd71349aedb12"}}],"record_sha256":"3f07fa55d700bda91c91a8cfa70252ad763e5a6d88298e3ac54c2ac0e80e5a30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}