{"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/weights-init-2","entry":"_weights_init","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":7,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":7,"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":7},"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":"2608.24597","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24597","title":"Taming foundation model with invariance-oriented pre-training for broad-spectrum EEG analysis across signal-level, brain-state, and brain-health tasks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yuchen2199/CSBrain","path":"models/CSBrain.py","file_url":"https://github.com/yuchen2199/CSBrain/blob/HEAD/models/CSBrain.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, yuchen2199/CSBrain when it was checked","code_sha256":"6088673e8ec9c50c","code_sha256_prefix":"6088673e8ec9c50c","mcp_get_code":{"code_sha256":"6088673e8ec9c50c"}},{"arxiv_id":"2306.16058","arxiv_id_is_arxiv":true,"paper":"/paper/duet-2d-structured-and-approximately","title":"DUET: 2D Structured and Approximately Equivariant Representations","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-duet","path":"duet/models/duet.py","file_url":"https://github.com/apple/ml-duet/blob/HEAD/duet/models/duet.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, apple/ml-duet (NOASSERTION)","code_sha256":"b966d756f19409ce","code_sha256_prefix":"b966d756f19409ce","mcp_get_code":{"code_sha256":"b966d756f19409ce"}},{"arxiv_id":"2304.01279","arxiv_id_is_arxiv":true,"paper":"/paper/long-tailed-visual-recognition-via-self","title":"Long-Tailed Visual Recognition via Self-Heterogeneous Integration with Knowledge Excavation","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinyan-06/shike","path":"networks.py","file_url":"https://github.com/jinyan-06/shike/blob/HEAD/networks.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, jinyan-06/shike when it was checked","code_sha256":"606494cf7b074c7e","code_sha256_prefix":"606494cf7b074c7e","mcp_get_code":{"code_sha256":"606494cf7b074c7e"}},{"arxiv_id":"2204.02877","arxiv_id_is_arxiv":true,"paper":"/paper/pandr-fast-adaptation-to-new-environments","title":"PAnDR: Fast Adaptation to New Environments from Offline Experiences via Decoupling Policy and Environment Representations","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rraileanu/policy-dynamics-value-functions","path":"pdvf_networks.py","file_url":"https://github.com/rraileanu/policy-dynamics-value-functions/blob/HEAD/pdvf_networks.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, rraileanu/policy-dynamics-value-functions when it was checked","code_sha256":"1777ac254c20289b","code_sha256_prefix":"1777ac254c20289b","mcp_get_code":{"code_sha256":"1777ac254c20289b"}},{"arxiv_id":"1905.02244","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpikeKing/mobilenet_v3","path":"mn3_model.py","file_url":"https://github.com/SpikeKing/mobilenet_v3/blob/HEAD/mn3_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, SpikeKing/mobilenet_v3 when it was checked","code_sha256":"5d99159796ececdc","code_sha256_prefix":"5d99159796ececdc","mcp_get_code":{"code_sha256":"5d99159796ececdc"}},{"arxiv_id":"1608.08710","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-filters-for-efficient-convnets","title":"Pruning Filters for Efficient ConvNets","date":"2016-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingsun-tse/regularization-pruning","path":"pruner/l1_pruner.py","file_url":"https://github.com/mingsun-tse/regularization-pruning/blob/HEAD/pruner/l1_pruner.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, mingsun-tse/regularization-pruning when it was checked","code_sha256":"8dbc5200982548c5","code_sha256_prefix":"8dbc5200982548c5","mcp_get_code":{"code_sha256":"8dbc5200982548c5"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"botforge/simplementation","path":"2.DOUBLE-DQN_Deep-Reinforcement-Learning-with-Double-Q-Learning-van-Hasselt-etal-2015/double-dqn_atari.py","file_url":"https://github.com/botforge/simplementation/blob/HEAD/2.DOUBLE-DQN_Deep-Reinforcement-Learning-with-Double-Q-Learning-van-Hasselt-etal-2015/double-dqn_atari.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, botforge/simplementation when it was checked","code_sha256":"0645b4b6b8caa2a3","code_sha256_prefix":"0645b4b6b8caa2a3","mcp_get_code":{"code_sha256":"0645b4b6b8caa2a3"}}],"record_sha256":"b9485120e24ff58fccde1df3a05152a6bdf2b59f473e9bd26f8c285bdb5823d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}