{"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/generate-random-graph","entry":"generate_random_graph","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_fixture":0,"ran":3,"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":"2505.24864","arxiv_id_is_arxiv":true,"paper":"/paper/prorl-prolonged-reinforcement-learning","title":"ProRL: Prolonged Reinforcement Learning Expands Reasoning Boundaries in Large Language Models","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-thought/reasoning-gym","path":"reasoning_gym/algorithmic/graph_color.py","file_url":"https://github.com/open-thought/reasoning-gym/blob/HEAD/reasoning_gym/algorithmic/graph_color.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":"e5284583b5d8bcaa","code_sha256_prefix":"e5284583b5d8bcaa","mcp_get_code":{"code_sha256":"e5284583b5d8bcaa"}},{"arxiv_id":"2112.11628","arxiv_id_is_arxiv":true,"paper":"/paper/skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/skipnode","path":"utils/dataset.py","file_url":"https://github.com/weiganglu/skipnode/blob/HEAD/utils/dataset.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":"91e82cab62fa0b71","code_sha256_prefix":"91e82cab62fa0b71","mcp_get_code":{"code_sha256":"91e82cab62fa0b71"}},{"arxiv_id":"2107.07493","arxiv_id_is_arxiv":true,"paper":"/paper/algorithmic-concept-based-explainable","title":"Algorithmic Concept-based Explainable Reasoning","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HekpoMaH/algorithmic-concepts-reasoning","path":"algos/deterministic/BFS.py","file_url":"https://github.com/HekpoMaH/algorithmic-concepts-reasoning/blob/HEAD/algos/deterministic/BFS.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":"53a66a2edc77a464","code_sha256_prefix":"53a66a2edc77a464","mcp_get_code":{"code_sha256":"53a66a2edc77a464"}},{"arxiv_id":"2007.03151","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-learning-for-multilevel-budgeted","title":"Curriculum learning for multilevel budgeted combinatorial problems","date":"2020-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdelNabli/MCN","path":"MCN/utils.py","file_url":"https://github.com/AdelNabli/MCN/blob/HEAD/MCN/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":"c9dd0efb7d2cfaf9","code_sha256_prefix":"c9dd0efb7d2cfaf9","mcp_get_code":{"code_sha256":"c9dd0efb7d2cfaf9"}},{"arxiv_id":"1807.08518","arxiv_id_is_arxiv":true,"paper":"/paper/implementing-neural-turing-machines","title":"Implementing Neural Turing Machines","date":"2018-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SourangshuGhosh/NeuralTuringMachine","path":"generate_data.py","file_url":"https://github.com/SourangshuGhosh/NeuralTuringMachine/blob/HEAD/generate_data.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":"6edda34912cd2f5f","code_sha256_prefix":"6edda34912cd2f5f","mcp_get_code":{"code_sha256":"6edda34912cd2f5f"}}],"record_sha256":"351a4306444003b4757800f68fc1b216dbe04166e351b5cec49d60894e083731","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}