{"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/sig","entry":"sig","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":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":5,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":2},"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":"2510.18828","paper":"/paper/arxiv-2510-18828","title":"Actor-Free Continuous Control via Structurally Maximizable Q-Functions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"USC-Lira/Q3C","path":"large_rl/commons/pt_activation_fns.py","file_url":"https://github.com/USC-Lira/Q3C/blob/HEAD/large_rl/commons/pt_activation_fns.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac490e7cbabe2c6b","mcp_get_code":{"code_sha256":"ac490e7cbabe2c6b"}},{"arxiv_id":"2305.15901","paper":"/paper/empirical-optimal-transport-between","title":"Consistent Optimal Transport with Empirical Conditional Measures","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atmlr-lab/cot","path":"Sec5.1/Sec5.1.1/correctness_exp_v3.py","file_url":"https://github.com/atmlr-lab/cot/blob/HEAD/Sec5.1/Sec5.1.1/correctness_exp_v3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"99abada3230033ee","mcp_get_code":{"code_sha256":"99abada3230033ee"}},{"arxiv_id":"2301.12600","paper":"/paper/bagging-provides-assumption-free-stability","title":"Bagging Provides Assumption-free Stability","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jake-soloff/subbagging-experiments","path":"stability-experiments.py","file_url":"https://github.com/jake-soloff/subbagging-experiments/blob/HEAD/stability-experiments.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"847b26af2feb8c96","mcp_get_code":{"code_sha256":"847b26af2feb8c96"}},{"arxiv_id":"1808.00720","paper":"/paper/recogym-a-reinforcement-learning-environment","title":"RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertising","date":"2018-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"criteo-research/reco-gym","path":"recogym/envs/reco_env_v1.py","file_url":"https://github.com/criteo-research/reco-gym/blob/HEAD/recogym/envs/reco_env_v1.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":"ef2197d5a69de56d","mcp_get_code":{"code_sha256":"ef2197d5a69de56d"}},{"arxiv_id":"1710.05941","paper":"/paper/searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"islaterm/you-activated-my-neuron","path":"src/neuron/activation_functions.py","file_url":"https://github.com/islaterm/you-activated-my-neuron/blob/HEAD/src/neuron/activation_functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f32504dbf9150ad6","mcp_get_code":{"code_sha256":"f32504dbf9150ad6"}}]}