{"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/q","entry":"q","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":6,"n_papers_ran":3,"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":6,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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":"2407.09926","paper":"/paper/metric-learning-for-clifford-group","title":"Metric Learning for Clifford Group Equivariant Neural Networks","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rick-ali/metric-learning-for-cgenns","path":"models/modules/fcgp.py","file_url":"https://github.com/rick-ali/metric-learning-for-cgenns/blob/HEAD/models/modules/fcgp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dcba8eaf7d6bbc97","mcp_get_code":{"code_sha256":"dcba8eaf7d6bbc97"}},{"arxiv_id":"2404.03037","paper":"/paper/model-based-reinforcement-learning-for-7","title":"Model-based Reinforcement Learning for Parameterized Action Spaces","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valarzz/dlpa","path":"models/networks.py","file_url":"https://github.com/valarzz/dlpa/blob/HEAD/models/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f124ed96fbb6266","mcp_get_code":{"code_sha256":"9f124ed96fbb6266"}},{"arxiv_id":"2310.16828","paper":"/paper/td-mpc2-scalable-robust-world-models-for","title":"TD-MPC2: Scalable, Robust World Models for Continuous Control","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicklashansen/tdmpc","path":"src/algorithm/tdmpc.py","file_url":"https://github.com/nicklashansen/tdmpc/blob/HEAD/src/algorithm/tdmpc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff8c041f09c888e0","mcp_get_code":{"code_sha256":"ff8c041f09c888e0"}},{"arxiv_id":"2307.07410","paper":"/paper/implicit-regularization-in-ai-meets","title":"Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johanwind/which_l1_minimizer","path":"figure3.py","file_url":"https://github.com/johanwind/which_l1_minimizer/blob/HEAD/figure3.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"391c85b7c68e627f","mcp_get_code":{"code_sha256":"391c85b7c68e627f"}},{"arxiv_id":"2205.01059","paper":"/paper/al-pinns-augmented-lagrangian-relaxation","title":"Enhanced Physics-Informed Neural Networks with Augmented Lagrangian Relaxation Method (AL-PINNs)","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwijaeson/al-pinns","path":"Helmholtz/Helmholtz_AL-PINNs.py","file_url":"https://github.com/hwijaeson/al-pinns/blob/HEAD/Helmholtz/Helmholtz_AL-PINNs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b12145bbb0141949","mcp_get_code":{"code_sha256":"b12145bbb0141949"}},{"arxiv_id":"1804.02767","paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"euske/derpyolo","path":"demo/server.py","file_url":"https://github.com/euske/derpyolo/blob/HEAD/demo/server.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f4fb90d76e06cbb","mcp_get_code":{"code_sha256":"4f4fb90d76e06cbb"}}]}