{"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/symsqrt","entry":"symsqrt","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":6,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2407.10964","arxiv_id_is_arxiv":true,"paper":"/paper/no-train-all-gain-self-supervised-gradients","title":"No Train, all Gain: Self-Supervised Gradients Improve Deep Frozen Representations","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WalterSimoncini/fungivision","path":"fungivision/utils/autograd_hacks.py","file_url":"https://github.com/WalterSimoncini/fungivision/blob/HEAD/fungivision/utils/autograd_hacks.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":"56afcb3496c8fd91","code_sha256_prefix":"56afcb3496c8fd91","mcp_get_code":{"code_sha256":"56afcb3496c8fd91"}},{"arxiv_id":"2403.10318","arxiv_id_is_arxiv":true,"paper":"/paper/anytime-neural-architecture-search-on-tabular","title":"Anytime Neural Architecture Search on Tabular Data","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NLGithubWP/pTNAS","path":"src/proxies/autograd_hacks.py","file_url":"https://github.com/NLGithubWP/pTNAS/blob/HEAD/src/proxies/autograd_hacks.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, NLGithubWP/pTNAS when it was checked","code_sha256":"56afcb3496c8fd91","code_sha256_prefix":"56afcb3496c8fd91","mcp_get_code":{"code_sha256":"56afcb3496c8fd91"}},{"arxiv_id":"2306.01896","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-unbounded-state-spaces-in-continuing","title":"Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badger-rl/stop","path":"nmodel.py","file_url":"https://github.com/badger-rl/stop/blob/HEAD/nmodel.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, badger-rl/stop when it was checked","code_sha256":"5562d039a93af838","code_sha256_prefix":"5562d039a93af838","mcp_get_code":{"code_sha256":"5562d039a93af838"}},{"arxiv_id":"2206.02927","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-bias-outside-the-training-set-for","title":"Spectral Bias Outside the Training Set for Deep Networks in the Kernel Regime","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbowman223/deepspec","path":"deep/hercules/autograd_hacks.py","file_url":"https://github.com/bbowman223/deepspec/blob/HEAD/deep/hercules/autograd_hacks.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":"56afcb3496c8fd91","code_sha256_prefix":"56afcb3496c8fd91","mcp_get_code":{"code_sha256":"56afcb3496c8fd91"}},{"arxiv_id":"2205.14495","arxiv_id_is_arxiv":true,"paper":"/paper/task-agnostic-continual-reinforcement","title":"Task-Agnostic Continual Reinforcement Learning: Gaining Insights and Overcoming Challenges","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/replay-based-recurrent-rl","path":"code/misc/autograd_hacks.py","file_url":"https://github.com/amazon-research/replay-based-recurrent-rl/blob/HEAD/code/misc/autograd_hacks.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":"56afcb3496c8fd91","code_sha256_prefix":"56afcb3496c8fd91","mcp_get_code":{"code_sha256":"56afcb3496c8fd91"}},{"arxiv_id":"2104.07970","arxiv_id_is_arxiv":true,"paper":"/paper/gromov-wasserstein-distances-between-gaussian","title":"Gromov-Wasserstein Distances between Gaussian Distributions","date":null,"month_inferred_from_arxiv_id":"2021-04","title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Gromov_Wasserstein_Distances_between_Gaussian_Distributions/GWOT.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Gromov_Wasserstein_Distances_between_Gaussian_Distributions/GWOT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"637a640a06bc2981","code_sha256_prefix":"637a640a06bc2981","mcp_get_code":{"code_sha256":"637a640a06bc2981"}}],"record_sha256":"b23bd890d5f120429965548c2f1847dd1abaecd78bf6a5077b17a2c21d25bc3f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}