{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/sphere","entry":"sphere","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":9,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":6},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"code_sha256_prefix":"96f4e756d180ffba","mcp_get_code":{"code_sha256":"96f4e756d180ffba"}},{"arxiv_id":"2410.18481","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ff4e09ade5b648a","mcp_get_code":{"code_sha256":"6ff4e09ade5b648a"}},{"arxiv_id":"2310.00386","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,"code_sha256_prefix":"84f5d9cf76d6c466","mcp_get_code":{"code_sha256":"84f5d9cf76d6c466"}},{"arxiv_id":"2309.10688","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,"code_sha256_prefix":"c1341f8b593e7298","mcp_get_code":{"code_sha256":"c1341f8b593e7298"}},{"arxiv_id":"2304.10255","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"141579cd35241f3f","mcp_get_code":{"code_sha256":"141579cd35241f3f"}},{"arxiv_id":"2106.03894","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,"code_sha256_prefix":"27471fbc290031c0","mcp_get_code":{"code_sha256":"27471fbc290031c0"}},{"arxiv_id":"1903.05711","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,"code_sha256_prefix":"dfc07249e3b845a4","mcp_get_code":{"code_sha256":"dfc07249e3b845a4"}},{"arxiv_id":"1901.08428","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,"code_sha256_prefix":"9a20e3ddc0e62b11","mcp_get_code":{"code_sha256":"9a20e3ddc0e62b11"}},{"arxiv_id":"1806.01224","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8eb7abd51c7bf2d3","mcp_get_code":{"code_sha256":"8eb7abd51c7bf2d3"}}]}