{"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/soft-threshold","entry":"soft_threshold","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":2,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":13,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":0,"ran":3,"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":"2606.27802","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27802","title":"Accelerating Hierarchical Sparse Predictive Coding with Hybrid Amortized Inference","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"KazuhisaFujita/HSC","path":"HierarchicalSparseCoding.py","file_url":"https://github.com/KazuhisaFujita/HSC/blob/HEAD/HierarchicalSparseCoding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d8930ceaf1d3a3e1","code_sha256_prefix":"d8930ceaf1d3a3e1","mcp_get_code":{"code_sha256":"d8930ceaf1d3a3e1"}},{"arxiv_id":"2604.14519","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14519","title":"CI-CBM: Class-Incremental Concept Bottleneck Model for Interpretable Continual Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"importAmir/CI-CBM","path":"glm_saga/elasticnet.py","file_url":"https://github.com/importAmir/CI-CBM/blob/HEAD/glm_saga/elasticnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, importAmir/CI-CBM when it was checked","code_sha256":"bfe4b187a1c5aeaf","code_sha256_prefix":"bfe4b187a1c5aeaf","mcp_get_code":{"code_sha256":"bfe4b187a1c5aeaf"}},{"arxiv_id":"2408.17396","arxiv_id_is_arxiv":true,"paper":"/paper/fairness-aware-estimation-of-graphical-models","title":"Fairness-Aware Estimation of Graphical Models","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pennshenlab/fair_gms","path":"GRAPH_Framework-main/utils/common.py","file_url":"https://github.com/pennshenlab/fair_gms/blob/HEAD/GRAPH_Framework-main/utils/common.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":"0e13dc21d49f0caf","code_sha256_prefix":"0e13dc21d49f0caf","mcp_get_code":{"code_sha256":"0e13dc21d49f0caf"}},{"arxiv_id":"2408.01432","arxiv_id_is_arxiv":true,"paper":"/paper/vlg-cbm-training-concept-bottleneck-models","title":"VLG-CBM: Training Concept Bottleneck Models with Vision-Language Guidance","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Trustworthy-ML-Lab/Label-free-CBM","path":"glm_saga/elasticnet.py","file_url":"https://github.com/Trustworthy-ML-Lab/Label-free-CBM/blob/HEAD/glm_saga/elasticnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Trustworthy-ML-Lab/Label-free-CBM when it was checked","code_sha256":"bfe4b187a1c5aeaf","code_sha256_prefix":"bfe4b187a1c5aeaf","mcp_get_code":{"code_sha256":"bfe4b187a1c5aeaf"}},{"arxiv_id":"2405.06855","arxiv_id_is_arxiv":true,"paper":"/paper/linear-explanations-for-individual-neurons","title":"Linear Explanations for Individual Neurons","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Trustworthy-ML-Lab/Linear-Explanations","path":"linear_explanation.py","file_url":"https://github.com/Trustworthy-ML-Lab/Linear-Explanations/blob/HEAD/linear_explanation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Trustworthy-ML-Lab/Linear-Explanations when it was checked","code_sha256":"bfe4b187a1c5aeaf","code_sha256_prefix":"bfe4b187a1c5aeaf","mcp_get_code":{"code_sha256":"bfe4b187a1c5aeaf"}},{"arxiv_id":"2211.11323","arxiv_id_is_arxiv":true,"paper":"/paper/a-generalized-eigengame-with-extensions-to","title":"A Generalized EigenGame with Extensions to Multiview Representation Learning","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jameschapman19/cca_zoo","path":"cca_zoo/_utils/_linalg.py","file_url":"https://github.com/jameschapman19/cca_zoo/blob/HEAD/cca_zoo/_utils/_linalg.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":"21818c213b2a1315","code_sha256_prefix":"21818c213b2a1315","mcp_get_code":{"code_sha256":"21818c213b2a1315"}},{"arxiv_id":"2211.06302","arxiv_id_is_arxiv":true,"paper":"/paper/graph-conditioned-mlp-for-high-dimensional","title":"GCondNet: A Novel Method for Improving Neural Networks on Small High-Dimensional Tabular Data","date":"2022-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lasso-net/lassonet","path":"lassonet/model.py","file_url":"https://github.com/lasso-net/lassonet/blob/HEAD/lassonet/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f9208771cec0b61","code_sha256_prefix":"3f9208771cec0b61","mcp_get_code":{"code_sha256":"3f9208771cec0b61"}},{"arxiv_id":"2205.03665","arxiv_id_is_arxiv":true,"paper":"/paper/variational-sparse-coding-with-learned","title":"Variational Sparse Coding with Learned Thresholding","date":"2022-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfallah/variational-sparse-coding","path":"model/lista.py","file_url":"https://github.com/kfallah/variational-sparse-coding/blob/HEAD/model/lista.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, kfallah/variational-sparse-coding when it was checked","code_sha256":"b082bfb3081bcf63","code_sha256_prefix":"b082bfb3081bcf63","mcp_get_code":{"code_sha256":"b082bfb3081bcf63"}},{"arxiv_id":"2205.03665","arxiv_id_is_arxiv":true,"paper":"/paper/variational-sparse-coding-with-learned","title":"Variational Sparse Coding with Learned Thresholding","date":"2022-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfallah/manifold-contrastive","path":"src/model/manifold/vi_encoder.py","file_url":"https://github.com/kfallah/manifold-contrastive/blob/HEAD/src/model/manifold/vi_encoder.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, kfallah/manifold-contrastive when it was checked","code_sha256":"63e0ab2c6652828b","code_sha256_prefix":"63e0ab2c6652828b","mcp_get_code":{"code_sha256":"63e0ab2c6652828b"}},{"arxiv_id":"2105.04857","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-sparse-linear-layers-for","title":"Leveraging Sparse Linear Layers for Debuggable Deep Networks","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MadryLab/glm_saga","path":"glm_saga/elasticnet.py","file_url":"https://github.com/MadryLab/glm_saga/blob/HEAD/glm_saga/elasticnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Trustworthy-ML-Lab/Linear-Explanations, and GitHub detected no licence in that repository when it was checked","code_sha256":"bfe4b187a1c5aeaf","code_sha256_prefix":"bfe4b187a1c5aeaf","mcp_get_code":{"code_sha256":"bfe4b187a1c5aeaf"}},{"arxiv_id":"1907.12207","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-network-with-feature-sparsity","title":"LassoNet: A Neural Network with Feature Sparsity","date":"2019-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilemhadri/lassoNet","path":"lassonet/prox.py","file_url":"https://github.com/ilemhadri/lassoNet/blob/HEAD/lassonet/prox.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f9208771cec0b61","code_sha256_prefix":"3f9208771cec0b61","mcp_get_code":{"code_sha256":"3f9208771cec0b61"}},{"arxiv_id":"1812.04224","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-dimensionality-of-word-embedding","title":"On the Dimensionality of Word Embedding","date":"2018-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaaasssddf/PIP-experiments","path":"PIP_upper_bound/plot_upper_bd.py","file_url":"https://github.com/aaaasssddf/PIP-experiments/blob/HEAD/PIP_upper_bound/plot_upper_bd.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":"a887f553c25857f7","code_sha256_prefix":"a887f553c25857f7","mcp_get_code":{"code_sha256":"a887f553c25857f7"}},{"arxiv_id":"1809.10504","arxiv_id_is_arxiv":true,"paper":"/paper/a-rotation-equivariant-convolutional-neural","title":"A rotation-equivariant convolutional neural network model of primary visual cortex","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aecker/cnn-sys-ident","path":"cnn_sys_ident/architectures/utils.py","file_url":"https://github.com/aecker/cnn-sys-ident/blob/HEAD/cnn_sys_ident/architectures/utils.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":"20c6abdd07d0cabe","code_sha256_prefix":"20c6abdd07d0cabe","mcp_get_code":{"code_sha256":"20c6abdd07d0cabe"}}],"record_sha256":"0fc8a70c13a94bb4ec141d6cea73a95c332930af692657c45271acdb65e9eea1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}