{"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/init-params","entry":"init_params","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":1,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"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":1,"unverified":6},"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":"2607.16761","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-16761","title":"Dropout and Random Gradient Masking Are Asymptotically Equivalent in Large ResNets","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"xavimaass/dropout_and_ram_2026","path":"src/jax_resnet/model.py","file_url":"https://github.com/xavimaass/dropout_and_ram_2026/blob/HEAD/src/jax_resnet/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xavimaass/dropout_and_ram_2026 when it was checked","code_sha256":"a99dc95f2d0d489b","code_sha256_prefix":"a99dc95f2d0d489b","mcp_get_code":{"code_sha256":"a99dc95f2d0d489b"}},{"arxiv_id":"2507.10741","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.10741","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"andrewli77/ground-compose-reinforce","path":"src/vlm_models/grid_env_models.py","file_url":"https://github.com/andrewli77/ground-compose-reinforce/blob/HEAD/src/vlm_models/grid_env_models.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":"2ae69347eb3cc6ee","code_sha256_prefix":"2ae69347eb3cc6ee","mcp_get_code":{"code_sha256":"2ae69347eb3cc6ee"}},{"arxiv_id":"2403.16030","arxiv_id_is_arxiv":true,"paper":"/paper/vcr-graphormer-a-mini-batch-graph-transformer","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongqifu/vcr-graphormer","path":"model.py","file_url":"https://github.com/dongqifu/vcr-graphormer/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dongqifu/vcr-graphormer when it was checked","code_sha256":"9a5ffcdb821f1d89","code_sha256_prefix":"9a5ffcdb821f1d89","mcp_get_code":{"code_sha256":"9a5ffcdb821f1d89"}},{"arxiv_id":"2308.02989","arxiv_id_is_arxiv":true,"paper":"/paper/novel-class-discovery-for-long-tailed","title":"Novel Class Discovery for Long-tailed Recognition","date":"2023-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kleinzcy/ncdlr","path":"utils/utils.py","file_url":"https://github.com/kleinzcy/ncdlr/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kleinzcy/ncdlr when it was checked","code_sha256":"e17bd0002de86cf2","code_sha256_prefix":"e17bd0002de86cf2","mcp_get_code":{"code_sha256":"e17bd0002de86cf2"}},{"arxiv_id":"2305.11424","arxiv_id_is_arxiv":true,"paper":"/paper/graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czczup/GPTrans","path":"models/gptrans.py","file_url":"https://github.com/czczup/GPTrans/blob/HEAD/models/gptrans.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, czczup/GPTrans when it was checked","code_sha256":"387e440741d605b1","code_sha256_prefix":"387e440741d605b1","mcp_get_code":{"code_sha256":"387e440741d605b1"}},{"arxiv_id":"2107.00379","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-expected-complexity-of-maxout-networks","title":"On the Expected Complexity of Maxout Networks","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanna-tseran/maxout_complexity","path":"init_method.py","file_url":"https://github.com/hanna-tseran/maxout_complexity/blob/HEAD/init_method.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e44a3938425f2afa","code_sha256_prefix":"e44a3938425f2afa","mcp_get_code":{"code_sha256":"e44a3938425f2afa"}},{"arxiv_id":"2006.00704","arxiv_id_is_arxiv":true,"paper":"/paper/uniform-convergence-rates-for-maximum","title":"Uniform Convergence Rates for Maximum Likelihood Estimation under Two-Component Gaussian Mixture Models","date":"2020-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmanole/Gaussian-mixture-twocomp","path":"python/experiment.py","file_url":"https://github.com/tmanole/Gaussian-mixture-twocomp/blob/HEAD/python/experiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tmanole/Gaussian-mixture-twocomp when it was checked","code_sha256":"b4bb835c1a3cffb9","code_sha256_prefix":"b4bb835c1a3cffb9","mcp_get_code":{"code_sha256":"b4bb835c1a3cffb9"}}],"record_sha256":"3bee8f39730ba3721a2111635c139f9c4b699f45b1ae60233c007a92897c53ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}