{"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/check-random-state","entry":"check_random_state","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":3,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"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":3,"ran_fixture":0,"ran":3,"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":"2408.11778","arxiv_id_is_arxiv":true,"paper":"/paper/sum-of-squares-circuits","title":"Sum of Squares Circuits","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anon-npc/squared-npcs","path":"src/pcs/utils.py","file_url":"https://github.com/anon-npc/squared-npcs/blob/HEAD/src/pcs/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, anon-npc/squared-npcs, is not in the permissive set Syntology serves inline","code_sha256":"fab203f5b6ecbb28","code_sha256_prefix":"fab203f5b6ecbb28","mcp_get_code":{"code_sha256":"fab203f5b6ecbb28"}},{"arxiv_id":"2309.13705","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-guided-dynamic-symbolic-network-for","title":"A Neural-Guided Dynamic Symbolic Network for Exploring Mathematical Expressions from Data","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trevorstephens/gplearn","path":"gplearn/utils.py","file_url":"https://github.com/trevorstephens/gplearn/blob/HEAD/gplearn/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3fa9926cc2520c35","code_sha256_prefix":"3fa9926cc2520c35","mcp_get_code":{"code_sha256":"3fa9926cc2520c35"}},{"arxiv_id":"2201.13357","arxiv_id_is_arxiv":true,"paper":"/paper/dns-determinantal-point-process-based-neural","title":"DNS: Determinantal Point Process Based Neural Network Sampler for Ensemble Reinforcement Learning","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guilgautier/DPPy","path":"dppy/exact_sampling.py","file_url":"https://github.com/guilgautier/DPPy/blob/HEAD/dppy/exact_sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8cedd054d1d9f7","code_sha256_prefix":"2f8cedd054d1d9f7","mcp_get_code":{"code_sha256":"2f8cedd054d1d9f7"}},{"arxiv_id":"2009.05567","arxiv_id_is_arxiv":true,"paper":"/paper/dart-data-addition-and-removal-trees","title":"Machine Unlearning for Random Forests","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjbrophy47/dare","path":"dare/_classes.py","file_url":"https://github.com/jjbrophy47/dare/blob/HEAD/dare/_classes.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4afb54d2799f0c8d","code_sha256_prefix":"4afb54d2799f0c8d","mcp_get_code":{"code_sha256":"4afb54d2799f0c8d"}},{"arxiv_id":"1907.02444","arxiv_id_is_arxiv":true,"paper":"/paper/diffprivlib-the-ibm-differential-privacy","title":"Diffprivlib: The IBM Differential Privacy Library","date":"2019-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/differential-privacy-library","path":"diffprivlib/utils.py","file_url":"https://github.com/IBM/differential-privacy-library/blob/HEAD/diffprivlib/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":"012f5af1b672097a","code_sha256_prefix":"012f5af1b672097a","mcp_get_code":{"code_sha256":"012f5af1b672097a"}},{"arxiv_id":"1906.03543","arxiv_id_is_arxiv":true,"paper":"/paper/apricot-submodular-selection-for-data","title":"apricot: Submodular selection for data summarization in Python","date":"2019-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmschrei/apricot","path":"apricot/utils.py","file_url":"https://github.com/jmschrei/apricot/blob/HEAD/apricot/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":"9970bf725452e2b7","code_sha256_prefix":"9970bf725452e2b7","mcp_get_code":{"code_sha256":"9970bf725452e2b7"}},{"arxiv_id":"1205.2618","arxiv_id_is_arxiv":true,"paper":"/paper/bpr-bayesian-personalized-ranking-from","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","date":"2012-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfred/implicit","path":"implicit/utils.py","file_url":"https://github.com/benfred/implicit/blob/HEAD/implicit/utils.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":"6d3ffaf4a60c58eb","code_sha256_prefix":"6d3ffaf4a60c58eb","mcp_get_code":{"code_sha256":"6d3ffaf4a60c58eb"}}],"record_sha256":"d20649154e600c8eb97db6e48d4dc4ead276016cfdd8162c884c76a08d623d68","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}