{"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/listify","entry":"listify","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":14,"n_papers_ran_no_instrument_failure":10,"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":11,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":15,"n_places_pointer_only":8,"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":4,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":0},"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":"2604.14397","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14397","title":"Generating Concept Lexicalizations via Dictionary-Based Cross-Lingual Sense Projection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"UAlberta-NLP/ExpandNet","path":"expandnet_step3_project.py","file_url":"https://github.com/UAlberta-NLP/ExpandNet/blob/HEAD/expandnet_step3_project.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UAlberta-NLP/ExpandNet when it was checked","code_sha256":"ce93040de3d6262b","code_sha256_prefix":"ce93040de3d6262b","mcp_get_code":{"code_sha256":"ce93040de3d6262b"}},{"arxiv_id":"2604.01279","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01279","title":"Sven: Singular Value Descent as a Computationally Efficient Natural Gradient Method","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sambt/sven-experiments","path":"experiments/experiment_code/experiment_utils.py","file_url":"https://github.com/sambt/sven-experiments/blob/HEAD/experiments/experiment_code/experiment_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, sambt/sven-experiments when it was checked","code_sha256":"876b02ceac0670c7","code_sha256_prefix":"876b02ceac0670c7","mcp_get_code":{"code_sha256":"876b02ceac0670c7"}},{"arxiv_id":"2506.13485","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-learning-for-biological-sequence","title":"Curriculum Learning for Biological Sequence Prediction: The Case of De Novo Peptide Sequencing","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beam-labs/denovo","path":"ContraNovo/denovo/db_index.py","file_url":"https://github.com/beam-labs/denovo/blob/HEAD/ContraNovo/denovo/db_index.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":"145ed062058f289a","code_sha256_prefix":"145ed062058f289a","mcp_get_code":{"code_sha256":"145ed062058f289a"}},{"arxiv_id":"2409.14507","arxiv_id_is_arxiv":true,"paper":"/paper/a-is-for-absorption-studying-feature","title":"A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoders","date":"2024-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lasr-spelling/sae-spelling","path":"sae_spelling/util.py","file_url":"https://github.com/lasr-spelling/sae-spelling/blob/HEAD/sae_spelling/util.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":"4ea90f6ac63c39b8","code_sha256_prefix":"4ea90f6ac63c39b8","mcp_get_code":{"code_sha256":"4ea90f6ac63c39b8"}},{"arxiv_id":"2407.09751","arxiv_id_is_arxiv":true,"paper":"/paper/taseg-temporal-aggregation-network-for-lidar-1","title":"TASeg: Temporal Aggregation Network for LiDAR Semantic Segmentation","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LittlePey/TASeg","path":"pcseg/optim/fastai_optim.py","file_url":"https://github.com/LittlePey/TASeg/blob/HEAD/pcseg/optim/fastai_optim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03cf34a5c88c655f","code_sha256_prefix":"03cf34a5c88c655f","mcp_get_code":{"code_sha256":"03cf34a5c88c655f"}},{"arxiv_id":"2402.11363","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-de-novo-peptide-sequencing","title":"Transformer-based de novo peptide sequencing for data-independent acquisition mass spectrometry","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biocomputing-research-group/diatrans","path":"depthcharge/utils.py","file_url":"https://github.com/biocomputing-research-group/diatrans/blob/HEAD/depthcharge/utils.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, biocomputing-research-group/diatrans when it was checked","code_sha256":"145ed062058f289a","code_sha256_prefix":"145ed062058f289a","mcp_get_code":{"code_sha256":"145ed062058f289a"}},{"arxiv_id":"2312.11584","arxiv_id_is_arxiv":true,"paper":"/paper/contranovo-a-contrastive-learning-approach-to","title":"ContraNovo: A Contrastive Learning Approach to Enhance De Novo Peptide Sequencing","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beam-labs/contranovo","path":"ContraNovo/utils2.py","file_url":"https://github.com/beam-labs/contranovo/blob/HEAD/ContraNovo/utils2.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, beam-labs/contranovo when it was checked","code_sha256":"145ed062058f289a","code_sha256_prefix":"145ed062058f289a","mcp_get_code":{"code_sha256":"145ed062058f289a"}},{"arxiv_id":"2309.05573","arxiv_id_is_arxiv":true,"paper":"/paper/uniseg-a-unified-multi-modal-lidar","title":"UniSeg: A Unified Multi-Modal LiDAR Segmentation Network and the OpenPCSeg Codebase","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PJLab-ADG/PCSeg","path":"pcseg/optim/fastai_optim.py","file_url":"https://github.com/PJLab-ADG/PCSeg/blob/HEAD/pcseg/optim/fastai_optim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, PJLab-ADG/PCSeg when it was checked","code_sha256":"03cf34a5c88c655f","code_sha256_prefix":"03cf34a5c88c655f","mcp_get_code":{"code_sha256":"03cf34a5c88c655f"}},{"arxiv_id":"2108.07668","arxiv_id_is_arxiv":true,"paper":"/paper/orthogonal-jacobian-regularization-for","title":"Orthogonal Jacobian Regularization for Unsupervised Disentanglement in Image Generation","date":"2021-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csyxwei/orojar","path":"biggan_discovery/orojar.py","file_url":"https://github.com/csyxwei/orojar/blob/HEAD/biggan_discovery/orojar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-2-Clause), but get_code serves the stored copy, first harvested from zhihengli-UR/discover_unknown_biases, and GitHub detected no licence in that repository when it was checked","code_sha256":"47b42795fd222ceb","code_sha256_prefix":"47b42795fd222ceb","mcp_get_code":{"code_sha256":"47b42795fd222ceb"}},{"arxiv_id":"2106.03805","arxiv_id_is_arxiv":true,"paper":"/paper/3db-a-framework-for-debugging-computer-vision","title":"3DB: A Framework for Debugging Computer Vision Models","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"3db/3db","path":"make_unit_tests.py","file_url":"https://github.com/3db/3db/blob/HEAD/make_unit_tests.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":"83f9d49d58489326","code_sha256_prefix":"83f9d49d58489326","mcp_get_code":{"code_sha256":"83f9d49d58489326"}},{"arxiv_id":"2104.14556","arxiv_id_is_arxiv":true,"paper":"/paper/discover-the-unknown-biased-attribute-of-an","title":"Discover the Unknown Biased Attribute of an Image Classifier","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhihengli-UR/discover_unknown_biases","path":"models/hessian_penalty.py","file_url":"https://github.com/zhihengli-UR/discover_unknown_biases/blob/HEAD/models/hessian_penalty.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhihengli-UR/discover_unknown_biases when it was checked","code_sha256":"47b42795fd222ceb","code_sha256_prefix":"47b42795fd222ceb","mcp_get_code":{"code_sha256":"47b42795fd222ceb"}},{"arxiv_id":"2002.08155","arxiv_id_is_arxiv":true,"paper":"/paper/codebert-a-pre-trained-model-for-programming","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peri-source/peri","path":"peri/logger.py","file_url":"https://github.com/peri-source/peri/blob/HEAD/peri/logger.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":"f35d31e49f765f57","code_sha256_prefix":"f35d31e49f765f57","mcp_get_code":{"code_sha256":"f35d31e49f765f57"}},{"arxiv_id":"2002.08155","arxiv_id_is_arxiv":true,"paper":"/paper/codebert-a-pre-trained-model-for-programming","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peri-source/peri","path":"peri/util.py","file_url":"https://github.com/peri-source/peri/blob/HEAD/peri/util.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":"37d657d7803f8bb4","code_sha256_prefix":"37d657d7803f8bb4","mcp_get_code":{"code_sha256":"37d657d7803f8bb4"}},{"arxiv_id":"1708.04552","arxiv_id_is_arxiv":true,"paper":"/paper/improved-regularization-of-convolutional","title":"Improved Regularization of Convolutional Neural Networks with Cutout","date":"2017-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lnstadrum/fastaugment","path":"tensorflow/fast_augment.py","file_url":"https://github.com/lnstadrum/fastaugment/blob/HEAD/tensorflow/fast_augment.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":"f66d6a0103a637b1","code_sha256_prefix":"f66d6a0103a637b1","mcp_get_code":{"code_sha256":"f66d6a0103a637b1"}},{"arxiv_id":"1704.01665","arxiv_id_is_arxiv":true,"paper":"/paper/learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sadhikamalladi/RL-Coloring","path":"runner.py","file_url":"https://github.com/sadhikamalladi/RL-Coloring/blob/HEAD/runner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sadhikamalladi/RL-Coloring when it was checked","code_sha256":"9dceb7338c91e2ea","code_sha256_prefix":"9dceb7338c91e2ea","mcp_get_code":{"code_sha256":"9dceb7338c91e2ea"}}],"record_sha256":"acdb662b87999552525f1d8f4d8164bcc524d18aaa9af596d604129045024562","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}