{"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/h","entry":"H","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":4,"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":15,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":15,"n_places_pointer_only":4,"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":2,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":1,"ran":8,"unverified":0},"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":"2604.05829","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-05829","title":"Bivariate Causal Discovery Using Rate-Distortion MDL: An Information Dimension Approach","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"tiagobrogueira/Causal-Discovery-In-Exchangeable-Data","path":"bicausal/methods/RDMDL.py","file_url":"https://github.com/tiagobrogueira/Causal-Discovery-In-Exchangeable-Data/blob/HEAD/bicausal/methods/RDMDL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, tiagobrogueira/Causal-Discovery-In-Exchangeable-Data (NOASSERTION)","code_sha256":"49afac41d65a5eda","code_sha256_prefix":"49afac41d65a5eda","mcp_get_code":{"code_sha256":"49afac41d65a5eda"}},{"arxiv_id":"2503.19068","arxiv_id_is_arxiv":true,"paper":"/paper/minimum-volume-conformal-sets-for","title":"Minimum Volume Conformal Sets for Multivariate Regression","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElSacho/MVCS","path":"experiments/one_matrix_MVCS/code/DC_algorithm.py","file_url":"https://github.com/ElSacho/MVCS/blob/HEAD/experiments/one_matrix_MVCS/code/DC_algorithm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ElSacho/MVCS when it was checked","code_sha256":"084da7f0f620998a","code_sha256_prefix":"084da7f0f620998a","mcp_get_code":{"code_sha256":"084da7f0f620998a"}},{"arxiv_id":"2406.07475","arxiv_id_is_arxiv":true,"paper":"/paper/partially-observed-trajectory-inference-using","title":"Partially Observed Trajectory Inference using Optimal Transport and a Dynamics Prior","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anminggu/partially-observed-traj-inference","path":"models.py","file_url":"https://github.com/anminggu/partially-observed-traj-inference/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"758720d8ba3137f9","code_sha256_prefix":"758720d8ba3137f9","mcp_get_code":{"code_sha256":"758720d8ba3137f9"}},{"arxiv_id":"2312.01037","arxiv_id_is_arxiv":true,"paper":"/paper/eliciting-latent-knowledge-from-quirky","title":"Eliciting Latent Knowledge from Quirky Language Models","date":"2023-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleutherai/elk-generalization","path":"elk_generalization/elk/ccs_losses.py","file_url":"https://github.com/eleutherai/elk-generalization/blob/HEAD/elk_generalization/elk/ccs_losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f88973b76c982a1","code_sha256_prefix":"1f88973b76c982a1","mcp_get_code":{"code_sha256":"1f88973b76c982a1"}},{"arxiv_id":"2310.05161","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-neural-language-models-as","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rycolab/weighted-minsky","path":"fsrnn/models/activations.py","file_url":"https://github.com/rycolab/weighted-minsky/blob/HEAD/fsrnn/models/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rycolab/weighted-minsky when it was checked","code_sha256":"605f825893ccda68","code_sha256_prefix":"605f825893ccda68","mcp_get_code":{"code_sha256":"605f825893ccda68"}},{"arxiv_id":"2307.08950","arxiv_id_is_arxiv":true,"paper":"/paper/deep-physics-guided-unrolling-generalization","title":"Deep Physics-Guided Unrolling Generalization for Compressed Sensing","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guaishou74851/prl","path":"utils.py","file_url":"https://github.com/guaishou74851/prl/blob/HEAD/utils.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, guaishou74851/prl when it was checked","code_sha256":"de11b4d0d156c5ba","code_sha256_prefix":"de11b4d0d156c5ba","mcp_get_code":{"code_sha256":"de11b4d0d156c5ba"}},{"arxiv_id":"2205.07146","arxiv_id_is_arxiv":true,"paper":"/paper/trajectory-inference-via-mean-field-langevin","title":"Trajectory Inference via Mean-field Langevin in Path Space","date":"2022-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zsteve/mfl","path":"models.py","file_url":"https://github.com/zsteve/mfl/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae1912f4058f8d39","code_sha256_prefix":"ae1912f4058f8d39","mcp_get_code":{"code_sha256":"ae1912f4058f8d39"}},{"arxiv_id":"2109.08901","arxiv_id_is_arxiv":true,"paper":"/paper/s-3-vaada-submodular-subset-selection-for","title":"S$^3$VAADA: Submodular Subset Selection for Virtual Adversarial Active Domain Adaptation","date":"2021-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/s3vaada","path":"active_learning.py","file_url":"https://github.com/val-iisc/s3vaada/blob/HEAD/active_learning.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"089f4c16f893e1e5","code_sha256_prefix":"089f4c16f893e1e5","mcp_get_code":{"code_sha256":"089f4c16f893e1e5"}},{"arxiv_id":"2012.01426","arxiv_id_is_arxiv":true,"paper":"/paper/stellar-population-inference-with-prospector","title":"Stellar Population Inference with Prospector","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"bd-j/prospector","path":"prospect/models/sedmodel.py","file_url":"https://github.com/bd-j/prospector/blob/HEAD/prospect/models/sedmodel.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf31d6fc73c52184","code_sha256_prefix":"bf31d6fc73c52184","mcp_get_code":{"code_sha256":"bf31d6fc73c52184"}},{"arxiv_id":"2010.06599","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-autoencoders-with-enhanced-data","title":"Quantum autoencoders with enhanced data encoding","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"Quantum-TII/qibo","path":"src/qibo/backends/_clifford_operations.py","file_url":"https://github.com/Quantum-TII/qibo/blob/HEAD/src/qibo/backends/_clifford_operations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c0acb418fb8068c","code_sha256_prefix":"0c0acb418fb8068c","mcp_get_code":{"code_sha256":"0c0acb418fb8068c"}},{"arxiv_id":"2009.13977","arxiv_id_is_arxiv":true,"paper":"/paper/what-if-neural-networks-had-svds","title":"What if Neural Networks had SVDs?","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexanderMath/fasth","path":"fasthpp.py","file_url":"https://github.com/AlexanderMath/fasth/blob/HEAD/fasthpp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"743de62358cf0df2","code_sha256_prefix":"743de62358cf0df2","mcp_get_code":{"code_sha256":"743de62358cf0df2"}},{"arxiv_id":"2008.01998","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-variance-control-of-the-score","title":"Optimal Variance Control of the Score Function Gradient Estimator for Importance Weighted Bounds","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlievin/ovis","path":"ovis/models/template.py","file_url":"https://github.com/vlievin/ovis/blob/HEAD/ovis/models/template.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"04c14f45577151b4","code_sha256_prefix":"04c14f45577151b4","mcp_get_code":{"code_sha256":"04c14f45577151b4"}},{"arxiv_id":"1906.09403","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-nash-equilibrium-in-first-price","title":"Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions","date":null,"month_inferred_from_arxiv_id":"2019-06","title_source":"archive","repo":"emersonswr/discrete_fpa_bne","path":"fpa_bne.py","file_url":"https://github.com/emersonswr/discrete_fpa_bne/blob/HEAD/fpa_bne.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":"c29f40f19f20f9b8","code_sha256_prefix":"c29f40f19f20f9b8","mcp_get_code":{"code_sha256":"c29f40f19f20f9b8"}},{"arxiv_id":"1803.08533","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-measures-of-uncertainty-for","title":"Understanding Measures of Uncertainty for Adversarial Example Detection","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsgos/uncertainty-adversarial-paper","path":"latent_plots.py","file_url":"https://github.com/lsgos/uncertainty-adversarial-paper/blob/HEAD/latent_plots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cd82d77453fe113","code_sha256_prefix":"5cd82d77453fe113","mcp_get_code":{"code_sha256":"5cd82d77453fe113"}},{"arxiv_id":"1710.04196","arxiv_id_is_arxiv":true,"paper":"/paper/pyroomacoustics-a-python-package-for-audio","title":"Pyroomacoustics: A Python package for audio room simulations and array processing algorithms","date":null,"month_inferred_from_arxiv_id":"2017-10","title_source":"archive","repo":"LCAV/pyroomacoustics","path":"pyroomacoustics/beamforming.py","file_url":"https://github.com/LCAV/pyroomacoustics/blob/HEAD/pyroomacoustics/beamforming.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40e1d90b62e21780","code_sha256_prefix":"40e1d90b62e21780","mcp_get_code":{"code_sha256":"40e1d90b62e21780"}}],"record_sha256":"d09d9a4fddda7b52778ecf21b2ec503ae9db460f834260de5db62331a26b31a9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}