{"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/randint","entry":"randint","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":9,"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":2,"ran_fixture":0,"ran":5,"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":"2406.08569","arxiv_id_is_arxiv":true,"paper":"/paper/noise-aware-differentially-private-regression","title":"Noise-Aware Differentially Private Regression via Meta-Learning","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/dpconvcnp","path":"dpconvcnp/random.py","file_url":"https://github.com/cambridge-mlg/dpconvcnp/blob/HEAD/dpconvcnp/random.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":"ab59bc2f0e44676a","code_sha256_prefix":"ab59bc2f0e44676a","mcp_get_code":{"code_sha256":"ab59bc2f0e44676a"}},{"arxiv_id":"2403.07675","arxiv_id_is_arxiv":true,"paper":"/paper/multichannel-long-term-streaming-neural","title":"Multichannel Long-Term Streaming Neural Speech Enhancement for Static and Moving Speakers","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"audio-westlakeu/nbss","path":"data_loaders/spk4_wsj0_mix_sp.py","file_url":"https://github.com/audio-westlakeu/nbss/blob/HEAD/data_loaders/spk4_wsj0_mix_sp.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":"321d0163fb51d2fe","code_sha256_prefix":"321d0163fb51d2fe","mcp_get_code":{"code_sha256":"321d0163fb51d2fe"}},{"arxiv_id":"2308.16177","arxiv_id_is_arxiv":true,"paper":"/paper/general-purpose-audio-effect-removal","title":"General Purpose Audio Effect Removal","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":"archive","repo":"mhrice/RemFx","path":"remfx/effects.py","file_url":"https://github.com/mhrice/RemFx/blob/HEAD/remfx/effects.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":"2d9c80e4c15707d0","code_sha256_prefix":"2d9c80e4c15707d0","mcp_get_code":{"code_sha256":"2d9c80e4c15707d0"}},{"arxiv_id":"2307.04429","arxiv_id_is_arxiv":true,"paper":"/paper/designing-novel-cognitive-diagnosis-models","title":"Designing Novel Cognitive Diagnosis Models via Evolutionary Multi-Objective Neural Architecture Search","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devilyangs/emo-nas-cd","path":"EMO_public/P_generator.py","file_url":"https://github.com/devilyangs/emo-nas-cd/blob/HEAD/EMO_public/P_generator.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":"e340b8f4085b3aeb","code_sha256_prefix":"e340b8f4085b3aeb","mcp_get_code":{"code_sha256":"e340b8f4085b3aeb"}},{"arxiv_id":"2303.10725","arxiv_id_is_arxiv":true,"paper":"/paper/siesta-efficient-online-continual-learning","title":"SIESTA: Efficient Online Continual Learning with Sleep","date":"2023-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yousuf907/SIESTA","path":"SIESTAModel.py","file_url":"https://github.com/yousuf907/SIESTA/blob/HEAD/SIESTAModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"80723ff359b72940","code_sha256_prefix":"80723ff359b72940","mcp_get_code":{"code_sha256":"80723ff359b72940"}},{"arxiv_id":"2102.08850","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-inverts-the-data","title":"Contrastive Learning Inverts the Data Generating Process","date":"2021-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brendel-group/cl-ica","path":"main_kitti.py","file_url":"https://github.com/brendel-group/cl-ica/blob/HEAD/main_kitti.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":"9958e08683dcf598","code_sha256_prefix":"9958e08683dcf598","mcp_get_code":{"code_sha256":"9958e08683dcf598"}},{"arxiv_id":"1910.02509","arxiv_id_is_arxiv":true,"paper":"/paper/remind-your-neural-network-to-prevent","title":"REMIND Your Neural Network to Prevent Catastrophic Forgetting","date":"2019-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyler-hayes/REMIND","path":"image_classification_experiments/REMINDModel.py","file_url":"https://github.com/tyler-hayes/REMIND/blob/HEAD/image_classification_experiments/REMINDModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b8cb9c8dfce51c5","code_sha256_prefix":"1b8cb9c8dfce51c5","mcp_get_code":{"code_sha256":"1b8cb9c8dfce51c5"}},{"arxiv_id":"1703.07469","arxiv_id_is_arxiv":true,"paper":"/paper/robustfill-neural-program-learning-under","title":"RobustFill: Neural Program Learning under Noisy I/O","date":"2017-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeoedward/Robust-Fill","path":"sample.py","file_url":"https://github.com/yeoedward/Robust-Fill/blob/HEAD/sample.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":"22a80ccfacca282e","code_sha256_prefix":"22a80ccfacca282e","mcp_get_code":{"code_sha256":"22a80ccfacca282e"}},{"arxiv_id":"aaai_17462","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_17462","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/nni","path":"nni/parameter_expressions.py","file_url":"https://github.com/microsoft/nni/blob/HEAD/nni/parameter_expressions.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":"3831fadbd2206cbc","code_sha256_prefix":"3831fadbd2206cbc","mcp_get_code":{"code_sha256":"3831fadbd2206cbc"}}],"record_sha256":"bf52deee8e36f7f049bc648c6397d1d2777f1240e6098d8196d70cb0ccfe21bb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}