{"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/init-weights-2","entry":"_init_weights","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":9,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":0,"unverified":9},"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":"2405.06880","arxiv_id_is_arxiv":true,"paper":"/paper/emcad-efficient-multi-scale-convolutional","title":"EMCAD: Efficient Multi-scale Convolutional Attention Decoding for Medical Image Segmentation","date":"2024-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLDGroup/EMCAD","path":"lib/decoders.py","file_url":"https://github.com/SLDGroup/EMCAD/blob/HEAD/lib/decoders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, SLDGroup/EMCAD (NOASSERTION)","code_sha256":"92c1ff2ae480fc0f","code_sha256_prefix":"92c1ff2ae480fc0f","mcp_get_code":{"code_sha256":"92c1ff2ae480fc0f"}},{"arxiv_id":"2403.06977","arxiv_id_is_arxiv":true,"paper":"/paper/videomamba-state-space-model-for-efficient","title":"VideoMamba: State Space Model for Efficient Video Understanding","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/videomamba","path":"videomamba/video_sm/models/videomamba.py","file_url":"https://github.com/opengvlab/videomamba/blob/HEAD/videomamba/video_sm/models/videomamba.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":"547c8f8405c4d450","code_sha256_prefix":"547c8f8405c4d450","mcp_get_code":{"code_sha256":"547c8f8405c4d450"}},{"arxiv_id":"2306.15794","arxiv_id_is_arxiv":true,"paper":"/paper/hyenadna-long-range-genomic-sequence-modeling","title":"HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide Resolution","date":"2023-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frederikkemarin/bend","path":"bend/models/hyena_dna.py","file_url":"https://github.com/frederikkemarin/bend/blob/HEAD/bend/models/hyena_dna.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ae5fabb54f1ee70","code_sha256_prefix":"8ae5fabb54f1ee70","mcp_get_code":{"code_sha256":"8ae5fabb54f1ee70"}},{"arxiv_id":"2306.00398","arxiv_id_is_arxiv":true,"paper":"/paper/preference-grounded-token-level-guidance-for-1","title":"Preference-grounded Token-level Guidance for Language Model Fine-tuning","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shentao-yang/preference_grounded_guidance","path":"sum_task/reward_model.py","file_url":"https://github.com/shentao-yang/preference_grounded_guidance/blob/HEAD/sum_task/reward_model.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, shentao-yang/preference_grounded_guidance when it was checked","code_sha256":"8f83f8e37a1fc568","code_sha256_prefix":"8f83f8e37a1fc568","mcp_get_code":{"code_sha256":"8f83f8e37a1fc568"}},{"arxiv_id":"2205.01972","arxiv_id_is_arxiv":true,"paper":"/paper/sequencer-deep-lstm-for-image-classification","title":"Sequencer: Deep LSTM for Image Classification","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"okojoalg/sequencer","path":"models/two_dim_sequencer.py","file_url":"https://github.com/okojoalg/sequencer/blob/HEAD/models/two_dim_sequencer.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":"58c0c12066377b33","code_sha256_prefix":"58c0c12066377b33","mcp_get_code":{"code_sha256":"58c0c12066377b33"}},{"arxiv_id":"2202.09244","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-and-marginalize-explaining-away-1","title":"Transfer and Marginalize: Explaining Away Label Noise with Privileged Information","date":"2022-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danilprov/rethinking_lupi","path":"classification_data/model.py","file_url":"https://github.com/danilprov/rethinking_lupi/blob/HEAD/classification_data/model.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, danilprov/rethinking_lupi when it was checked","code_sha256":"730f82560a7adf28","code_sha256_prefix":"730f82560a7adf28","mcp_get_code":{"code_sha256":"730f82560a7adf28"}},{"arxiv_id":"2201.03545","arxiv_id_is_arxiv":true,"paper":"/paper/a-convnet-for-the-2020s","title":"A ConvNet for the 2020s","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzeromiko/vmamba","path":"analyze/convnexts4nd/convnext_timm.py","file_url":"https://github.com/mzeromiko/vmamba/blob/HEAD/analyze/convnexts4nd/convnext_timm.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":"7476dcb06a6af0ae","code_sha256_prefix":"7476dcb06a6af0ae","mcp_get_code":{"code_sha256":"7476dcb06a6af0ae"}},{"arxiv_id":"2108.08841","arxiv_id_is_arxiv":true,"paper":"/paper/graph-to-3d-end-to-end-generation-and","title":"Graph-to-3D: End-to-End Generation and Manipulation of 3D Scenes Using Scene Graphs","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-dhamo/graphto3d","path":"model/VAEGAN_SHARED.py","file_url":"https://github.com/he-dhamo/graphto3d/blob/HEAD/model/VAEGAN_SHARED.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":"0bb1f65c11193557","code_sha256_prefix":"0bb1f65c11193557","mcp_get_code":{"code_sha256":"0bb1f65c11193557"}},{"arxiv_id":"2006.15646","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-the-expressive-power-of","title":"Expressive Power of Invariant and Equivariant Graph Neural Networks","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlelarge/graph_neural_net","path":"models/blocks_emb.py","file_url":"https://github.com/mlelarge/graph_neural_net/blob/HEAD/models/blocks_emb.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":"db4528f69778c115","code_sha256_prefix":"db4528f69778c115","mcp_get_code":{"code_sha256":"db4528f69778c115"}}],"record_sha256":"dedd78b70e3e537ce188b5b2b5c2f1301b1ea59a06f382dde62b84e0f41f3297","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}