{"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-epsilon","entry":"get_epsilon","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":7,"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":7,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2505.13662","paper":"/paper/differentially-private-quantiles-with-smaller","title":"Differentially Private Quantiles with Smaller Error","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":"nynsenfaber/dp_cc_quantiles","path":"DP_AQ/approximate_quantiles_algo.py","file_url":"https://github.com/nynsenfaber/dp_cc_quantiles/blob/HEAD/DP_AQ/approximate_quantiles_algo.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":"d79b89dd0f7194d5","mcp_get_code":{"code_sha256":"d79b89dd0f7194d5"}},{"arxiv_id":"2406.14537","paper":"/paper/macrohft-memory-augmented-context-aware","title":"MacroHFT: Memory Augmented Context-aware Reinforcement Learning On High Frequency Trading","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZONG0004/MacroHFT","path":"RL/util/utili.py","file_url":"https://github.com/ZONG0004/MacroHFT/blob/HEAD/RL/util/utili.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"250e2eda775973f7","mcp_get_code":{"code_sha256":"250e2eda775973f7"}},{"arxiv_id":"2108.01850","paper":"/paper/controlled-text-generation-as-continuous","title":"Controlled Text Generation as Continuous Optimization with Multiple Constraints","date":"2021-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sachin19/mucoco","path":"mucoco/utils/misc.py","file_url":"https://github.com/sachin19/mucoco/blob/HEAD/mucoco/utils/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cdadf43082eedd","mcp_get_code":{"code_sha256":"76cdadf43082eedd"}},{"arxiv_id":"2105.08257","paper":"/paper/differentiable-factor-graph-optimization-for","title":"Differentiable Factor Graph Optimization for Learning Smoothers","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"brentyi/jaxlie","path":"jaxlie/utils/_utils.py","file_url":"https://github.com/brentyi/jaxlie/blob/HEAD/jaxlie/utils/_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aab3dd55c6ed5c40","mcp_get_code":{"code_sha256":"aab3dd55c6ed5c40"}},{"arxiv_id":"2007.04504","paper":"/paper/learning-differential-equations-that-are-easy","title":"Learning Differential Equations that are Easy to Solve","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobjinkelly/easy-neural-ode","path":"ffjord_mnist.py","file_url":"https://github.com/jacobjinkelly/easy-neural-ode/blob/HEAD/ffjord_mnist.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":"69e10cc7e0e93501","mcp_get_code":{"code_sha256":"69e10cc7e0e93501"}},{"arxiv_id":"2006.10503","paper":"/paper/se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trachote/predict_elastic_tensor","path":"utils/etc.py","file_url":"https://github.com/trachote/predict_elastic_tensor/blob/HEAD/utils/etc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"767887f5d7462380","mcp_get_code":{"code_sha256":"767887f5d7462380"}},{"arxiv_id":"2006.07134","paper":"/paper/tight-approximate-differential-privacy-for","title":"Tight Differential Privacy for Discrete-Valued Mechanisms and for the Subsampled Gaussian Mechanism Using FFT","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DPBayes/PLD-Accountant","path":"fourier_accountant/experimental/binomial_mechanism.py","file_url":"https://github.com/DPBayes/PLD-Accountant/blob/HEAD/fourier_accountant/experimental/binomial_mechanism.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff04203c9035f8c5","mcp_get_code":{"code_sha256":"ff04203c9035f8c5"}}]}