{"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/discretize","entry":"discretize","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":3,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":14,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":7,"unverified":2},"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":"2510.25128","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-25128","title":"An Analysis of Causal Effect Estimation using Outcome Invariant Data Augmentation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"uzairakbar/causal-data-augmentation","path":"src/experiments/utils.py","file_url":"https://github.com/uzairakbar/causal-data-augmentation/blob/HEAD/src/experiments/utils.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":"21e9136cc726ebc4","code_sha256_prefix":"21e9136cc726ebc4","mcp_get_code":{"code_sha256":"21e9136cc726ebc4"}},{"arxiv_id":"2411.01978","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-variational-autoencoders-with","title":"Understanding Variational Autoencoders with Intrinsic Dimension and Information Imbalance","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance","path":"vae_framework/utils/dataset_utils.py","file_url":"https://github.com/bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance/blob/HEAD/vae_framework/utils/dataset_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance, is not in the permissive set Syntology serves inline","code_sha256":"fe5b96c6576586d2","code_sha256_prefix":"fe5b96c6576586d2","mcp_get_code":{"code_sha256":"fe5b96c6576586d2"}},{"arxiv_id":"2408.16457","arxiv_id_is_arxiv":true,"paper":"/paper/hygene-a-diffusion-based-hypergraph","title":"HYGENE: A Diffusion-based Hypergraph Generation Method","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DorianGailhard/HYGENE","path":"util/model_helper.py","file_url":"https://github.com/DorianGailhard/HYGENE/blob/HEAD/util/model_helper.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":"e97fe300b007fc38","code_sha256_prefix":"e97fe300b007fc38","mcp_get_code":{"code_sha256":"e97fe300b007fc38"}},{"arxiv_id":"2405.20853","arxiv_id_is_arxiv":true,"paper":"/paper/meshxl-neural-coordinate-field-for-generative","title":"MeshXL: Neural Coordinate Field for Generative 3D Foundation Models","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmeshlab/meshxl","path":"models/mesh_xl/tokenizer.py","file_url":"https://github.com/openmeshlab/meshxl/blob/HEAD/models/mesh_xl/tokenizer.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":"1bc535637544f007","code_sha256_prefix":"1bc535637544f007","mcp_get_code":{"code_sha256":"1bc535637544f007"}},{"arxiv_id":"2403.07362","arxiv_id_is_arxiv":true,"paper":"/paper/challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OPTML-Group/Unlearn-WorstCase","path":"data-wise/unlearn/boundary_sh.py","file_url":"https://github.com/OPTML-Group/Unlearn-WorstCase/blob/HEAD/data-wise/unlearn/boundary_sh.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20b8d1668895f8bb","code_sha256_prefix":"20b8d1668895f8bb","mcp_get_code":{"code_sha256":"20b8d1668895f8bb"}},{"arxiv_id":"2310.12508","arxiv_id_is_arxiv":true,"paper":"/paper/salun-empowering-machine-unlearning-via","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-saliency","path":"Classification/unlearn/boundary_sh.py","file_url":"https://github.com/optml-group/unlearn-saliency/blob/HEAD/Classification/unlearn/boundary_sh.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20b8d1668895f8bb","code_sha256_prefix":"20b8d1668895f8bb","mcp_get_code":{"code_sha256":"20b8d1668895f8bb"}},{"arxiv_id":"2211.13358","arxiv_id_is_arxiv":true,"paper":"/paper/turning-the-tables-biased-imbalanced-dynamic","title":"Turning the Tables: Biased, Imbalanced, Dynamic Tabular Datasets for ML Evaluation","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dssg/aequitas","path":"src/aequitas/preprocessing.py","file_url":"https://github.com/dssg/aequitas/blob/HEAD/src/aequitas/preprocessing.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":"169ee466f281cd50","code_sha256_prefix":"169ee466f281cd50","mcp_get_code":{"code_sha256":"169ee466f281cd50"}},{"arxiv_id":"2204.01613","arxiv_id_is_arxiv":true,"paper":"/paper/spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarolisMart/SPECTRE","path":"util/model_helper.py","file_url":"https://github.com/KarolisMart/SPECTRE/blob/HEAD/util/model_helper.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":"e97fe300b007fc38","code_sha256_prefix":"e97fe300b007fc38","mcp_get_code":{"code_sha256":"e97fe300b007fc38"}},{"arxiv_id":"2111.00396","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"srush/annotated-s4","path":"s4/s4.py","file_url":"https://github.com/srush/annotated-s4/blob/HEAD/s4/s4.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":"2fbdf4a5c125f869","code_sha256_prefix":"2fbdf4a5c125f869","mcp_get_code":{"code_sha256":"2fbdf4a5c125f869"}},{"arxiv_id":"2111.00396","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"srush/annotated-s4","path":"s4/s4d.py","file_url":"https://github.com/srush/annotated-s4/blob/HEAD/s4/s4d.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":"c29c5241ff1d2f5a","code_sha256_prefix":"c29c5241ff1d2f5a","mcp_get_code":{"code_sha256":"c29c5241ff1d2f5a"}},{"arxiv_id":"2106.13195","arxiv_id_is_arxiv":true,"paper":"/paper/fitvid-overfitting-in-pixel-level-video","title":"FitVid: Overfitting in Pixel-Level Video Prediction","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/fitvid","path":"utils.py","file_url":"https://github.com/google-research/fitvid/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":"b89a68818addda7d","code_sha256_prefix":"b89a68818addda7d","mcp_get_code":{"code_sha256":"b89a68818addda7d"}},{"arxiv_id":"1811.12557","arxiv_id_is_arxiv":true,"paper":"/paper/deep-multi-agent-reinforcement-learning-with","title":"Deep Multi-Agent Reinforcement Learning with Relevance Graphs","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tegg89/magnet","path":"models/action_execution/actor_critic_nn.py","file_url":"https://github.com/tegg89/magnet/blob/HEAD/models/action_execution/actor_critic_nn.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":"e95e6dd3a35646ba","code_sha256_prefix":"e95e6dd3a35646ba","mcp_get_code":{"code_sha256":"e95e6dd3a35646ba"}},{"arxiv_id":"1807.09341","arxiv_id_is_arxiv":true,"paper":"/paper/learning-plannable-representations-with","title":"Learning Plannable Representations with Causal InfoGAN","date":"2018-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thanard/causal-infogan","path":"planning.py","file_url":"https://github.com/thanard/causal-infogan/blob/HEAD/planning.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":"c73e58cf108ab89e","code_sha256_prefix":"c73e58cf108ab89e","mcp_get_code":{"code_sha256":"c73e58cf108ab89e"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tegg89/DLCamp_Jeju2018","path":"models/action_execution/actor_critic_nn.py","file_url":"https://github.com/tegg89/DLCamp_Jeju2018/blob/HEAD/models/action_execution/actor_critic_nn.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":"e95e6dd3a35646ba","code_sha256_prefix":"e95e6dd3a35646ba","mcp_get_code":{"code_sha256":"e95e6dd3a35646ba"}}],"record_sha256":"bca1e98696a4bd017e7ed25cfed11aaa9d379fb1bc8a0de902fe341b3a12cd52","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}