{"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/exp","entry":"exp","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":12,"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":7,"unverified":3},"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":"2410.05128","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-online-riemannian-optimization","title":"Decentralized Online Riemannian Optimization with Dynamic Environments","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"statsle/dprgd","path":"src/utils/spd.py","file_url":"https://github.com/statsle/dprgd/blob/HEAD/src/utils/spd.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, statsle/dprgd when it was checked","code_sha256":"c91dee1e9615a9b5","code_sha256_prefix":"c91dee1e9615a9b5","mcp_get_code":{"code_sha256":"c91dee1e9615a9b5"}},{"arxiv_id":"2405.16357","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-enigma-of-neural-dynamics","title":"Exploring the Enigma of Neural Dynamics Through A Scattering-Transform Mixer Landscape for Riemannian Manifold","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dandy5721/ICML2024","path":"CODE/deepholobrain/layers/riemannian.py","file_url":"https://github.com/Dandy5721/ICML2024/blob/HEAD/CODE/deepholobrain/layers/riemannian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Dandy5721/ICML2024 when it was checked","code_sha256":"de192f477635e5d9","code_sha256_prefix":"de192f477635e5d9","mcp_get_code":{"code_sha256":"de192f477635e5d9"}},{"arxiv_id":"2308.09517","arxiv_id_is_arxiv":true,"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/community-aware-graph-transformer","path":"models.py","file_url":"https://github.com/nslab-cuk/community-aware-graph-transformer/blob/HEAD/models.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":"157006cf12196817","code_sha256_prefix":"157006cf12196817","mcp_get_code":{"code_sha256":"157006cf12196817"}},{"arxiv_id":"2308.09517","arxiv_id_is_arxiv":true,"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/unified-graph-transformer","path":"Graph_classification/models.py","file_url":"https://github.com/nslab-cuk/unified-graph-transformer/blob/HEAD/Graph_classification/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":"5a6826903f8b965a","code_sha256_prefix":"5a6826903f8b965a","mcp_get_code":{"code_sha256":"5a6826903f8b965a"}},{"arxiv_id":"2305.17190","arxiv_id_is_arxiv":true,"paper":"/paper/multiplication-free-transformer-training-via-1","title":"Multiplication-Free Transformer Training via Piecewise Affine Operations","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/piecewise-affine-multiplication","path":"pam/pam_ops.py","file_url":"https://github.com/epfml/piecewise-affine-multiplication/blob/HEAD/pam/pam_ops.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":"8414688e931a8025","code_sha256_prefix":"8414688e931a8025","mcp_get_code":{"code_sha256":"8414688e931a8025"}},{"arxiv_id":"2212.03798","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-rising-bandits","title":"Stochastic Rising Bandits","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertometelli/stochastic-rising-bandits","path":"src/reward_model.py","file_url":"https://github.com/albertometelli/stochastic-rising-bandits/blob/HEAD/src/reward_model.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":"11b31c8988ee18de","code_sha256_prefix":"11b31c8988ee18de","mcp_get_code":{"code_sha256":"11b31c8988ee18de"}},{"arxiv_id":"2202.05008","arxiv_id_is_arxiv":true,"paper":"/paper/evojax-hardware-accelerated-neuroevolution","title":"EvoJAX: Hardware-Accelerated Neuroevolution","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/evojax","path":"evojax/algo/crfmnes.py","file_url":"https://github.com/google/evojax/blob/HEAD/evojax/algo/crfmnes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd5636206a92be63","code_sha256_prefix":"dd5636206a92be63","mcp_get_code":{"code_sha256":"dd5636206a92be63"}},{"arxiv_id":"2110.14270","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-shapley-additive-explanations","title":"Counterfactual Shapley Additive Explanations","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpmorganchase/cf-shap-facct22","path":"emutils/latex.py","file_url":"https://github.com/jpmorganchase/cf-shap-facct22/blob/HEAD/emutils/latex.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":"0f57192d632b4c3f","code_sha256_prefix":"0f57192d632b4c3f","mcp_get_code":{"code_sha256":"0f57192d632b4c3f"}},{"arxiv_id":"2107.14351","arxiv_id_is_arxiv":true,"paper":"/paper/contemporary-symbolic-regression-methods-and","title":"Contemporary Symbolic Regression Methods and their Relative Performance","date":"2021-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipp238/parfam","path":"src/parfam/utils.py","file_url":"https://github.com/philipp238/parfam/blob/HEAD/src/parfam/utils.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":"da59bd960d50e6f8","code_sha256_prefix":"da59bd960d50e6f8","mcp_get_code":{"code_sha256":"da59bd960d50e6f8"}},{"arxiv_id":"2007.03154","arxiv_id_is_arxiv":true,"paper":"/paper/discretization-aware-architecture-search","title":"Discretization-Aware Architecture Search","date":"2020-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunsmarterjie/DAAS","path":"cnn/dimension.py","file_url":"https://github.com/sunsmarterjie/DAAS/blob/HEAD/cnn/dimension.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"135e8cf8c541a30f","code_sha256_prefix":"135e8cf8c541a30f","mcp_get_code":{"code_sha256":"135e8cf8c541a30f"}},{"arxiv_id":"1912.02400","arxiv_id_is_arxiv":true,"paper":"/paper/covariance-matrix-adaptation-for-the-rapid","title":"Covariance Matrix Adaptation for the Rapid Illumination of Behavior Space","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dietmarwo/fast-cma-es","path":"fcmaes/crfmnes.py","file_url":"https://github.com/dietmarwo/fast-cma-es/blob/HEAD/fcmaes/crfmnes.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":"dd5636206a92be63","code_sha256_prefix":"dd5636206a92be63","mcp_get_code":{"code_sha256":"dd5636206a92be63"}},{"arxiv_id":"1705.09792","arxiv_id_is_arxiv":true,"paper":"/paper/deep-complex-networks","title":"Deep Complex Networks","date":"2017-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omrijsharon/torchlex","path":"torchlex.py","file_url":"https://github.com/omrijsharon/torchlex/blob/HEAD/torchlex.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, omrijsharon/torchlex when it was checked","code_sha256":"80bac485fc1b3e81","code_sha256_prefix":"80bac485fc1b3e81","mcp_get_code":{"code_sha256":"80bac485fc1b3e81"}}],"record_sha256":"81d3f5e6212915b9bbb9eadbb63a6d0f47b7a8c8bba6d002ac5b32ab7c47f079","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}