{"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/setminus","entry":"setminus","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":7,"n_papers_ran_no_instrument_failure":7,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":7,"n_places_pointer_only":3,"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":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"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":"2409.19732","arxiv_id_is_arxiv":true,"paper":"/paper/unified-gradient-based-machine-unlearning","title":"Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lioutang/unlearn-apollo-attack","path":"attack.py","file_url":"https://github.com/lioutang/unlearn-apollo-attack/blob/HEAD/attack.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":"f1ab27640c7765be","code_sha256_prefix":"f1ab27640c7765be","mcp_get_code":{"code_sha256":"f1ab27640c7765be"}},{"arxiv_id":"2406.08666","arxiv_id_is_arxiv":true,"paper":"/paper/interventional-causal-discovery-in-a-mixture","title":"Interventional Causal Discovery in a Mixture of DAGs","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bvarici/intervention-mixture-dag","path":"utils.py","file_url":"https://github.com/bvarici/intervention-mixture-dag/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c5c62c915a1cf36","code_sha256_prefix":"1c5c62c915a1cf36","mcp_get_code":{"code_sha256":"1c5c62c915a1cf36"}},{"arxiv_id":"2406.05937","arxiv_id_is_arxiv":true,"paper":"/paper/linear-causal-representation-learning-from","title":"Linear Causal Representation Learning from Unknown Multi-node Interventions","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acarturk-e/umni-crl","path":"umni_crl.py","file_url":"https://github.com/acarturk-e/umni-crl/blob/HEAD/umni_crl.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ef279a94a85bf35","code_sha256_prefix":"4ef279a94a85bf35","mcp_get_code":{"code_sha256":"4ef279a94a85bf35"}},{"arxiv_id":"2402.00849","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-causal-representation-learning-1","title":"Score-based Causal Representation Learning: Linear and General Transformations","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","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":"4ef279a94a85bf35","code_sha256_prefix":"4ef279a94a85bf35","mcp_get_code":{"code_sha256":"4ef279a94a85bf35"}},{"arxiv_id":"2310.18715","arxiv_id_is_arxiv":true,"paper":"/paper/robust-offline-policy-evaluation-and","title":"Robust Offline Reinforcement learning with Heavy-Tailed Rewards","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mamba413/room","path":"Cartpole/_util.py","file_url":"https://github.com/mamba413/room/blob/HEAD/Cartpole/_util.py","status":"ran","verification_level":1,"contract_check":null,"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, mamba413/room when it was checked","code_sha256":"fe85da14d45dd5ae","code_sha256_prefix":"fe85da14d45dd5ae","mcp_get_code":{"code_sha256":"fe85da14d45dd5ae"}},{"arxiv_id":"2310.15450","arxiv_id_is_arxiv":true,"paper":"/paper/general-identifiability-and-achievability-for","title":"General Identifiability and Achievability for Causal Representation Learning","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acarturk-e/score-based-crl","path":"UMNI-CRL/umni_crl.py","file_url":"https://github.com/acarturk-e/score-based-crl/blob/HEAD/UMNI-CRL/umni_crl.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ef279a94a85bf35","code_sha256_prefix":"4ef279a94a85bf35","mcp_get_code":{"code_sha256":"4ef279a94a85bf35"}},{"arxiv_id":"2105.04646","arxiv_id_is_arxiv":true,"paper":"/paper/deeply-debiased-off-policy-interval","title":"Deeply-Debiased Off-Policy Interval Estimation","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RunzheStat/D2OPE","path":"_util.py","file_url":"https://github.com/RunzheStat/D2OPE/blob/HEAD/_util.py","status":"ran","verification_level":1,"contract_check":null,"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 mamba413/room, and GitHub detected no licence in that repository when it was checked","code_sha256":"fe85da14d45dd5ae","code_sha256_prefix":"fe85da14d45dd5ae","mcp_get_code":{"code_sha256":"fe85da14d45dd5ae"}}],"record_sha256":"d5c2169b974d4179fdb15649092f0d54a63f9942786d305e296a8b36faa9a1a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}