{"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/minimize","entry":"minimize","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":1,"ran":2,"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":"2405.04230","arxiv_id_is_arxiv":true,"paper":"/paper/unveiling-the-optimization-process-of-physics","title":"Unveiling the optimization process of Physics Informed Neural Networks: How accurate and competitive can PINNs be?","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jorgeurban/self_scaled_algorithms_pinns","path":"modified_minimize.py","file_url":"https://github.com/jorgeurban/self_scaled_algorithms_pinns/blob/HEAD/modified_minimize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, jorgeurban/self_scaled_algorithms_pinns (NOASSERTION)","code_sha256":"79e49cdf26077cec","code_sha256_prefix":"79e49cdf26077cec","mcp_get_code":{"code_sha256":"79e49cdf26077cec"}},{"arxiv_id":"2402.05367","arxiv_id_is_arxiv":true,"paper":"/paper/principled-preferential-bayesian-optimization","title":"Principled Preferential Bayesian Optimization","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f98ab87d983f94c3","code_sha256_prefix":"f98ab87d983f94c3","mcp_get_code":{"code_sha256":"f98ab87d983f94c3"}},{"arxiv_id":"2302.01513","arxiv_id_is_arxiv":true,"paper":"/paper/towards-practical-preferential-bayesian","title":"Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberAgentAILab/preferentialBO","path":"src/preferential_bayesian_opt.py","file_url":"https://github.com/CyberAgentAILab/preferentialBO/blob/HEAD/src/preferential_bayesian_opt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f98ab87d983f94c3","code_sha256_prefix":"f98ab87d983f94c3","mcp_get_code":{"code_sha256":"f98ab87d983f94c3"}},{"arxiv_id":"2203.01110","arxiv_id_is_arxiv":true,"paper":"/paper/the-optimal-noise-in-noise-contrastive","title":"The Optimal Noise in Noise-Contrastive Learning Is Not What You Think","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-omar-chehab/nce-noise-var","path":"nlica/autoptim.py","file_url":"https://github.com/l-omar-chehab/nce-noise-var/blob/HEAD/nlica/autoptim.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":"2533365186ad3aa7","code_sha256_prefix":"2533365186ad3aa7","mcp_get_code":{"code_sha256":"2533365186ad3aa7"}},{"arxiv_id":"2001.06814","arxiv_id_is_arxiv":true,"paper":"/paper/distributionally-robust-bayesian-quadrature","title":"Distributionally Robust Bayesian Quadrature Optimization","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thanhnguyentang/drbqo","path":"optimizer/lbfgs.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/optimizer/lbfgs.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":"94c086615b7379a9","code_sha256_prefix":"94c086615b7379a9","mcp_get_code":{"code_sha256":"94c086615b7379a9"}},{"arxiv_id":"1906.05661","arxiv_id_is_arxiv":true,"paper":"/paper/training-neural-networks-for-and-by","title":"Training Neural Networks for and by Interpolation","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oval-group/ali-g","path":"alig/tf/alig_tf1.py","file_url":"https://github.com/oval-group/ali-g/blob/HEAD/alig/tf/alig_tf1.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":"1093bd50d613b4b4","code_sha256_prefix":"1093bd50d613b4b4","mcp_get_code":{"code_sha256":"1093bd50d613b4b4"}},{"arxiv_id":"1605.00998","arxiv_id_is_arxiv":true,"paper":"/paper/blackbox-a-procedure-for-parallel","title":"Blackbox: A procedure for parallel optimization of expensive black-box functions","date":null,"month_inferred_from_arxiv_id":"2016-05","title_source":"archive","repo":"paulknysh/blackbox","path":"blackbox/blackbox.py","file_url":"https://github.com/paulknysh/blackbox/blob/HEAD/blackbox/blackbox.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec94ff44c8f038b2","code_sha256_prefix":"ec94ff44c8f038b2","mcp_get_code":{"code_sha256":"ec94ff44c8f038b2"}}],"record_sha256":"74ac2196d2a819514f02d56ff2a1e6c216b0fbb3537cf068b0311f80bbc63283","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}