{"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/torchify-dict","entry":"torchify_dict","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":12,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":1,"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":2,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":12,"n_places_pointer_only_link_open":3,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"2601.22466","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22466","title":"EvoEGF-Mol: Evolving Exponential Geodesic Flow for Structure-based Drug Design","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"BLEACH366/EvoEGF-Mol","path":"core/datasets/pl_data.py","file_url":"https://github.com/BLEACH366/EvoEGF-Mol/blob/HEAD/core/datasets/pl_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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, BLEACH366/EvoEGF-Mol, is not in the permissive set Syntology serves inline","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2509.01486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01486","title":"Prior-Guided Flow Matching for Target-Aware Molecule Design with Learnable Atom Number","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CMACH508/PAFlow","path":"datasets/pl_data.py","file_url":"https://github.com/CMACH508/PAFlow/blob/HEAD/datasets/pl_data.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, CMACH508/PAFlow when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2507.05503","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.05503","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"huang3170/MolForm","path":"datasets/pl_data.py","file_url":"https://github.com/huang3170/MolForm/blob/HEAD/datasets/pl_data.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, huang3170/MolForm when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2411.13280","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-the-power-of-gradient-guidance-for","title":"Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks","date":"2024-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlgoMole/MolCRAFT","path":"MolCRAFT/core/datasets/pl_data.py","file_url":"https://github.com/AlgoMole/MolCRAFT/blob/HEAD/MolCRAFT/core/datasets/pl_data.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, AlgoMole/MolCRAFT when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2410.20688","arxiv_id_is_arxiv":true,"paper":"/paper/reprogramming-pretrained-target-specific","title":"Reprogramming Pretrained Target-Specific Diffusion Models for Dual-Target Drug Design","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouxiangxin1998/DualDiff","path":"datasets/pl_data.py","file_url":"https://github.com/zhouxiangxin1998/DualDiff/blob/HEAD/datasets/pl_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from BLEACH366/EvoEGF-Mol, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2407.01648","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-target-aware-molecule-diffusion","title":"Aligning Target-Aware Molecule Diffusion Models with Exact Energy Optimization","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/alidiff","path":"datasets/pl_data.py","file_url":"https://github.com/minkaixu/alidiff/blob/HEAD/datasets/pl_data.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, minkaixu/alidiff when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2406.16821","arxiv_id_is_arxiv":true,"paper":"/paper/general-binding-affinity-guidance-for","title":"General Binding Affinity Guidance for Diffusion Models in Structure-Based Drug Design","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ask-berkeley/badger-sbdd","path":"datasets/pl_data.py","file_url":"https://github.com/ask-berkeley/badger-sbdd/blob/HEAD/datasets/pl_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from BLEACH366/EvoEGF-Mol, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2406.01650","arxiv_id_is_arxiv":true,"paper":"/paper/tagmol-target-aware-gradient-guided-molecule","title":"TAGMol: Target-Aware Gradient-guided Molecule Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MoleculeAI/TAGMol","path":"datasets/pl_data.py","file_url":"https://github.com/MoleculeAI/TAGMol/blob/HEAD/datasets/pl_data.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, MoleculeAI/TAGMol when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2403.07902","arxiv_id_is_arxiv":true,"paper":"/paper/decompdiff-diffusion-models-with-decomposed","title":"DecompDiff: Diffusion Models with Decomposed Priors for Structure-Based Drug Design","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/decompdiff","path":"datasets/pl_data.py","file_url":"https://github.com/bytedance/decompdiff/blob/HEAD/datasets/pl_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bytedance/decompdiff (NOASSERTION)","code_sha256":"66be0bd63ba01421","code_sha256_prefix":"66be0bd63ba01421","mcp_get_code":{"code_sha256":"66be0bd63ba01421"}},{"arxiv_id":"2402.18583","arxiv_id_is_arxiv":true,"paper":"/paper/binding-adaptive-diffusion-models-for","title":"Binding-Adaptive Diffusion Models for Structure-Based Drug Design","date":"2024-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLing0818/BindDM","path":"datasets/pl_data.py","file_url":"https://github.com/YangLing0818/BindDM/blob/HEAD/datasets/pl_data.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, YangLing0818/BindDM when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2310.02553","arxiv_id_is_arxiv":true,"paper":"/paper/full-atom-protein-pocket-design-via-iterative","title":"Full-Atom Protein Pocket Design via Iterative Refinement","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/FAIR","path":"utils/data.py","file_url":"https://github.com/zaixizhang/FAIR/blob/HEAD/utils/data.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, zaixizhang/FAIR when it was checked","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}},{"arxiv_id":"2305.07508","arxiv_id_is_arxiv":true,"paper":"/paper/moldiff-addressing-the-atom-bond","title":"MolDiff: Addressing the Atom-Bond Inconsistency Problem in 3D Molecule Diffusion Generation","date":"2023-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pengxingang/moldiff","path":"utils/data.py","file_url":"https://github.com/pengxingang/moldiff/blob/HEAD/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from BLEACH366/EvoEGF-Mol, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"5f7183207256b0a3","code_sha256_prefix":"5f7183207256b0a3","mcp_get_code":{"code_sha256":"5f7183207256b0a3"}}],"record_sha256":"a79585561bd4395257654cd9694134e8a16a0d9ec665c42b8c72165f259e9316","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}