{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-epsilon","entry":"get_epsilon","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nynsenfaber/dp_cc_quantiles when it was checked","code_sha256":"d79b89dd0f7194d5","code_sha256_prefix":"d79b89dd0f7194d5","mcp_get_code":{"code_sha256":"d79b89dd0f7194d5"}},{"arxiv_id":"2406.14537","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZONG0004/MacroHFT when it was checked","code_sha256":"250e2eda775973f7","code_sha256_prefix":"250e2eda775973f7","mcp_get_code":{"code_sha256":"250e2eda775973f7"}},{"arxiv_id":"2108.01850","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76cdadf43082eedd","code_sha256_prefix":"76cdadf43082eedd","mcp_get_code":{"code_sha256":"76cdadf43082eedd"}},{"arxiv_id":"2105.08257","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aab3dd55c6ed5c40","code_sha256_prefix":"aab3dd55c6ed5c40","mcp_get_code":{"code_sha256":"aab3dd55c6ed5c40"}},{"arxiv_id":"2007.04504","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69e10cc7e0e93501","code_sha256_prefix":"69e10cc7e0e93501","mcp_get_code":{"code_sha256":"69e10cc7e0e93501"}},{"arxiv_id":"2006.10503","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"767887f5d7462380","code_sha256_prefix":"767887f5d7462380","mcp_get_code":{"code_sha256":"767887f5d7462380"}},{"arxiv_id":"2006.07134","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff04203c9035f8c5","code_sha256_prefix":"ff04203c9035f8c5","mcp_get_code":{"code_sha256":"ff04203c9035f8c5"}}],"record_sha256":"cdde8d85bd908686c3f40359412f466e122ff08f1d04dad9f384e2b0ba532715","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}