{"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/objective-function","entry":"objective_function","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":5,"n_papers_ran":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2505.22988","paper":"/paper/model-preserving-adaptive-rounding","title":"Model-Preserving Adaptive Rounding","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/guidedquant","path":"any_precision/quantization/layerwise_quantize.py","file_url":"https://github.com/snu-mllab/guidedquant/blob/HEAD/any_precision/quantization/layerwise_quantize.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea6e2956fb238d26","mcp_get_code":{"code_sha256":"ea6e2956fb238d26"}},{"arxiv_id":"2407.21124","paper":"/paper/2407-21124","title":"Zero Shot Health Trajectory Prediction Using Transformer","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipolharvard/ethos-paper","path":"ethos/metrics.py","file_url":"https://github.com/ipolharvard/ethos-paper/blob/HEAD/ethos/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bdffdd7c95211682","mcp_get_code":{"code_sha256":"bdffdd7c95211682"}},{"arxiv_id":"2105.04873","paper":"/paper/new-bregman-proximal-type-algorithms-for","title":"New Bregman proximal type algorithms for solving DC optimization problems","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"ShotaTakahashi/bregman-proximal-dc-algorithm","path":"example/example.py","file_url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm/blob/HEAD/example/example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12cebf8cff22c79e","mcp_get_code":{"code_sha256":"12cebf8cff22c79e"}},{"arxiv_id":"2006.07556","paper":"/paper/neural-architecture-search-using-bayesian","title":"Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernels","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/nas_benchmarks","path":"experiment_scripts/run_smac.py","file_url":"https://github.com/automl/nas_benchmarks/blob/HEAD/experiment_scripts/run_smac.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":"47abffc5ae4aba3f","mcp_get_code":{"code_sha256":"47abffc5ae4aba3f"}},{"arxiv_id":"1605.07079","paper":"/paper/fast-bayesian-optimization-of-machine","title":"Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasets","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/RoBO","path":"examples/example_fabolas.py","file_url":"https://github.com/automl/RoBO/blob/HEAD/examples/example_fabolas.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":"09f4044147a26c74","mcp_get_code":{"code_sha256":"09f4044147a26c74"}}]}