{"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/binary-search","entry":"binary_search","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":9,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":0},"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":"2406.09714","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-validity-via-enhanced","title":"Large language model validity via enhanced conformal prediction methods","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjcherian/conditional-conformal","path":"conditionalconformal/condconf.py","file_url":"https://github.com/jjcherian/conditional-conformal/blob/HEAD/conditionalconformal/condconf.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":"a9044f6ed0707c0e","code_sha256_prefix":"a9044f6ed0707c0e","mcp_get_code":{"code_sha256":"a9044f6ed0707c0e"}},{"arxiv_id":"2304.02396","arxiv_id_is_arxiv":true,"paper":"/paper/autorl-hyperparameter-landscapes","title":"AutoRL Hyperparameter Landscapes","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/autorl-landscape","path":"autorl_landscape/analyze/concavity.py","file_url":"https://github.com/automl/autorl-landscape/blob/HEAD/autorl_landscape/analyze/concavity.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":"22ecd337184a2636","code_sha256_prefix":"22ecd337184a2636","mcp_get_code":{"code_sha256":"22ecd337184a2636"}},{"arxiv_id":"2207.12274","arxiv_id_is_arxiv":true,"paper":"/paper/mapie-an-open-source-library-for-distribution","title":"MAPIE: an open-source library for distribution-free uncertainty quantification","date":"2022-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scikit-learn-contrib/MAPIE","path":"mapie/conditional_conformal_prediction.py","file_url":"https://github.com/scikit-learn-contrib/MAPIE/blob/HEAD/mapie/conditional_conformal_prediction.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9044f6ed0707c0e","code_sha256_prefix":"a9044f6ed0707c0e","mcp_get_code":{"code_sha256":"a9044f6ed0707c0e"}},{"arxiv_id":"2111.06063","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-equivalence-between-neural-network-and","title":"On the Equivalence between Neural Network and Support Vector Machine","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leslie-CH/equiv-nn-svm","path":"robust_svm.py","file_url":"https://github.com/leslie-CH/equiv-nn-svm/blob/HEAD/robust_svm.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":"5966a7c925b28912","code_sha256_prefix":"5966a7c925b28912","mcp_get_code":{"code_sha256":"5966a7c925b28912"}},{"arxiv_id":"2109.00542","arxiv_id_is_arxiv":true,"paper":"/paper/proof-transfer-for-neural-network","title":"Shared Certificates for Neural Network Verification","date":"2021-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/proof-sharing","path":"templates.py","file_url":"https://github.com/eth-sri/proof-sharing/blob/HEAD/templates.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":"5966867bed2eceb4","code_sha256_prefix":"5966867bed2eceb4","mcp_get_code":{"code_sha256":"5966867bed2eceb4"}},{"arxiv_id":"2106.06695","arxiv_id_is_arxiv":true,"paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"gpytorch_lattice_kernel/bilateral_kernel.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/gpytorch_lattice_kernel/bilateral_kernel.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":"531d10e023e4f5ad","code_sha256_prefix":"531d10e023e4f5ad","mcp_get_code":{"code_sha256":"531d10e023e4f5ad"}},{"arxiv_id":"2105.12848","arxiv_id_is_arxiv":true,"paper":"/paper/bertifying-the-hidden-markov-model-for-multi","title":"BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yinghao-Li/CHMM-ALT","path":"data_constr/src/data.py","file_url":"https://github.com/Yinghao-Li/CHMM-ALT/blob/HEAD/data_constr/src/data.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":"07c3eac7eb4ccba4","code_sha256_prefix":"07c3eac7eb4ccba4","mcp_get_code":{"code_sha256":"07c3eac7eb4ccba4"}},{"arxiv_id":"1910.00152","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-complexity-of-approximating","title":"On the Complexity of Approximating Multimarginal Optimal Transport","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuge-mit/mot_project","path":"MOT_models.py","file_url":"https://github.com/shuge-mit/mot_project/blob/HEAD/MOT_models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shuge-mit/mot_project when it was checked","code_sha256":"17c80f989d72ee34","code_sha256_prefix":"17c80f989d72ee34","mcp_get_code":{"code_sha256":"17c80f989d72ee34"}},{"arxiv_id":"1906.11985","arxiv_id_is_arxiv":true,"paper":"/paper/near-optimal-methods-for-minimizing-star","title":"Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond","date":"2019-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nimz/quasar-convex-acceleration","path":"algorithms.py","file_url":"https://github.com/nimz/quasar-convex-acceleration/blob/HEAD/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nimz/quasar-convex-acceleration when it was checked","code_sha256":"100c334cd8e6d958","code_sha256_prefix":"100c334cd8e6d958","mcp_get_code":{"code_sha256":"100c334cd8e6d958"}}],"record_sha256":"a5a9e2dbec97eee6978958a9d41c9f0f4b01f5d42fc22ac478e23016ae7dcb36","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}