{"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/get-categories","entry":"get_categories","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":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":4,"unverified":1},"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":"2606.10528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10528","title":"Representation-Aware Advantage Estimation: Your Reward Model Provides More Than A Scalar Output","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"lmarena/arena-hard-auto","path":"qa_browser.py","file_url":"https://github.com/lmarena/arena-hard-auto/blob/HEAD/qa_browser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31d3137625992d50","code_sha256_prefix":"31d3137625992d50","mcp_get_code":{"code_sha256":"31d3137625992d50"}},{"arxiv_id":"2412.05467","arxiv_id_is_arxiv":true,"paper":"/paper/the-browsergym-ecosystem-for-web-agent","title":"The BrowserGym Ecosystem for Web Agent Research","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"servicenow/workarena","path":"src/browsergym/workarena/api/category.py","file_url":"https://github.com/servicenow/workarena/blob/HEAD/src/browsergym/workarena/api/category.py","status":"ran","verification_level":1,"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, servicenow/workarena (NOASSERTION)","code_sha256":"ce62e9936fba1098","code_sha256_prefix":"ce62e9936fba1098","mcp_get_code":{"code_sha256":"ce62e9936fba1098"}},{"arxiv_id":"2412.00535","arxiv_id_is_arxiv":true,"paper":"/paper/fullstack-bench-evaluating-llms-as-full-stack","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","date":"2024-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/sandboxfusion","path":"sandbox/datasets/humanevoeval.py","file_url":"https://github.com/bytedance/sandboxfusion/blob/HEAD/sandbox/datasets/humanevoeval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1ac2d1e1f9e2e6d","code_sha256_prefix":"c1ac2d1e1f9e2e6d","mcp_get_code":{"code_sha256":"c1ac2d1e1f9e2e6d"}},{"arxiv_id":"2406.11939","arxiv_id_is_arxiv":true,"paper":"/paper/from-crowdsourced-data-to-high-quality","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lm-sys/arena-hard","path":"qa_browser.py","file_url":"https://github.com/lm-sys/arena-hard/blob/HEAD/qa_browser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31d3137625992d50","code_sha256_prefix":"31d3137625992d50","mcp_get_code":{"code_sha256":"31d3137625992d50"}},{"arxiv_id":"2406.03589","arxiv_id_is_arxiv":true,"paper":"/paper/ranking-manipulation-for-conversational","title":"Ranking Manipulation for Conversational Search Engines","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spfrommer/cse-ranking-manipulation","path":"dataset.py","file_url":"https://github.com/spfrommer/cse-ranking-manipulation/blob/HEAD/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, spfrommer/cse-ranking-manipulation when it was checked","code_sha256":"690bec63359f91e1","code_sha256_prefix":"690bec63359f91e1","mcp_get_code":{"code_sha256":"690bec63359f91e1"}},{"arxiv_id":"2406.01506","arxiv_id_is_arxiv":true,"paper":"/paper/the-geometry-of-categorical-and-hierarchical","title":"The Geometry of Categorical and Hierarchical Concepts in Large Language Models","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kihopark/llm_categorical_hierarchical_representations","path":"hierarchical/category.py","file_url":"https://github.com/kihopark/llm_categorical_hierarchical_representations/blob/HEAD/hierarchical/category.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kihopark/llm_categorical_hierarchical_representations when it was checked","code_sha256":"c0cefa4cb672ea6f","code_sha256_prefix":"c0cefa4cb672ea6f","mcp_get_code":{"code_sha256":"c0cefa4cb672ea6f"}},{"arxiv_id":"2110.15943","arxiv_id_is_arxiv":true,"paper":"/paper/metaicl-learning-to-learn-in-context","title":"MetaICL: Learning to Learn In Context","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sambanova/generative_data_prep","path":"generative_data_prep/__main__.py","file_url":"https://github.com/sambanova/generative_data_prep/blob/HEAD/generative_data_prep/__main__.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":"bee73fe11d137291","code_sha256_prefix":"bee73fe11d137291","mcp_get_code":{"code_sha256":"bee73fe11d137291"}},{"arxiv_id":"2104.07713","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-with-stronger-1","title":"Contrastive Learning with Stronger Augmentations","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maple-research-lab/CLSA","path":"VOC_CLF/utils.py","file_url":"https://github.com/maple-research-lab/CLSA/blob/HEAD/VOC_CLF/utils.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":"d5de38f848a793c8","code_sha256_prefix":"d5de38f848a793c8","mcp_get_code":{"code_sha256":"d5de38f848a793c8"}},{"arxiv_id":"1904.06487","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-domain-adaptation-via-minimax","title":"Semi-supervised Domain Adaptation via Minimax Entropy","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrasannaPulakurthi/SPM","path":"utils.py","file_url":"https://github.com/PrasannaPulakurthi/SPM/blob/HEAD/utils.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":"84a015f614f2cea5","code_sha256_prefix":"84a015f614f2cea5","mcp_get_code":{"code_sha256":"84a015f614f2cea5"}}],"record_sha256":"db05ec5b3e81aad1ccecaa53e616a163948b444f39e54f69555d1c4273ca4c46","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}