{"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/projection-simplex-sort","entry":"projection_simplex_sort","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":5,"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":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":2,"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":"2404.17543","arxiv_id_is_arxiv":true,"paper":"/paper/complexity-of-minimizing-regularized-convex","title":"Complexity of Minimizing Regularized Convex Quadratic Functions","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"danielbergthomsen/regularized-quadratics","path":"experiment/regularized_quadratic.py","file_url":"https://github.com/danielbergthomsen/regularized-quadratics/blob/HEAD/experiment/regularized_quadratic.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ae52f60ece2f982","code_sha256_prefix":"8ae52f60ece2f982","mcp_get_code":{"code_sha256":"8ae52f60ece2f982"}},{"arxiv_id":"2402.06271","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-proximal-gradient-methods-are","title":"Adaptive proximal gradient methods are universal without approximation","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emanuellaude/universal-adaptive-proximal-gradient","path":"convex_optim/function.py","file_url":"https://github.com/emanuellaude/universal-adaptive-proximal-gradient/blob/HEAD/convex_optim/function.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, emanuellaude/universal-adaptive-proximal-gradient when it was checked","code_sha256":"6d92cd03e0f67179","code_sha256_prefix":"6d92cd03e0f67179","mcp_get_code":{"code_sha256":"6d92cd03e0f67179"}},{"arxiv_id":"2109.14727","arxiv_id_is_arxiv":true,"paper":"/paper/dr-jekyll-and-mr-hyde-the-strange-case-of-off","title":"Dr Jekyll and Mr Hyde: the Strange Case of Off-Policy Policy Updates","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/dr-jekyll-and-mr-hyde-the-strange-case-of-off-policy-policy-updates","path":"FiniteJH/proj_simplex.py","file_url":"https://github.com/microsoft/dr-jekyll-and-mr-hyde-the-strange-case-of-off-policy-policy-updates/blob/HEAD/FiniteJH/proj_simplex.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":"9489b9875fccd8f1","code_sha256_prefix":"9489b9875fccd8f1","mcp_get_code":{"code_sha256":"9489b9875fccd8f1"}},{"arxiv_id":"2009.08720","arxiv_id_is_arxiv":true,"paper":"/paper/contextual-semantic-interpretability","title":"Contextual Semantic Interpretability","date":"2020-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmarcosg/CSIB","path":"utils.py","file_url":"https://github.com/dmarcosg/CSIB/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dmarcosg/CSIB when it was checked","code_sha256":"7048aeb8fcda8210","code_sha256_prefix":"7048aeb8fcda8210","mcp_get_code":{"code_sha256":"7048aeb8fcda8210"}},{"arxiv_id":"1907.11625","arxiv_id_is_arxiv":true,"paper":"/paper/learning-policies-for-social-network","title":"Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kage08/graph_sample_rl","path":"utils.py","file_url":"https://github.com/kage08/graph_sample_rl/blob/HEAD/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":"56d4fa85a26c8c89","code_sha256_prefix":"56d4fa85a26c8c89","mcp_get_code":{"code_sha256":"56d4fa85a26c8c89"}}],"record_sha256":"9a8d28f2885869a728ce68e5ce7b3f8e0f5c08dfa7a302b73505e4d3baeb466c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}