{"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/report","entry":"report","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":2,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":6,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":6},"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.15096","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-15096","title":"OpenAl4S: Code as Action, Science as Sessions","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"PKU-YuanGroup/OpenAI4S","path":"openai4s/doctor.py","file_url":"https://github.com/PKU-YuanGroup/OpenAI4S/blob/HEAD/openai4s/doctor.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":"2babc7fbd3055d79","code_sha256_prefix":"2babc7fbd3055d79","mcp_get_code":{"code_sha256":"2babc7fbd3055d79"}},{"arxiv_id":"2609.12653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12653","title":"SWARM: A Multilingual Human-Annotated Dataset for Russian Propaganda Detection in Search Engine Results","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"manueltonneau/swarm","path":"swarm/blocklist_metrics.py","file_url":"https://github.com/manueltonneau/swarm/blob/HEAD/swarm/blocklist_metrics.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":"f29cc9f24a9eb995","code_sha256_prefix":"f29cc9f24a9eb995","mcp_get_code":{"code_sha256":"f29cc9f24a9eb995"}},{"arxiv_id":"2608.26093","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-26093","title":"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"akhan-ericsson/autoresearch-percentile-optimization","path":"verify/identify_checkpoints.py","file_url":"https://github.com/akhan-ericsson/autoresearch-percentile-optimization/blob/HEAD/verify/identify_checkpoints.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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, akhan-ericsson/autoresearch-percentile-optimization, is not in the permissive set Syntology serves inline","code_sha256":"63f7a2bb138fccb5","code_sha256_prefix":"63f7a2bb138fccb5","mcp_get_code":{"code_sha256":"63f7a2bb138fccb5"}},{"arxiv_id":"2305.17390","arxiv_id_is_arxiv":true,"paper":"/paper/swiftsage-a-generative-agent-with-fast-and-1","title":"SwiftSage: A Generative Agent with Fast and Slow Thinking for Complex Interactive Tasks","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"re-align/just-eval","path":"just_eval/evaluate.py","file_url":"https://github.com/re-align/just-eval/blob/HEAD/just_eval/evaluate.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":"0f1a589f162138ec","code_sha256_prefix":"0f1a589f162138ec","mcp_get_code":{"code_sha256":"0f1a589f162138ec"}},{"arxiv_id":"2305.12863","arxiv_id_is_arxiv":true,"paper":"/paper/towards-benchmarking-and-assessing-visual-1","title":"Towards Benchmarking and Assessing Visual Naturalness of Physical World Adversarial Attacks","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangsn-19/PAN","path":"src/utils.py","file_url":"https://github.com/zhangsn-19/PAN/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"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":"e8ff2b5ff11599d0","code_sha256_prefix":"e8ff2b5ff11599d0","mcp_get_code":{"code_sha256":"e8ff2b5ff11599d0"}},{"arxiv_id":"2106.12612","arxiv_id_is_arxiv":true,"paper":"/paper/minimum-sharpness-scale-invariant-parameter","title":"Minimum sharpness: Scale-invariant parameter-robustness of neural networks","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibayashi-hikaru/minimum-sharpness","path":"02-sharpness-comparison/experiment/sharpness/Minimum.py","file_url":"https://github.com/ibayashi-hikaru/minimum-sharpness/blob/HEAD/02-sharpness-comparison/experiment/sharpness/Minimum.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, ibayashi-hikaru/minimum-sharpness when it was checked","code_sha256":"8608526be377ff44","code_sha256_prefix":"8608526be377ff44","mcp_get_code":{"code_sha256":"8608526be377ff44"}},{"arxiv_id":"2106.09204","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-on-hyperparameter","title":"An Empirical Study on Hyperparameter Optimization for Fine-Tuning Pre-trained Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"dc6c34254fe5f216","code_sha256_prefix":"dc6c34254fe5f216","mcp_get_code":{"code_sha256":"dc6c34254fe5f216"}},{"arxiv_id":"2106.04815","arxiv_id_is_arxiv":true,"paper":"/paper/chacha-for-online-automl","title":"ChaCha for Online AutoML","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/flaml","path":"flaml/tune/tune.py","file_url":"https://github.com/microsoft/flaml/blob/HEAD/flaml/tune/tune.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":"dc6c34254fe5f216","code_sha256_prefix":"dc6c34254fe5f216","mcp_get_code":{"code_sha256":"dc6c34254fe5f216"}},{"arxiv_id":"Shan_Geminio_Language-Guided_Gradient_Inversion_Attacks_in_Federated_Learning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Shan_Geminio_Language-Guided_Gradient_Inversion_Attacks_in_Federated_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HKU-TASR/Geminio","path":"breaching/analysis/analysis.py","file_url":"https://github.com/HKU-TASR/Geminio/blob/HEAD/breaching/analysis/analysis.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":"b1a3d5852fc1cd40","code_sha256_prefix":"b1a3d5852fc1cd40","mcp_get_code":{"code_sha256":"b1a3d5852fc1cd40"}}],"record_sha256":"d463315b2fc4fe44e38468b285725d00363c2e79bdfaef40b19b78bef7ebb01c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}