{"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/get-v","entry":"get_v","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":5,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":4,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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.09809","paper":"/paper/preserving-the-privacy-of-reward-functions-in","title":"Preserving the Privacy of Reward Functions in MDPs through Deception","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shshnkreddy/deceptiverl","path":"utils.py","file_url":"https://github.com/shshnkreddy/deceptiverl/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1872cedf1821faf4","mcp_get_code":{"code_sha256":"1872cedf1821faf4"}},{"arxiv_id":"2107.06720","paper":"/paper/fairness-in-ranking-under-uncertainty","title":"Fairness in Ranking under Uncertainty","date":"2021-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashudeep/ranking-fairness-uncertainty","path":"fairnessday_vs_linprog.py","file_url":"https://github.com/ashudeep/ranking-fairness-uncertainty/blob/HEAD/fairnessday_vs_linprog.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b4908cbf65a88643","mcp_get_code":{"code_sha256":"b4908cbf65a88643"}},{"arxiv_id":"1901.02161","paper":"/paper/risk-aware-active-inverse-reinforcement","title":"Risk-Aware Active Inverse Reinforcement Learning","date":"2019-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ab0d051f811f37f3","mcp_get_code":{"code_sha256":"ab0d051f811f37f3"}},{"arxiv_id":"1707.00724","paper":"/paper/efficient-probabilistic-performance-bounds","title":"Efficient Probabilistic Performance Bounds for Inverse Reinforcement Learning","date":"2017-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"archit120/Risk-Aware-Active-IRL","path":"alpha_var.py","file_url":"https://github.com/archit120/Risk-Aware-Active-IRL/blob/HEAD/alpha_var.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab0d051f811f37f3","mcp_get_code":{"code_sha256":"ab0d051f811f37f3"}},{"arxiv_id":"1611.07999","paper":"/paper/low-dimensional-spike-rate-models-derived","title":"Low-dimensional spike rate models derived from networks of adaptive integrate-and-fire neurons: Comparison and implementation","date":"2017-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuromethods/fokker-planck-based-spike-rate-models","path":"models/fp/fokker_planck_model.py","file_url":"https://github.com/neuromethods/fokker-planck-based-spike-rate-models/blob/HEAD/models/fp/fokker_planck_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"01a1adaa69b04350","mcp_get_code":{"code_sha256":"01a1adaa69b04350"}}]}