{"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/apply","entry":"apply","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":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":2},"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.09642","arxiv_id_is_arxiv":true,"paper":"/paper/open-sora-2-0-training-a-commercial-level","title":"Open-Sora 2.0: Training a Commercial-Level Video Generation Model in $200k","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hpcaitech/open-sora","path":"opensora/datasets/sampler.py","file_url":"https://github.com/hpcaitech/open-sora/blob/HEAD/opensora/datasets/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, hpcaitech/open-sora, 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":"6ddc087f93460147","code_sha256_prefix":"6ddc087f93460147","mcp_get_code":{"code_sha256":"6ddc087f93460147"}},{"arxiv_id":"2502.09507","arxiv_id_is_arxiv":true,"paper":"/paper/when-and-how-does-clip-enable-domain-and","title":"When and How Does CLIP Enable Domain and Compositional Generalization?","date":"2025-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ndif-team/nnsight","path":"src/nnsight/util.py","file_url":"https://github.com/ndif-team/nnsight/blob/HEAD/src/nnsight/util.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":"013ac77858f729a5","code_sha256_prefix":"013ac77858f729a5","mcp_get_code":{"code_sha256":"013ac77858f729a5"}},{"arxiv_id":"2407.14561","arxiv_id_is_arxiv":true,"paper":"/paper/nnsight-and-ndif-democratizing-access-to","title":"NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jadenfiotto-kaufman/nnsight","path":"src/nnsight/util.py","file_url":"https://github.com/jadenfiotto-kaufman/nnsight/blob/HEAD/src/nnsight/util.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":"013ac77858f729a5","code_sha256_prefix":"013ac77858f729a5","mcp_get_code":{"code_sha256":"013ac77858f729a5"}},{"arxiv_id":"2401.00096","arxiv_id_is_arxiv":true,"paper":"/paper/a-foundation-model-for-atomistic-materials","title":"A foundation model for atomistic materials chemistry","date":null,"month_inferred_from_arxiv_id":"2024-01","title_source":"archive","repo":"zincware/zntrack","path":"zntrack/apply.py","file_url":"https://github.com/zincware/zntrack/blob/HEAD/zntrack/apply.py","status":"unverified","verification_level":0,"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":"0edf6444ae0ed639","code_sha256_prefix":"0edf6444ae0ed639","mcp_get_code":{"code_sha256":"0edf6444ae0ed639"}},{"arxiv_id":"2310.05862","arxiv_id_is_arxiv":true,"paper":"/paper/better-safe-than-sorry-pre-training-clip","title":"Better Safe than Sorry: Pre-training CLIP against Targeted Data Poisoning and Backdoor Attacks","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d36be288b124bd8b","code_sha256_prefix":"d36be288b124bd8b","mcp_get_code":{"code_sha256":"d36be288b124bd8b"}},{"arxiv_id":"2303.06854","arxiv_id_is_arxiv":true,"paper":"/paper/robust-contrastive-language-image-pretraining","title":"Robust Contrastive Language-Image Pre-training against Data Poisoning and Backdoor Attacks","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d36be288b124bd8b","code_sha256_prefix":"d36be288b124bd8b","mcp_get_code":{"code_sha256":"d36be288b124bd8b"}},{"arxiv_id":"2205.14459","arxiv_id_is_arxiv":true,"paper":"/paper/cyclip-cyclic-contrastive-language-image","title":"CyCLIP: Cyclic Contrastive Language-Image Pretraining","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goel-shashank/CyCLIP","path":"utils/download.py","file_url":"https://github.com/goel-shashank/CyCLIP/blob/HEAD/utils/download.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, goel-shashank/CyCLIP when it was checked","code_sha256":"d36be288b124bd8b","code_sha256_prefix":"d36be288b124bd8b","mcp_get_code":{"code_sha256":"d36be288b124bd8b"}},{"arxiv_id":"2010.08895","arxiv_id_is_arxiv":true,"paper":"/paper/fourier-neural-operator-for-parametric-1","title":"Fourier Neural Operator for Parametric Partial Differential Equations","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sala-group/autows-bench-101","path":"datasets/domainnet/generate_dataset.py","file_url":"https://github.com/sala-group/autows-bench-101/blob/HEAD/datasets/domainnet/generate_dataset.py","status":"unverified","verification_level":0,"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":"07ee8af22f7425f5","code_sha256_prefix":"07ee8af22f7425f5","mcp_get_code":{"code_sha256":"07ee8af22f7425f5"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KohMat/carracing-dreamer","path":"dreamer/utils/apply.py","file_url":"https://github.com/KohMat/carracing-dreamer/blob/HEAD/dreamer/utils/apply.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":"956ceb6333c8ac66","code_sha256_prefix":"956ceb6333c8ac66","mcp_get_code":{"code_sha256":"956ceb6333c8ac66"}},{"arxiv_id":"1606.04582","arxiv_id_is_arxiv":true,"paper":"/paper/query-reduction-networks-for-question","title":"Query-Reduction Networks for Question Answering","date":"2016-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uwnlp/qrn","path":"qa2hypo.py","file_url":"https://github.com/uwnlp/qrn/blob/HEAD/qa2hypo.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":"614cd4ff5ed0b119","code_sha256_prefix":"614cd4ff5ed0b119","mcp_get_code":{"code_sha256":"614cd4ff5ed0b119"}}],"record_sha256":"449dc663af7d72bc779023942535966e4135fa9d4c3065e25d7f8149ce8c5b35","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}