{"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/str-to-list","entry":"str_to_list","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":10,"n_papers_ran_no_instrument_failure":8,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":4,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"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":"2603.00097","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00097","title":"Exploring Drug Safety Through Knowledge Graphs: Protein Kinase Inhibitors as a Case Study","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"davidjackson99/PKI_KG","path":"NER.py","file_url":"https://github.com/davidjackson99/PKI_KG/blob/HEAD/NER.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidjackson99/PKI_KG when it was checked","code_sha256":"b7ad2c09d32f09ac","code_sha256_prefix":"b7ad2c09d32f09ac","mcp_get_code":{"code_sha256":"b7ad2c09d32f09ac"}},{"arxiv_id":"2406.02366","arxiv_id_is_arxiv":true,"paper":"/paper/finding-nemo-localizing-neurons-responsible","title":"Finding NeMo: Localizing Neurons Responsible For Memorization in Diffusion Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/localizing_memorization_in_diffusion_models","path":"4_generate_images.py","file_url":"https://github.com/ml-research/localizing_memorization_in_diffusion_models/blob/HEAD/4_generate_images.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"faf67b17312a8edc","code_sha256_prefix":"faf67b17312a8edc","mcp_get_code":{"code_sha256":"faf67b17312a8edc"}},{"arxiv_id":"2402.17910","arxiv_id_is_arxiv":true,"paper":"/paper/box-it-to-bind-it-unified-layout-control-and","title":"Box It to Bind It: Unified Layout Control and Attribute Binding in T2I Diffusion Models","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nextaistudio/boxit2bindit","path":"utils/util.py","file_url":"https://github.com/nextaistudio/boxit2bindit/blob/HEAD/utils/util.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, nextaistudio/boxit2bindit when it was checked","code_sha256":"b2a54eaa915f497f","code_sha256_prefix":"b2a54eaa915f497f","mcp_get_code":{"code_sha256":"b2a54eaa915f497f"}},{"arxiv_id":"2402.15638","arxiv_id_is_arxiv":true,"paper":"/paper/fair-resource-allocation-in-multi-task","title":"Fair Resource Allocation in Multi-Task Learning","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optmn-lab/fairgrad","path":"experiments/utils.py","file_url":"https://github.com/optmn-lab/fairgrad/blob/HEAD/experiments/utils.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":"267fdf7ca1571871","code_sha256_prefix":"267fdf7ca1571871","mcp_get_code":{"code_sha256":"267fdf7ca1571871"}},{"arxiv_id":"2402.04005","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-uncertainty-for-gradient-aggregation","title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssi-research/bayesagg_mtl","path":"experiments/utils.py","file_url":"https://github.com/ssi-research/bayesagg_mtl/blob/HEAD/experiments/utils.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":"267fdf7ca1571871","code_sha256_prefix":"267fdf7ca1571871","mcp_get_code":{"code_sha256":"267fdf7ca1571871"}},{"arxiv_id":"2311.09939","arxiv_id_is_arxiv":true,"paper":"/paper/red-dot-multimodal-fact-checking-via-relevant","title":"RED-DOT: Multimodal Fact-checking via Relevant Evidence Detection","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevejpapad/relevant-evidence-detection","path":"src/utils_evidence.py","file_url":"https://github.com/stevejpapad/relevant-evidence-detection/blob/HEAD/src/utils_evidence.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":"3ba7c5965cdd037d","code_sha256_prefix":"3ba7c5965cdd037d","mcp_get_code":{"code_sha256":"3ba7c5965cdd037d"}},{"arxiv_id":"2306.00024","arxiv_id_is_arxiv":true,"paper":"/paper/self-verification-improves-few-shot-clinical","title":"Self-Verification Improves Few-Shot Clinical Information Extraction","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/clinical-self-verification","path":"clin/parse.py","file_url":"https://github.com/microsoft/clinical-self-verification/blob/HEAD/clin/parse.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":"4139e67944d6519c","code_sha256_prefix":"4139e67944d6519c","mcp_get_code":{"code_sha256":"4139e67944d6519c"}},{"arxiv_id":"2305.18409","arxiv_id_is_arxiv":true,"paper":"/paper/direction-oriented-multi-objective-learning","title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-opt-lab/sdmgrad","path":"experiments/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/utils.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":"267fdf7ca1571871","code_sha256_prefix":"267fdf7ca1571871","mcp_get_code":{"code_sha256":"267fdf7ca1571871"}},{"arxiv_id":"2212.03857","arxiv_id_is_arxiv":true,"paper":"/paper/phase2vec-dynamical-systems-embedding-with-a","title":"Phase2vec: Dynamical systems embedding with a physics-informed convolutional network","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nitzanlab/phase2vec","path":"phase2vec/utils/_utils.py","file_url":"https://github.com/nitzanlab/phase2vec/blob/HEAD/phase2vec/utils/_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nitzanlab/phase2vec when it was checked","code_sha256":"28fd2e4c52372a93","code_sha256_prefix":"28fd2e4c52372a93","mcp_get_code":{"code_sha256":"28fd2e4c52372a93"}},{"arxiv_id":"2009.14119","arxiv_id_is_arxiv":true,"paper":"/paper/asymmetric-loss-for-multi-label","title":"Asymmetric Loss For Multi-Label Classification","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SlongLiu/ASL_reproduce","path":"src/helper_functions/nuswide_asl.py","file_url":"https://github.com/SlongLiu/ASL_reproduce/blob/HEAD/src/helper_functions/nuswide_asl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, SlongLiu/ASL_reproduce, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"50a335a67cb29af0","code_sha256_prefix":"50a335a67cb29af0","mcp_get_code":{"code_sha256":"50a335a67cb29af0"}}],"record_sha256":"d5ceb6772af6ebf2cbdb219609bbac02b980cd59987bfef4df1037f4a8da6a8a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}