{"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/get-config-from-root","entry":"get_config_from_root","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":13,"n_papers_ran":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":6,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2605.07177","paper":"/paper/arxiv-2605-07177","title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DeepExperience/HyperEyes","path":"RL/relax-hypereyes/Relax/versioneer.py","file_url":"https://github.com/DeepExperience/HyperEyes/blob/HEAD/RL/relax-hypereyes/Relax/versioneer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"425230817cebbbc0","mcp_get_code":{"code_sha256":"425230817cebbbc0"}},{"arxiv_id":"2209.12332","paper":"/paper/on-the-optimal-linear-contraction-order-for","title":"On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"stoianmihail/netzwerk","path":"src/netzwerk/versioneer.py","file_url":"https://github.com/stoianmihail/netzwerk/blob/HEAD/src/netzwerk/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4c10b96da92e57d","mcp_get_code":{"code_sha256":"d4c10b96da92e57d"}},{"arxiv_id":"2207.09250","paper":"/paper/roughness-of-molecular-property-landscapes","title":"Roughness of molecular property landscapes and its impact on modellability","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coleygroup/rogi","path":"versioneer.py","file_url":"https://github.com/coleygroup/rogi/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51944f53542b7e19","mcp_get_code":{"code_sha256":"51944f53542b7e19"}},{"arxiv_id":"2205.10242","paper":"/paper/exodus-stable-and-efficient-training-of","title":"EXODUS: Stable and Efficient Training of Spiking Neural Networks","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"synsense/sinabs-exodus","path":"versioneer.py","file_url":"https://github.com/synsense/sinabs-exodus/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"91f6559ad4ae93d0","mcp_get_code":{"code_sha256":"91f6559ad4ae93d0"}},{"arxiv_id":"2104.08691","paper":"/paper/the-power-of-scale-for-parameter-efficient","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VE-FORBRYDERNE/mtj-softtuner","path":"versioneer.py","file_url":"https://github.com/VE-FORBRYDERNE/mtj-softtuner/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"51944f53542b7e19","mcp_get_code":{"code_sha256":"51944f53542b7e19"}},{"arxiv_id":"2104.00864","paper":"/paper/constrained-non-negative-matrix-factorization","title":"Constrained non-negative matrix factorization enabling real-time insights of $\\textit{in situ}$ and high-throughput experiments","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NSLS-II/constrained-matrix-factorization","path":"versioneer.py","file_url":"https://github.com/NSLS-II/constrained-matrix-factorization/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"7a63797a121e8bbf","mcp_get_code":{"code_sha256":"7a63797a121e8bbf"}},{"arxiv_id":"2008.00283","paper":"/paper/crystallography-companion-agent-for-high","title":"Crystallography companion agent for high-throughput materials discovery","date":null,"month_inferred_from_arxiv_id":"2020-08","title_source":"archive","repo":"maffettone/xca","path":"versioneer.py","file_url":"https://github.com/maffettone/xca/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}},{"arxiv_id":"1910.03131","paper":"/paper/generating-valid-euclidean-distance-matrices-1","title":"Generating valid Euclidean distance matrices","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noegroup/EDMnets","path":"versioneer.py","file_url":"https://github.com/noegroup/EDMnets/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}},{"arxiv_id":"1907.12116","paper":"/paper/a-higher-order-swiss-army-infinitesimal","title":"A Higher-Order Swiss Army Infinitesimal Jackknife","date":"2019-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rgiordan/vittles","path":"versioneer.py","file_url":"https://github.com/rgiordan/vittles/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}},{"arxiv_id":"1812.01719","paper":"/paper/knowing-what-you-know-in-brain-segmentation","title":"Knowing what you know in brain segmentation using Bayesian deep neural networks","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuronets/kwyk","path":"versioneer.py","file_url":"https://github.com/neuronets/kwyk/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}},{"arxiv_id":"1806.03720","paper":"/paper/stochastic-seismic-waveform-inversion-using","title":"Stochastic seismic waveform inversion using generative adversarial networks as a geological prior","date":"2018-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LukasMosser/stochastic_seismic_waveform_inversion","path":"devito/versioneer.py","file_url":"https://github.com/LukasMosser/stochastic_seismic_waveform_inversion/blob/HEAD/devito/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}},{"arxiv_id":"1806.03146","paper":"/paper/neural-message-passing-with-edge-updates-for","title":"Neural Message Passing with Edge Updates for Predicting Properties of Molecules and Materials","date":"2018-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nrel/m2p","path":"versioneer.py","file_url":"https://github.com/nrel/m2p/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"51944f53542b7e19","mcp_get_code":{"code_sha256":"51944f53542b7e19"}},{"arxiv_id":"1806.00550","paper":"/paper/a-swiss-army-infinitesimal-jackknife","title":"A Swiss Army Infinitesimal Jackknife","date":null,"month_inferred_from_arxiv_id":"2018-06","title_source":"archive","repo":"rgiordan/paragami","path":"versioneer.py","file_url":"https://github.com/rgiordan/paragami/blob/HEAD/versioneer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d084e1d0452b36f","mcp_get_code":{"code_sha256":"2d084e1d0452b36f"}}]}