{"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/positive-int","entry":"positive_int","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"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":"2609.02387","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02387","title":"Semantics-Guided Automatic Tensorization for Multiobjective Evolutionary Algorithms: A Multi-Agent Framework","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"EMI-Group/evococo","path":"evaluation/_common.py","file_url":"https://github.com/EMI-Group/evococo/blob/HEAD/evaluation/_common.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, EMI-Group/evococo, is not in the permissive set Syntology serves inline","code_sha256":"9ed4578d5a6ee613","code_sha256_prefix":"9ed4578d5a6ee613","mcp_get_code":{"code_sha256":"9ed4578d5a6ee613"}},{"arxiv_id":"2606.20629","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20629","title":"Specialize Roles, Mix Deployments: Pushing the Cost-Accuracy Frontier of LLM Agent Teams","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Auto-CAP/AgentCAP","path":"agent_cap/imo_output.py","file_url":"https://github.com/Auto-CAP/AgentCAP/blob/HEAD/agent_cap/imo_output.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43e1d98f53cdbc9a","code_sha256_prefix":"43e1d98f53cdbc9a","mcp_get_code":{"code_sha256":"43e1d98f53cdbc9a"}},{"arxiv_id":"2606.20008","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20008","title":"VIMPO: Value-Implicit Policy Optimization for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"backprop07/VIMPO","path":"recipe/vimpo/data_preprocess/duplicate_aime.py","file_url":"https://github.com/backprop07/VIMPO/blob/HEAD/recipe/vimpo/data_preprocess/duplicate_aime.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e27925bf449daab9","code_sha256_prefix":"e27925bf449daab9","mcp_get_code":{"code_sha256":"e27925bf449daab9"}},{"arxiv_id":"2412.17336","arxiv_id_is_arxiv":true,"paper":"/paper/apex-2-adaptive-and-extreme-summarization-for","title":"APEX$^2$: Adaptive and Extreme Summarization for Personalized Knowledge Graphs","date":"2024-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iDEA-iSAIL-Lab-UIUC/APEX","path":"PKG_EXP/MetaQA/generate_query.py","file_url":"https://github.com/iDEA-iSAIL-Lab-UIUC/APEX/blob/HEAD/PKG_EXP/MetaQA/generate_query.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":"5d40f691b98b3b24","code_sha256_prefix":"5d40f691b98b3b24","mcp_get_code":{"code_sha256":"5d40f691b98b3b24"}},{"arxiv_id":"2205.01906","arxiv_id_is_arxiv":true,"paper":"/paper/ase-large-scale-reusable-adversarial-skill","title":"ASE: Large-Scale Reusable Adversarial Skill Embeddings for Physically Simulated Characters","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/protomotions","path":"protomotions/train_agent.py","file_url":"https://github.com/nvlabs/protomotions/blob/HEAD/protomotions/train_agent.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":"7d0d7c9b4051de52","code_sha256_prefix":"7d0d7c9b4051de52","mcp_get_code":{"code_sha256":"7d0d7c9b4051de52"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnaisense/pgpelib","path":"pgpelib/optimizers.py","file_url":"https://github.com/nnaisense/pgpelib/blob/HEAD/pgpelib/optimizers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c047cbc5f859f9b","code_sha256_prefix":"3c047cbc5f859f9b","mcp_get_code":{"code_sha256":"3c047cbc5f859f9b"}}],"record_sha256":"3c4ed65944f171d3f2e13ba5499053bf8598747de723dd0440eecfa8cf707c1a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}