{"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/sphere","entry":"sphere","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":6,"n_papers_ran_instrument_only":1,"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":6,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":6,"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":"2602.23561","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23561","title":"VaSST: Variational Inference for Symbolic Regression using Soft Symbolic Trees","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DEAP/deap","path":"deap/benchmarks/movingpeaks.py","file_url":"https://github.com/DEAP/deap/blob/HEAD/deap/benchmarks/movingpeaks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-3.0, as GitHub detects it on this paper's repository, DEAP/deap, is not in the permissive set Syntology serves inline","code_sha256":"96f4e756d180ffba","code_sha256_prefix":"96f4e756d180ffba","mcp_get_code":{"code_sha256":"96f4e756d180ffba"}},{"arxiv_id":"2410.18481","arxiv_id_is_arxiv":true,"paper":"/paper/dialog2flow-pre-training-soft-contrastive","title":"Dialog2Flow: Pre-training Soft-Contrastive Action-Driven Sentence Embeddings for Automatic Dialog Flow Extraction","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idiap/dialog2flow","path":"voronoi_plot.py","file_url":"https://github.com/idiap/dialog2flow/blob/HEAD/voronoi_plot.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":"6ff4e09ade5b648a","code_sha256_prefix":"6ff4e09ade5b648a","mcp_get_code":{"code_sha256":"6ff4e09ade5b648a"}},{"arxiv_id":"2310.00386","arxiv_id_is_arxiv":true,"paper":"/paper/order-preserving-gflownets","title":"Order-Preserving GFlowNets","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhangchen/op-gfn","path":"multi/grid_cond_gfn.py","file_url":"https://github.com/yhangchen/op-gfn/blob/HEAD/multi/grid_cond_gfn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, yhangchen/op-gfn (NOASSERTION)","code_sha256":"84f5d9cf76d6c466","code_sha256_prefix":"84f5d9cf76d6c466","mcp_get_code":{"code_sha256":"84f5d9cf76d6c466"}},{"arxiv_id":"2309.10688","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-different-regimes-of-stochastic","title":"On the different regimes of Stochastic Gradient Descent","date":"2023-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcsl-epfl/regimes_of_sgd","path":"edm/dataset.py","file_url":"https://github.com/pcsl-epfl/regimes_of_sgd/blob/HEAD/edm/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":"c1341f8b593e7298","code_sha256_prefix":"c1341f8b593e7298","mcp_get_code":{"code_sha256":"c1341f8b593e7298"}},{"arxiv_id":"2304.10255","arxiv_id_is_arxiv":true,"paper":"/paper/ped-anova-efficiently-quantifying","title":"PED-ANOVA: Efficiently Quantifying Hyperparameter Importance in Arbitrary Subspaces","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nabenabe0928/local-anova","path":"example.py","file_url":"https://github.com/nabenabe0928/local-anova/blob/HEAD/example.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":"141579cd35241f3f","code_sha256_prefix":"141579cd35241f3f","mcp_get_code":{"code_sha256":"141579cd35241f3f"}},{"arxiv_id":"2106.03894","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-quality-diversity","title":"Differentiable Quality Diversity","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icaros-usc/pyribs","path":"examples/bop_elites.py","file_url":"https://github.com/icaros-usc/pyribs/blob/HEAD/examples/bop_elites.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27471fbc290031c0","code_sha256_prefix":"27471fbc290031c0","mcp_get_code":{"code_sha256":"27471fbc290031c0"}},{"arxiv_id":"1903.05711","arxiv_id_is_arxiv":true,"paper":"/paper/pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinits5/PointNetLK","path":"utils/partial_data.py","file_url":"https://github.com/vinits5/PointNetLK/blob/HEAD/utils/partial_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, vinits5/PointNetLK, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"dfc07249e3b845a4","code_sha256_prefix":"dfc07249e3b845a4","mcp_get_code":{"code_sha256":"dfc07249e3b845a4"}},{"arxiv_id":"1901.08428","arxiv_id_is_arxiv":true,"paper":"/paper/cheap-orthogonal-constraints-in-neural","title":"Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lezcano/geotorch","path":"geotorch/constraints.py","file_url":"https://github.com/Lezcano/geotorch/blob/HEAD/geotorch/constraints.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":"9a20e3ddc0e62b11","code_sha256_prefix":"9a20e3ddc0e62b11","mcp_get_code":{"code_sha256":"9a20e3ddc0e62b11"}},{"arxiv_id":"1806.01224","arxiv_id_is_arxiv":true,"paper":"/paper/challenges-in-high-dimensional-reinforcement","title":"Challenges in High-dimensional Reinforcement Learning with Evolution Strategies","date":"2018-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NiMlr/High-Dim-ES-RL","path":"benchmarkfunctions.py","file_url":"https://github.com/NiMlr/High-Dim-ES-RL/blob/HEAD/benchmarkfunctions.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":"8eb7abd51c7bf2d3","code_sha256_prefix":"8eb7abd51c7bf2d3","mcp_get_code":{"code_sha256":"8eb7abd51c7bf2d3"}}],"record_sha256":"714509f0997e99880aa379c6527ff0bb0771c3003f107b61d07cfeb976bfbdae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}