{"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/forward-pass","entry":"forward_pass","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":9,"n_papers_ran":6,"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":8,"n_samples_ran":5,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":1,"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":"2509.26045","paper":"/paper/arxiv-2509-26045","title":"Scaling Up Temporal Domain Generalization via Temporal Experts Averaging","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zxcvfd13502/TEA","path":"methods/utils.py","file_url":"https://github.com/zxcvfd13502/TEA/blob/HEAD/methods/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7da1aec0e1e8b27b","mcp_get_code":{"code_sha256":"7da1aec0e1e8b27b"}},{"arxiv_id":"2509.22284","paper":"/paper/arxiv-2509-22284","title":"Structured Sparse Transition Matrices to Enable State Tracking in State-Space Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"IBM/expressive-sparse-state-space-model","path":"time_series_JAX/models/PDSSM.py","file_url":"https://github.com/IBM/expressive-sparse-state-space-model/blob/HEAD/time_series_JAX/models/PDSSM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2c0042ac70307731","mcp_get_code":{"code_sha256":"2c0042ac70307731"}},{"arxiv_id":"2408.03330","paper":"/paper/modeling-latent-neural-dynamics-with-gaussian","title":"Modeling Latent Neural Dynamics with Gaussian Process Switching Linear Dynamical Systems","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lindermanlab/gpslds","path":"gpslds/em.py","file_url":"https://github.com/lindermanlab/gpslds/blob/HEAD/gpslds/em.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eccd8179d36b008e","mcp_get_code":{"code_sha256":"eccd8179d36b008e"}},{"arxiv_id":"2209.11588","paper":"/paper/learning-rigid-body-dynamics-with-lagrangian","title":"Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Network","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m3rg-iitd/rigid_body_dynamics_graph","path":"src/lnn.py","file_url":"https://github.com/m3rg-iitd/rigid_body_dynamics_graph/blob/HEAD/src/lnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c2660facd7797ec1","mcp_get_code":{"code_sha256":"c2660facd7797ec1"}},{"arxiv_id":"2204.00595","paper":"/paper/monarch-expressive-structured-matrices-for","title":"Monarch: Expressive Structured Matrices for Efficient and Accurate Training","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pascalcarrivain/ksmm","path":"src/ksmm_py/benchmark/utils.py","file_url":"https://github.com/pascalcarrivain/ksmm/blob/HEAD/src/ksmm_py/benchmark/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"64f5feef032ab239","mcp_get_code":{"code_sha256":"64f5feef032ab239"}},{"arxiv_id":"2110.10545","paper":"/paper/ranking-and-tuning-pre-trained-models-a-new","title":"Ranking and Tuning Pre-trained Models: A New Paradigm for Exploiting Model Hubs","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"a9c43aaa49888a3f","mcp_get_code":{"code_sha256":"a9c43aaa49888a3f"}},{"arxiv_id":"2102.11005","paper":"/paper/logme-practical-assessment-of-pre-trained","title":"LogME: Practical Assessment of Pre-trained Models for Transfer Learning","date":"2021-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/LogME","path":"ranking.py","file_url":"https://github.com/thuml/LogME/blob/HEAD/ranking.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9c43aaa49888a3f","mcp_get_code":{"code_sha256":"a9c43aaa49888a3f"}},{"arxiv_id":"2010.05906","paper":"/paper/back-to-the-future-unsupervised-backprop","title":"Back to the Future: Unsupervised Backprop-based Decoding for Counterfactual and Abductive Commonsense Reasoning","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qkaren/unsup_gen_for_cms_reasoning","path":"abductive_main.py","file_url":"https://github.com/qkaren/unsup_gen_for_cms_reasoning/blob/HEAD/abductive_main.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ddba0eea3fb589d6","mcp_get_code":{"code_sha256":"ddba0eea3fb589d6"}},{"arxiv_id":"2004.02693","paper":"/paper/finding-your-3d-center-3d-object-detection","title":"Finding Your (3D) Center: 3D Object Detection Using a Learned Loss","date":"2020-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dgriffiths3/finding-your-center","path":"loss_network/evaluate.py","file_url":"https://github.com/dgriffiths3/finding-your-center/blob/HEAD/loss_network/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16b5531fc4acfa6a","mcp_get_code":{"code_sha256":"16b5531fc4acfa6a"}}]}