{"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/criterion","entry":"criterion","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":14,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":4,"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":15,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":5,"n_places":15,"n_places_pointer_only":9,"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":4,"ran_fixture":0,"ran":5,"unverified":4},"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":"2412.16483","arxiv_id_is_arxiv":true,"paper":"/paper/mol-mamba-enhancing-molecular-representation","title":"MOL-Mamba: Enhancing Molecular Representation with Structural & Electronic Insights","date":"2024-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xian-sh/mol-mamba","path":"models/mamba_fuser.py","file_url":"https://github.com/xian-sh/mol-mamba/blob/HEAD/models/mamba_fuser.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":"06ea4a05299d8d58","code_sha256_prefix":"06ea4a05299d8d58","mcp_get_code":{"code_sha256":"06ea4a05299d8d58"}},{"arxiv_id":"2410.21802","arxiv_id_is_arxiv":true,"paper":"/paper/text-guided-attention-is-all-you-need-for","title":"Text-Guided Attention is All You Need for Zero-Shot Robustness in Vision-Language Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyblue424/tga-zsr","path":"TGA-ZSR.py","file_url":"https://github.com/zhyblue424/tga-zsr/blob/HEAD/TGA-ZSR.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, zhyblue424/tga-zsr when it was checked","code_sha256":"daa67f82354dea06","code_sha256_prefix":"daa67f82354dea06","mcp_get_code":{"code_sha256":"daa67f82354dea06"}},{"arxiv_id":"2410.21802","arxiv_id_is_arxiv":true,"paper":"/paper/text-guided-attention-is-all-you-need-for","title":"Text-Guided Attention is All You Need for Zero-Shot Robustness in Vision-Language Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyblue424/TGA-ZSR","path":"Comp-TGA.py","file_url":"https://github.com/zhyblue424/TGA-ZSR/blob/HEAD/Comp-TGA.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, zhyblue424/TGA-ZSR when it was checked","code_sha256":"c70416fb0d5422ce","code_sha256_prefix":"c70416fb0d5422ce","mcp_get_code":{"code_sha256":"c70416fb0d5422ce"}},{"arxiv_id":"2406.03794","arxiv_id_is_arxiv":true,"paper":"/paper/infusing-self-consistency-into-density","title":"Infusing Self-Consistency into Density Functional Theory Hamiltonian Prediction via Deep Equilibrium Models","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zun-wang/deqhnet","path":"src/QHNet/train_wH.py","file_url":"https://github.com/zun-wang/deqhnet/blob/HEAD/src/QHNet/train_wH.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, zun-wang/deqhnet when it was checked","code_sha256":"e0be8786de302cc4","code_sha256_prefix":"e0be8786de302cc4","mcp_get_code":{"code_sha256":"e0be8786de302cc4"}},{"arxiv_id":"2405.03342","arxiv_id_is_arxiv":true,"paper":"/paper/doubly-robust-causal-effect-estimation-under","title":"Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DMIRLAB-Group/TNet","path":"src/experiment.py","file_url":"https://github.com/DMIRLAB-Group/TNet/blob/HEAD/src/experiment.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, DMIRLAB-Group/TNet when it was checked","code_sha256":"dfe683cc11eadebf","code_sha256_prefix":"dfe683cc11eadebf","mcp_get_code":{"code_sha256":"dfe683cc11eadebf"}},{"arxiv_id":"2312.05583","arxiv_id_is_arxiv":true,"paper":"/paper/better-neural-pde-solvers-through-data-free","title":"Better Neural PDE Solvers Through Data-Free Mesh Movers","date":"2023-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peiyannn/mm-pde","path":"mmpde.py","file_url":"https://github.com/peiyannn/mm-pde/blob/HEAD/mmpde.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, peiyannn/mm-pde when it was checked","code_sha256":"25e59809f56a2294","code_sha256_prefix":"25e59809f56a2294","mcp_get_code":{"code_sha256":"25e59809f56a2294"}},{"arxiv_id":"2310.15440","arxiv_id_is_arxiv":true,"paper":"/paper/learning-dynamics-in-linear-vae-posterior","title":"Learning Dynamics in Linear VAE: Posterior Collapse Threshold, Superfluous Latent Space Pitfalls, and Speedup with KL Annealing","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuma-Ichikawa/LearningDynamicsVAE","path":"src/vae.py","file_url":"https://github.com/Yuma-Ichikawa/LearningDynamicsVAE/blob/HEAD/src/vae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Yuma-Ichikawa/LearningDynamicsVAE when it was checked","code_sha256":"ad03c46f9887b15e","code_sha256_prefix":"ad03c46f9887b15e","mcp_get_code":{"code_sha256":"ad03c46f9887b15e"}},{"arxiv_id":"2309.07663","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-size-dependence-of-rate-distortion","title":"High-dimensional Asymptotics of VAEs: Threshold of Posterior Collapse and Dataset-Size Dependence of Rate-Distortion Curve","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuma-ichikawa/vae-replica","path":"src/vae.py","file_url":"https://github.com/yuma-ichikawa/vae-replica/blob/HEAD/src/vae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, yuma-ichikawa/vae-replica, is not in the permissive set Syntology serves inline","code_sha256":"33e8ef13d600b950","code_sha256_prefix":"33e8ef13d600b950","mcp_get_code":{"code_sha256":"33e8ef13d600b950"}},{"arxiv_id":"2308.14575","arxiv_id_is_arxiv":true,"paper":"/paper/referring-image-segmentation-using-text","title":"Referring Image Segmentation Using Text Supervision","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fawnliu/tris","path":"model/model_stage2.py","file_url":"https://github.com/fawnliu/tris/blob/HEAD/model/model_stage2.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":"bf2dd3002bd9481d","code_sha256_prefix":"bf2dd3002bd9481d","mcp_get_code":{"code_sha256":"bf2dd3002bd9481d"}},{"arxiv_id":"2301.11556","arxiv_id_is_arxiv":true,"paper":"/paper/conformal-inference-is-almost-free-for-neural","title":"Conformal inference is (almost) free for neural networks trained with early stopping","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziyiliang/conformalized_early_stopping","path":"experiments/exp_mc.py","file_url":"https://github.com/ziyiliang/conformalized_early_stopping/blob/HEAD/experiments/exp_mc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ziyiliang/conformalized_early_stopping when it was checked","code_sha256":"5ba87e6d762c036f","code_sha256_prefix":"5ba87e6d762c036f","mcp_get_code":{"code_sha256":"5ba87e6d762c036f"}},{"arxiv_id":"2207.09455","arxiv_id_is_arxiv":true,"paper":"/paper/to-update-or-not-to-update-neurons-at","title":"To update or not to update? Neurons at equilibrium in deep models","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eidoslab/neq","path":"src/train_segmentation.py","file_url":"https://github.com/eidoslab/neq/blob/HEAD/src/train_segmentation.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":"d6c803410533ccf3","code_sha256_prefix":"d6c803410533ccf3","mcp_get_code":{"code_sha256":"d6c803410533ccf3"}},{"arxiv_id":"2104.13918","arxiv_id_is_arxiv":true,"paper":"/paper/high-resolution-optical-flow-from-1d","title":"High-Resolution Optical Flow from 1D Attention and Correlation","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofeixu/flow1d","path":"loss.py","file_url":"https://github.com/haofeixu/flow1d/blob/HEAD/loss.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":"a9cf5d488feb28b4","code_sha256_prefix":"a9cf5d488feb28b4","mcp_get_code":{"code_sha256":"a9cf5d488feb28b4"}},{"arxiv_id":"2102.07156","arxiv_id_is_arxiv":true,"paper":"/paper/chipnet-budget-aware-pruning-with-heaviside-1","title":"ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations","date":"2021-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"transmuteAI/ChipNet","path":"finetuning.py","file_url":"https://github.com/transmuteAI/ChipNet/blob/HEAD/finetuning.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f55e722fbffa31c","code_sha256_prefix":"5f55e722fbffa31c","mcp_get_code":{"code_sha256":"5f55e722fbffa31c"}},{"arxiv_id":"2010.00827","arxiv_id_is_arxiv":true,"paper":"/paper/neural-thompson-sampling","title":"Neural Thompson Sampling","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RonyAbecidan/Neural-Thompson-Sampling","path":"Experiments/NeuralTS.py","file_url":"https://github.com/RonyAbecidan/Neural-Thompson-Sampling/blob/HEAD/Experiments/NeuralTS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, RonyAbecidan/Neural-Thompson-Sampling when it was checked","code_sha256":"503cf9bdb8ab553a","code_sha256_prefix":"503cf9bdb8ab553a","mcp_get_code":{"code_sha256":"503cf9bdb8ab553a"}},{"arxiv_id":"1911.11763","arxiv_id_is_arxiv":true,"paper":"/paper/superglue-learning-feature-matching-with","title":"SuperGlue: Learning Feature Matching with Graph Neural Networks","date":"2019-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucuapps/openglue","path":"utils/losses.py","file_url":"https://github.com/ucuapps/openglue/blob/HEAD/utils/losses.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":"94be4c45dc8984f4","code_sha256_prefix":"94be4c45dc8984f4","mcp_get_code":{"code_sha256":"94be4c45dc8984f4"}}],"record_sha256":"bc751e1791cd53fcf8c86ad6e2ecf075db9967384bb0e9d2ca409f4098637ae5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}