{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/generate-weights","entry":"generate_weights","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":5,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2602.16224","paper":"/paper/arxiv-2602-16224","title":"Amortized Predictability-aware Training Framework for Time Series Forecasting and Classification","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Meteor-Stars/APTF","path":"Amortized_Hierarchical_Predictability_Aware_Loss.py","file_url":"https://github.com/Meteor-Stars/APTF/blob/HEAD/Amortized_Hierarchical_Predictability_Aware_Loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0486f943ff1ee681","mcp_get_code":{"code_sha256":"0486f943ff1ee681"}},{"arxiv_id":"2406.02915","paper":"/paper/visual-text-cross-alignment-refining-the","title":"Visual-Text Cross Alignment: Refining the Similarity Score in Vision-Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/wca","path":"helper.py","file_url":"https://github.com/tmlr-group/wca/blob/HEAD/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed993071930bf283","mcp_get_code":{"code_sha256":"ed993071930bf283"}},{"arxiv_id":"2105.09109","paper":"/paper/an-orthogonal-classifier-for-improving-the","title":"An Orthogonal Classifier for Improving the Adversarial Robustness of Neural Networks","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MTandHJ/roboc","path":"models/base.py","file_url":"https://github.com/MTandHJ/roboc/blob/HEAD/models/base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5732e16eed21a0a5","mcp_get_code":{"code_sha256":"5732e16eed21a0a5"}},{"arxiv_id":"2101.00962","paper":"/paper/hybrid-fem-nn-models-combining-artificial","title":"Hybrid FEM-NN models: Combining artificial neural networks with the finite element method","date":"2021-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sebastkm/hybrid-fem-nn","path":"ufl_dnn/neural_network.py","file_url":"https://github.com/sebastkm/hybrid-fem-nn/blob/HEAD/ufl_dnn/neural_network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e800f27c27dd5e6","mcp_get_code":{"code_sha256":"7e800f27c27dd5e6"}},{"arxiv_id":"1908.08342","paper":"/paper/a-generalized-algorithm-for-multi-objective","title":"A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptation","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnyyzj/morl-baselines","path":"morl_baselines/multi_policy/pgmorl/pgmorl.py","file_url":"https://github.com/sunnyyzj/morl-baselines/blob/HEAD/morl_baselines/multi_policy/pgmorl/pgmorl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc500bbeee06daa8","mcp_get_code":{"code_sha256":"fc500bbeee06daa8"}}]}