{"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/stratified-sample","entry":"stratified_sample","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":5,"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":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":"2609.14857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-14857","title":"MODULARRSI: MODULAR AND GENERALIZABLE RE-CURSIVE HARNESS SELF-IMPROVEMENT","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"IQuestLab/ModularRSI","path":"adapters/bfcl/generate_parity_sample.py","file_url":"https://github.com/IQuestLab/ModularRSI/blob/HEAD/adapters/bfcl/generate_parity_sample.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":"4b1bef41af5fc1d1","code_sha256_prefix":"4b1bef41af5fc1d1","mcp_get_code":{"code_sha256":"4b1bef41af5fc1d1"}},{"arxiv_id":"2606.15307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15307","title":"Adapting Reinforcement Learning with Chain-of-Thought Supervision for Explainable Detection of Hateful and Propagandistic Memes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"MohamedBayan/MemeReason","path":"data_prep/build_unlabeled_training_set.py","file_url":"https://github.com/MohamedBayan/MemeReason/blob/HEAD/data_prep/build_unlabeled_training_set.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, MohamedBayan/MemeReason when it was checked","code_sha256":"ed1d04a19f894910","code_sha256_prefix":"ed1d04a19f894910","mcp_get_code":{"code_sha256":"ed1d04a19f894910"}},{"arxiv_id":"2604.19572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-19572","title":"A Self-Evolving Framework for Efficient Terminal Agents via Observational Context Compression","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"multimodal-art-projection/TACO","path":"adapters/bfcl/generate_parity_sample.py","file_url":"https://github.com/multimodal-art-projection/TACO/blob/HEAD/adapters/bfcl/generate_parity_sample.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":"4b1bef41af5fc1d1","code_sha256_prefix":"4b1bef41af5fc1d1","mcp_get_code":{"code_sha256":"4b1bef41af5fc1d1"}},{"arxiv_id":"2411.09730","arxiv_id_is_arxiv":true,"paper":"/paper/suremap-simultaneous-mean-estimation-for","title":"SureMap: Simultaneous Mean Estimation for Single-Task and Multi-Task Disaggregated Evaluation","date":"2024-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkhodak/SureMap","path":"sr.py","file_url":"https://github.com/mkhodak/SureMap/blob/HEAD/sr.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":"9dd7481f5863799b","code_sha256_prefix":"9dd7481f5863799b","mcp_get_code":{"code_sha256":"9dd7481f5863799b"}},{"arxiv_id":"2410.09883","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-neural-mapping-and-motion","title":"Physics-informed Neural Mapping and Motion Planning in Unknown Environments","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"rtlyc/antfields-demo","path":"dataprocessing/isdf_sample.py","file_url":"https://github.com/rtlyc/antfields-demo/blob/HEAD/dataprocessing/isdf_sample.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, rtlyc/antfields-demo (NOASSERTION)","code_sha256":"19c941aef4374209","code_sha256_prefix":"19c941aef4374209","mcp_get_code":{"code_sha256":"19c941aef4374209"}},{"arxiv_id":"2408.07832","arxiv_id_is_arxiv":true,"paper":"/paper/language-driven-slice-discovery-and-error","title":"LADDER: Language Driven Slice Discovery and Error Rectification","date":"2024-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"batmanlab/Ladder","path":"src/codebase/utils.py","file_url":"https://github.com/batmanlab/Ladder/blob/HEAD/src/codebase/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, batmanlab/Ladder, is not in the permissive set Syntology serves inline","code_sha256":"b29a01fd0e697f3d","code_sha256_prefix":"b29a01fd0e697f3d","mcp_get_code":{"code_sha256":"b29a01fd0e697f3d"}},{"arxiv_id":"2406.10785","arxiv_id_is_arxiv":true,"paper":"/paper/sharelora-parameter-efficient-and-robust","title":"ShareLoRA: Parameter Efficient and Robust Large Language Model Fine-tuning via Shared Low-Rank Adaptation","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rain9876/ShareLoRA","path":"sharelora/eval_callback.py","file_url":"https://github.com/Rain9876/ShareLoRA/blob/HEAD/sharelora/eval_callback.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Rain9876/ShareLoRA when it was checked","code_sha256":"682054ec168ce449","code_sha256_prefix":"682054ec168ce449","mcp_get_code":{"code_sha256":"682054ec168ce449"}},{"arxiv_id":"2307.03823","arxiv_id_is_arxiv":true,"paper":"/paper/linguistic-representations-for-fewer-shot","title":"Linguistic representations for fewer-shot relation extraction across domains","date":"2023-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShoRit/flow_graphs","path":"code/dataloader.py","file_url":"https://github.com/ShoRit/flow_graphs/blob/HEAD/code/dataloader.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":"e17310578b0210f1","code_sha256_prefix":"e17310578b0210f1","mcp_get_code":{"code_sha256":"e17310578b0210f1"}},{"arxiv_id":"2306.02109","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2306.02109","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":null,"repo":"mims-harvard/TimeX","path":"txai/models/bc_model.py","file_url":"https://github.com/mims-harvard/TimeX/blob/HEAD/txai/models/bc_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, mims-harvard/TimeX when it was checked","code_sha256":"0d52cea301c9486e","code_sha256_prefix":"0d52cea301c9486e","mcp_get_code":{"code_sha256":"0d52cea301c9486e"}},{"arxiv_id":"1902.03368","arxiv_id_is_arxiv":true,"paper":"/paper/skin-lesion-analysis-toward-melanoma-1","title":"Skin Lesion Analysis Toward Melanoma Detection 2018: A Challenge Hosted by the International Skin Imaging Collaboration (ISIC)","date":"2019-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datascisteven/Melanoma-Detector","path":"utils.py","file_url":"https://github.com/datascisteven/Melanoma-Detector/blob/HEAD/utils.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":"9b0434206a958b83","code_sha256_prefix":"9b0434206a958b83","mcp_get_code":{"code_sha256":"9b0434206a958b83"}}],"record_sha256":"f156cc26d89fe69a728965dec913f8d8937e5a00827a51a7dd9bc0e338f354da","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}