{"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/onek-encoding-unk","entry":"onek_encoding_unk","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":12,"n_places_pointer_only":0,"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":6,"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":"2502.15805","arxiv_id_is_arxiv":true,"paper":"/paper/fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/icml18-jtnn","path":"fast_jtnn/jtmpn.py","file_url":"https://github.com/wengong-jin/icml18-jtnn/blob/HEAD/fast_jtnn/jtmpn.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":"c0968545f446bb6a","code_sha256_prefix":"c0968545f446bb6a","mcp_get_code":{"code_sha256":"c0968545f446bb6a"}},{"arxiv_id":"2410.09290","arxiv_id_is_arxiv":true,"paper":"/paper/ranking-over-regression-for-bayesian","title":"Ranking over Regression for Bayesian Optimization and Molecule Selection","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gkwt/rbo","path":"rbbo/mpnn.py","file_url":"https://github.com/gkwt/rbo/blob/HEAD/rbbo/mpnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2af7097265be5bad","code_sha256_prefix":"2af7097265be5bad","mcp_get_code":{"code_sha256":"2af7097265be5bad"}},{"arxiv_id":"2311.04419","arxiv_id_is_arxiv":true,"paper":"/paper/pepland-a-large-scale-pre-trained-peptide","title":"PepLand: a large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangruochi/pepland","path":"inference/process.py","file_url":"https://github.com/zhangruochi/pepland/blob/HEAD/inference/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2af7097265be5bad","code_sha256_prefix":"2af7097265be5bad","mcp_get_code":{"code_sha256":"2af7097265be5bad"}},{"arxiv_id":"2305.18451","arxiv_id_is_arxiv":true,"paper":"/paper/shift-robust-molecular-relational-learning","title":"Shift-Robust Molecular Relational Learning with Causal Substructure","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"namkyeong/cmrl","path":"DDI/data.py","file_url":"https://github.com/namkyeong/cmrl/blob/HEAD/DDI/data.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":"3e07b9e0170215ca","code_sha256_prefix":"3e07b9e0170215ca","mcp_get_code":{"code_sha256":"3e07b9e0170215ca"}},{"arxiv_id":"2305.01520","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-graph-information-bottleneck-for","title":"Conditional Graph Information Bottleneck for Molecular Relational Learning","date":"2023-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Namkyeong/CGIB","path":"DrugDrugInteraction/data.py","file_url":"https://github.com/Namkyeong/CGIB/blob/HEAD/DrugDrugInteraction/data.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":"3e07b9e0170215ca","code_sha256_prefix":"3e07b9e0170215ca","mcp_get_code":{"code_sha256":"3e07b9e0170215ca"}},{"arxiv_id":"2204.02337","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-representation-learning-on-1","title":"Multi-Scale Representation Learning on Proteins","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsomnath/holoprot","path":"holoprot/feat/complex.py","file_url":"https://github.com/vsomnath/holoprot/blob/HEAD/holoprot/feat/complex.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":"114c529716f31e58","code_sha256_prefix":"114c529716f31e58","mcp_get_code":{"code_sha256":"114c529716f31e58"}},{"arxiv_id":"2107.00096","arxiv_id_is_arxiv":true,"paper":"/paper/improving-black-box-optimization-in-vae","title":"Improving black-box optimization in VAE latent space using decoder uncertainty","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pascalnotin/uncertainty_guided_optimization","path":"JTVAE/fast_jtnn/jtmpn.py","file_url":"https://github.com/pascalnotin/uncertainty_guided_optimization/blob/HEAD/JTVAE/fast_jtnn/jtmpn.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":"5fe179a1fb051e63","code_sha256_prefix":"5fe179a1fb051e63","mcp_get_code":{"code_sha256":"5fe179a1fb051e63"}},{"arxiv_id":"2104.04987","arxiv_id_is_arxiv":true,"paper":"/paper/autogl-a-library-for-automated-graph-learning","title":"AutoGL: A Library for Automated Graph Learning","date":"2021-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thumnlab/autogl-light","path":"example/GNNUQ_NAS/gnn_uq/data_utils.py","file_url":"https://github.com/thumnlab/autogl-light/blob/HEAD/example/GNNUQ_NAS/gnn_uq/data_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2af7097265be5bad","code_sha256_prefix":"2af7097265be5bad","mcp_get_code":{"code_sha256":"2af7097265be5bad"}},{"arxiv_id":"2010.03951","arxiv_id_is_arxiv":true,"paper":"/paper/moldesigner-interactive-design-of-efficacious","title":"MolDesigner: Interactive Design of Efficacious Drugs with Deep Learning","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kexinhuang12345/DeepPurpose","path":"DeepPurpose/chemutils.py","file_url":"https://github.com/kexinhuang12345/DeepPurpose/blob/HEAD/DeepPurpose/chemutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22d11ea269e3dc0f","code_sha256_prefix":"22d11ea269e3dc0f","mcp_get_code":{"code_sha256":"22d11ea269e3dc0f"}},{"arxiv_id":"1904.01561","arxiv_id_is_arxiv":true,"paper":"/paper/are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tingweidaniel/chemprop_atomicfp_save_depth_final","path":"chemprop/features/featurization.py","file_url":"https://github.com/tingweidaniel/chemprop_atomicfp_save_depth_final/blob/HEAD/chemprop/features/featurization.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":"3e07b9e0170215ca","code_sha256_prefix":"3e07b9e0170215ca","mcp_get_code":{"code_sha256":"3e07b9e0170215ca"}},{"arxiv_id":"1904.01561","arxiv_id_is_arxiv":true,"paper":"/paper/are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous20201002/chemprop","path":"chemprop/features/featurization.py","file_url":"https://github.com/anonymous20201002/chemprop/blob/HEAD/chemprop/features/featurization.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":"49ebe299656c7302","code_sha256_prefix":"49ebe299656c7302","mcp_get_code":{"code_sha256":"49ebe299656c7302"}},{"arxiv_id":"1812.01070","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multimodal-graph-to-graph-1","title":"Learning Multimodal Graph-to-Graph Translation for Molecular Optimization","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/iclr19-graph2graph","path":"fast_jtnn/jtmpn.py","file_url":"https://github.com/wengong-jin/iclr19-graph2graph/blob/HEAD/fast_jtnn/jtmpn.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":"c0968545f446bb6a","code_sha256_prefix":"c0968545f446bb6a","mcp_get_code":{"code_sha256":"c0968545f446bb6a"}}],"record_sha256":"6d9a6e8850b996d6d0d9b50b722ffd37db5e5ca21a9cb5a0b4786362f209a862","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}