{"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/view","entry":"View","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":9,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":3},"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":"2503.09679","arxiv_id_is_arxiv":true,"paper":"/paper/dress-disentangled-representation-based-self","title":"DRESS: Disentangled Representation-based Self-Supervised Meta-Learning for Diverse Tasks","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layer6ai-labs/DRESS","path":"encoders/diti.py","file_url":"https://github.com/layer6ai-labs/DRESS/blob/HEAD/encoders/diti.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":"a5788ad13b47f3b3","code_sha256_prefix":"a5788ad13b47f3b3","mcp_get_code":{"code_sha256":"a5788ad13b47f3b3"}},{"arxiv_id":"2404.12141","arxiv_id_is_arxiv":true,"paper":"/paper/molcraft-structure-based-drug-design-in","title":"MolCRAFT: Structure-Based Drug Design in Continuous Parameter Space","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gnina/models","path":"pytorch/default2018_model.py","file_url":"https://github.com/gnina/models/blob/HEAD/pytorch/default2018_model.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, gnina/models when it was checked","code_sha256":"340f867cc788cfa1","code_sha256_prefix":"340f867cc788cfa1","mcp_get_code":{"code_sha256":"340f867cc788cfa1"}},{"arxiv_id":"2403.09383","arxiv_id_is_arxiv":true,"paper":"/paper/pantypes-diverse-representatives-for-self","title":"Pantypes: Diverse Representatives for Self-Explainable Models","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuneDK93/pantypes","path":"model.py","file_url":"https://github.com/RuneDK93/pantypes/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"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, RuneDK93/pantypes when it was checked","code_sha256":"6e04aa591e12d586","code_sha256_prefix":"6e04aa591e12d586","mcp_get_code":{"code_sha256":"6e04aa591e12d586"}},{"arxiv_id":"2403.07030","arxiv_id_is_arxiv":true,"paper":"/paper/aug-kd-anchor-based-mixup-generation-for-out","title":"AuG-KD: Anchor-Based Mixup Generation for Out-of-Domain Knowledge Distillation","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ishikura-a/aug-kd","path":"models/anchor_net.py","file_url":"https://github.com/ishikura-a/aug-kd/blob/HEAD/models/anchor_net.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":"1de743bd8f819500","code_sha256_prefix":"1de743bd8f819500","mcp_get_code":{"code_sha256":"1de743bd8f819500"}},{"arxiv_id":"2310.17325","arxiv_id_is_arxiv":true,"paper":"/paper/c-disentanglement-discovering-causally","title":"C-Disentanglement: Discovering Causally-Independent Generative Factors under an Inductive Bias of Confounder","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xliu1231/causal_disentangle","path":"causalvae.py","file_url":"https://github.com/xliu1231/causal_disentangle/blob/HEAD/causalvae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xliu1231/causal_disentangle when it was checked","code_sha256":"6ff7a35d695077c2","code_sha256_prefix":"6ff7a35d695077c2","mcp_get_code":{"code_sha256":"6ff7a35d695077c2"}},{"arxiv_id":"2306.16058","arxiv_id_is_arxiv":true,"paper":"/paper/duet-2d-structured-and-approximately","title":"DUET: 2D Structured and Approximately Equivariant Representations","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-duet","path":"duet/models/duet.py","file_url":"https://github.com/apple/ml-duet/blob/HEAD/duet/models/duet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, apple/ml-duet (NOASSERTION)","code_sha256":"931e09f1354d129a","code_sha256_prefix":"931e09f1354d129a","mcp_get_code":{"code_sha256":"931e09f1354d129a"}},{"arxiv_id":"2105.14203","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-instance-based-interpretability","title":"Understanding Instance-based Interpretability of Variational Auto-Encoders","date":"2021-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fengnima/vae-tracin-pytorch","path":"tracin.py","file_url":"https://github.com/fengnima/vae-tracin-pytorch/blob/HEAD/tracin.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d98e6eb646f75ed8","code_sha256_prefix":"d98e6eb646f75ed8","mcp_get_code":{"code_sha256":"d98e6eb646f75ed8"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangzh13/StyleGAN.pytorch","path":"models/GAN.py","file_url":"https://github.com/huangzh13/StyleGAN.pytorch/blob/HEAD/models/GAN.py","status":"unverified","verification_level":0,"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, huangzh13/StyleGAN.pytorch (NOASSERTION)","code_sha256":"a6e3833004ca5226","code_sha256_prefix":"a6e3833004ca5226","mcp_get_code":{"code_sha256":"a6e3833004ca5226"}},{"arxiv_id":"1802.03268","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbyte64/pytorch-dagsearch","path":"dagsearch/dag.py","file_url":"https://github.com/zbyte64/pytorch-dagsearch/blob/HEAD/dagsearch/dag.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, zbyte64/pytorch-dagsearch when it was checked","code_sha256":"d44cc1b50bd34d5c","code_sha256_prefix":"d44cc1b50bd34d5c","mcp_get_code":{"code_sha256":"d44cc1b50bd34d5c"}}],"record_sha256":"4906b2110323980ffd815691ac715afb37eb13b04866760737e3657c2b6b5a64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}