{"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/featurize","entry":"featurize","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":6,"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":1,"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":"2607.23518","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-23518","title":"Chamaileon: Cross-Context Binder Design with Contextualized Modeling and Mixed Sampling","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"caohengyuan/Chamaileon","path":"ProteinMPNN/training/model_utils.py","file_url":"https://github.com/caohengyuan/Chamaileon/blob/HEAD/ProteinMPNN/training/model_utils.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":"c2b57f862d5703b7","code_sha256_prefix":"c2b57f862d5703b7","mcp_get_code":{"code_sha256":"c2b57f862d5703b7"}},{"arxiv_id":"2411.10618","arxiv_id_is_arxiv":true,"paper":"/paper/d-flow-multi-modality-flow-matching-for-d","title":"D-Flow: Multi-modality Flow Matching for D-peptide Design","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":"archive","repo":"smiles724/peptidedesign","path":"ProteinMPNN/training/model_utils.py","file_url":"https://github.com/smiles724/peptidedesign/blob/HEAD/ProteinMPNN/training/model_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, smiles724/peptidedesign when it was checked","code_sha256":"c2b57f862d5703b7","code_sha256_prefix":"c2b57f862d5703b7","mcp_get_code":{"code_sha256":"c2b57f862d5703b7"}},{"arxiv_id":"2407.09809","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-the-privacy-of-reward-functions-in","title":"Preserving the Privacy of Reward Functions in MDPs through Deception","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shshnkreddy/deceptiverl","path":"featurize.py","file_url":"https://github.com/shshnkreddy/deceptiverl/blob/HEAD/featurize.py","status":"ran","verification_level":1,"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, shshnkreddy/deceptiverl when it was checked","code_sha256":"b8e24ae762db8a5b","code_sha256_prefix":"b8e24ae762db8a5b","mcp_get_code":{"code_sha256":"b8e24ae762db8a5b"}},{"arxiv_id":"2406.03141","arxiv_id_is_arxiv":true,"paper":"/paper/floating-anchor-diffusion-model-for-multi","title":"Floating Anchor Diffusion Model for Multi-motif Scaffolding","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/FADiff","path":"ProteinMPNN/training/model_utils.py","file_url":"https://github.com/aim-uofa/FADiff/blob/HEAD/ProteinMPNN/training/model_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, aim-uofa/FADiff when it was checked","code_sha256":"c2b57f862d5703b7","code_sha256_prefix":"c2b57f862d5703b7","mcp_get_code":{"code_sha256":"c2b57f862d5703b7"}},{"arxiv_id":"2402.13956","arxiv_id_is_arxiv":true,"paper":"/paper/can-you-learn-semantics-through-next-word","title":"Can You Learn Semantics Through Next-Word Prediction? The Case of Entailment","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofengwu/entailment-from-lm","path":"trained_classifier.py","file_url":"https://github.com/zhaofengwu/entailment-from-lm/blob/HEAD/trained_classifier.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, zhaofengwu/entailment-from-lm when it was checked","code_sha256":"151c44d02c12763d","code_sha256_prefix":"151c44d02c12763d","mcp_get_code":{"code_sha256":"151c44d02c12763d"}},{"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":"models/data.py","file_url":"https://github.com/zaixizhang/FAIR/blob/HEAD/models/data.py","status":"ran","verification_level":1,"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":"27330a1feb3342e2","code_sha256_prefix":"27330a1feb3342e2","mcp_get_code":{"code_sha256":"27330a1feb3342e2"}},{"arxiv_id":"2207.06616","arxiv_id_is_arxiv":true,"paper":"/paper/antibody-antigen-docking-and-design-via","title":"Antibody-Antigen Docking and Design via Hierarchical Equivariant Refinement","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/abdockgen","path":"bindgen/data.py","file_url":"https://github.com/wengong-jin/abdockgen/blob/HEAD/bindgen/data.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":"12095f84a7833903","code_sha256_prefix":"12095f84a7833903","mcp_get_code":{"code_sha256":"12095f84a7833903"}},{"arxiv_id":"2112.01049","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-over-permutation-spaces","title":"Bayesian Optimization over Permutation Spaces","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aryandeshwal/bops","path":"floorplanning/floorplan_mallows.py","file_url":"https://github.com/aryandeshwal/bops/blob/HEAD/floorplanning/floorplan_mallows.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, aryandeshwal/bops when it was checked","code_sha256":"9a9f0479b1770eb7","code_sha256_prefix":"9a9f0479b1770eb7","mcp_get_code":{"code_sha256":"9a9f0479b1770eb7"}}],"record_sha256":"dc0ee21caa330085fec2a49d2f62d30a1447d01db1ae8c8bd01e645b93848fcf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}