{"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/partialclass","entry":"partialclass","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":10,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":14,"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":5,"ran_fixture":0,"ran":2,"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":"2503.17797","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-fourier-neural-operators-with-local","title":"Enhancing Fourier Neural Operators with Local Spatial Features","date":"2025-03-22","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":"2041982f0cf2a6be","code_sha256_prefix":"2041982f0cf2a6be","mcp_get_code":{"code_sha256":"2041982f0cf2a6be"}},{"arxiv_id":"2405.17398","arxiv_id_is_arxiv":true,"paper":"/paper/vista-a-generalizable-driving-world-model","title":"Vista: A Generalizable Driving World Model with High Fidelity and Versatile Controllability","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/vista","path":"vwm/models/diffusion.py","file_url":"https://github.com/opendrivelab/vista/blob/HEAD/vwm/models/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c91c205a5fcd562b","code_sha256_prefix":"c91c205a5fcd562b","mcp_get_code":{"code_sha256":"c91c205a5fcd562b"}},{"arxiv_id":"2405.17211","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-refiner-fine-tuning-of-accurate","title":"Spectral-Refiner: Accurate Fine-Tuning of Spatiotemporal Fourier Neural Operator for Turbulent Flows","date":"2024-05-27","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":"fc02f5f0a7b4896e","code_sha256_prefix":"fc02f5f0a7b4896e","mcp_get_code":{"code_sha256":"fc02f5f0a7b4896e"}},{"arxiv_id":"2405.17211","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-refiner-fine-tuning-of-accurate","title":"Spectral-Refiner: Accurate Fine-Tuning of Spatiotemporal Fourier Neural Operator for Turbulent Flows","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuraloperator/neuraloperator","path":"neuralop/models/fno.py","file_url":"https://github.com/neuraloperator/neuraloperator/blob/HEAD/neuralop/models/fno.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2041982f0cf2a6be","code_sha256_prefix":"2041982f0cf2a6be","mcp_get_code":{"code_sha256":"2041982f0cf2a6be"}},{"arxiv_id":"2404.04240","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-conditional-optimal-transport-through","title":"Dynamic Conditional Optimal Transport through Simulation-Free Flows","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gavinkerrigan/cot_fm","path":"models/fourier_neural_operator.py","file_url":"https://github.com/gavinkerrigan/cot_fm/blob/HEAD/models/fourier_neural_operator.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, gavinkerrigan/cot_fm when it was checked","code_sha256":"34aed3ff0fa7e833","code_sha256_prefix":"34aed3ff0fa7e833","mcp_get_code":{"code_sha256":"34aed3ff0fa7e833"}},{"arxiv_id":"2402.06244","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-and-enhancing-multi-modal","title":"Quantifying and Enhancing Multi-modal Robustness with Modality Preference","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeWu-Lab/Certifiable-Robust-Multi-modal-Training","path":"utils.py","file_url":"https://github.com/GeWu-Lab/Certifiable-Robust-Multi-modal-Training/blob/HEAD/utils.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, GeWu-Lab/Certifiable-Robust-Multi-modal-Training when it was checked","code_sha256":"0ab7cbcb8ecef516","code_sha256_prefix":"0ab7cbcb8ecef516","mcp_get_code":{"code_sha256":"0ab7cbcb8ecef516"}},{"arxiv_id":"2307.15034","arxiv_id_is_arxiv":true,"paper":"/paper/speeding-up-fourier-neural-operators-via","title":"Guaranteed Approximation Bounds for Mixed-Precision Neural Operators","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuraloperator/neuraloperator","path":"neuralop/models/fno.py","file_url":"https://github.com/neuraloperator/neuraloperator/blob/HEAD/neuralop/models/fno.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc02f5f0a7b4896e","code_sha256_prefix":"fc02f5f0a7b4896e","mcp_get_code":{"code_sha256":"fc02f5f0a7b4896e"}},{"arxiv_id":"2303.03000","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-learning-on-large-datasets-for-the","title":"Transfer learning on large datasets for the accurate prediction of material properties","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"hyllios/cgat","path":"CGAT/Hypernetworksmp.py","file_url":"https://github.com/hyllios/cgat/blob/HEAD/CGAT/Hypernetworksmp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61098cd5c9624563","code_sha256_prefix":"61098cd5c9624563","mcp_get_code":{"code_sha256":"61098cd5c9624563"}},{"arxiv_id":"2302.06912","arxiv_id_is_arxiv":true,"paper":"/paper/robust-deep-reinforcement-learning-through-2","title":"Regret-Based Defense in Adversarial Reinforcement Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romanbelaire/robust-ccer","path":"code_mujoco/ccer/policy_gradients/models.py","file_url":"https://github.com/romanbelaire/robust-ccer/blob/HEAD/code_mujoco/ccer/policy_gradients/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61098cd5c9624563","code_sha256_prefix":"61098cd5c9624563","mcp_get_code":{"code_sha256":"61098cd5c9624563"}},{"arxiv_id":"2206.08353","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-how-machines-can-learn","title":"Towards Understanding How Machines Can Learn Causal Overhypotheses","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cannylab/casual_overhypotheses","path":"driver.py","file_url":"https://github.com/cannylab/casual_overhypotheses/blob/HEAD/driver.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":"5dde12e77fb722b8","code_sha256_prefix":"5dde12e77fb722b8","mcp_get_code":{"code_sha256":"5dde12e77fb722b8"}},{"arxiv_id":"2205.09853","arxiv_id_is_arxiv":true,"paper":"/paper/masked-conditional-video-diffusion-for","title":"MCVD: Masked Conditional Video Diffusion for Prediction, Generation, and Interpolation","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voletiv/mcvd-pytorch","path":"models/unet.py","file_url":"https://github.com/voletiv/mcvd-pytorch/blob/HEAD/models/unet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61098cd5c9624563","code_sha256_prefix":"61098cd5c9624563","mcp_get_code":{"code_sha256":"61098cd5c9624563"}},{"arxiv_id":"2009.05475","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-score-matching-and-improved","title":"Adversarial score matching and improved sampling for image generation","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexiaJM/AdversarialConsistentScoreMatching","path":"models/UNet.py","file_url":"https://github.com/AlexiaJM/AdversarialConsistentScoreMatching/blob/HEAD/models/UNet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61098cd5c9624563","code_sha256_prefix":"61098cd5c9624563","mcp_get_code":{"code_sha256":"61098cd5c9624563"}},{"arxiv_id":"1906.01618","arxiv_id_is_arxiv":true,"paper":"/paper/scene-representation-networks-continuous-3d","title":"Scene Representation Networks: Continuous 3D-Structure-Aware Neural Scene Representations","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsitzmann/scene-representation-networks","path":"hyperlayers.py","file_url":"https://github.com/vsitzmann/scene-representation-networks/blob/HEAD/hyperlayers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61098cd5c9624563","code_sha256_prefix":"61098cd5c9624563","mcp_get_code":{"code_sha256":"61098cd5c9624563"}},{"arxiv_id":"2021.findings-emnlp.130","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.130","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nutcrtnk/DHGNet","path":"src/utils.py","file_url":"https://github.com/nutcrtnk/DHGNet/blob/HEAD/src/utils.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":"911e8a7d9706e726","code_sha256_prefix":"911e8a7d9706e726","mcp_get_code":{"code_sha256":"911e8a7d9706e726"}}],"record_sha256":"12a21cd24299c2d97aed139525788cec247be47d4d641d4871a0b73810d1b997","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}