{"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/stats","entry":"stats","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":7,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":4,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":3,"unverified":2},"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":"2608.08722","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08722","title":"Gaming Without an Attacker: Benchmark Fingerprinting in LLM-Driven Search Under Selection Pressure","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"vicgalle/kernel-fingerprinting","path":"figures/make_generalization_scatter.py","file_url":"https://github.com/vicgalle/kernel-fingerprinting/blob/HEAD/figures/make_generalization_scatter.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfc04c2fec8762e4","code_sha256_prefix":"cfc04c2fec8762e4","mcp_get_code":{"code_sha256":"cfc04c2fec8762e4"}},{"arxiv_id":"2604.27776","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27776","title":"WindowsWorld: A Process-Centric Benchmark of Autonomous GUI Agents in Professional Cross-Application Environments","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"HITsz-TMG/WindowsWorld","path":"show_result.py","file_url":"https://github.com/HITsz-TMG/WindowsWorld/blob/HEAD/show_result.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ae92cc2432792c3","code_sha256_prefix":"9ae92cc2432792c3","mcp_get_code":{"code_sha256":"9ae92cc2432792c3"}},{"arxiv_id":"2603.16739","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-16739","title":"SpecMoE: Spectral Mixture-of-Experts Foundation Model for Cross-Species EEG Decoding","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"TeraXj78/SpecMoE","path":"Trainers/Finetuning_trainer.py","file_url":"https://github.com/TeraXj78/SpecMoE/blob/HEAD/Trainers/Finetuning_trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, TeraXj78/SpecMoE (NOASSERTION)","code_sha256":"f72b10a64ad58192","code_sha256_prefix":"f72b10a64ad58192","mcp_get_code":{"code_sha256":"f72b10a64ad58192"}},{"arxiv_id":"2404.05621","arxiv_id_is_arxiv":true,"paper":"/paper/multiflow-shifting-towards-task-agnostic","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FarinaMatteo/multiflow","path":"pruners/multiflow.py","file_url":"https://github.com/FarinaMatteo/multiflow/blob/HEAD/pruners/multiflow.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, FarinaMatteo/multiflow when it was checked","code_sha256":"2d86258221d323a2","code_sha256_prefix":"2d86258221d323a2","mcp_get_code":{"code_sha256":"2d86258221d323a2"}},{"arxiv_id":"2211.12914","arxiv_id_is_arxiv":true,"paper":"/paper/open-vocabulary-attribute-detection","title":"Open-vocabulary Attribute Detection","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OVAD-Benchmark/ovad-bechmark-code","path":"ovadb/modeling/logged_module.py","file_url":"https://github.com/OVAD-Benchmark/ovad-bechmark-code/blob/HEAD/ovadb/modeling/logged_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9f35411381d5ccbc","code_sha256_prefix":"9f35411381d5ccbc","mcp_get_code":{"code_sha256":"9f35411381d5ccbc"}},{"arxiv_id":"2011.07537","arxiv_id_is_arxiv":true,"paper":"/paper/tonic-a-deep-reinforcement-learning-library","title":"Tonic: A Deep Reinforcement Learning Library for Fast Prototyping and Benchmarking","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabiopardo/tonic","path":"tonic/plot.py","file_url":"https://github.com/fabiopardo/tonic/blob/HEAD/tonic/plot.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f19c3ae22dd20dd","code_sha256_prefix":"6f19c3ae22dd20dd","mcp_get_code":{"code_sha256":"6f19c3ae22dd20dd"}},{"arxiv_id":"1908.05318","arxiv_id_is_arxiv":true,"paper":"/paper/jedi-net-a-jet-identification-algorithm-based","title":"JEDI-net: a jet identification algorithm based on interaction networks","date":null,"month_inferred_from_arxiv_id":"2019-08","title_source":"archive","repo":"jmduarte/JEDInet-code","path":"python/JetImageClassifier_INTop_FinalTraining.py","file_url":"https://github.com/jmduarte/JEDInet-code/blob/HEAD/python/JetImageClassifier_INTop_FinalTraining.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, jmduarte/JEDInet-code when it was checked","code_sha256":"b8629db8da256910","code_sha256_prefix":"b8629db8da256910","mcp_get_code":{"code_sha256":"b8629db8da256910"}},{"arxiv_id":"1903.06620","arxiv_id_is_arxiv":true,"paper":"/paper/on-evaluation-of-adversarial-perturbations","title":"On Evaluation of Adversarial Perturbations for Sequence-to-Sequence Models","date":"2019-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmichel31415/teapot-nlp","path":"teapot/utils.py","file_url":"https://github.com/pmichel31415/teapot-nlp/blob/HEAD/teapot/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":"c46091204a1861fe","code_sha256_prefix":"c46091204a1861fe","mcp_get_code":{"code_sha256":"c46091204a1861fe"}},{"arxiv_id":"1901.07621","arxiv_id_is_arxiv":true,"paper":"/paper/single-deep-counterfactual-regret","title":"Single Deep Counterfactual Regret Minimization","date":"2019-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricSteinberger/Deep-CFR","path":"analyze_sdcfr_vs_dcfr_strategy.py","file_url":"https://github.com/EricSteinberger/Deep-CFR/blob/HEAD/analyze_sdcfr_vs_dcfr_strategy.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":"aa279670c9cb12bd","code_sha256_prefix":"aa279670c9cb12bd","mcp_get_code":{"code_sha256":"aa279670c9cb12bd"}}],"record_sha256":"493e6ec06b038cfffe765e5f74e927fbb677e3ad4232ed22fd07712633e49d01","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}