{"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/dist-matrix","entry":"dist_matrix","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":9,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":7,"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":"2607.05153","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05153","title":"Geometric Causal Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"EWeinstein/GCM","path":"spatial_gcm.py","file_url":"https://github.com/EWeinstein/GCM/blob/HEAD/spatial_gcm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3be655c0eed423","code_sha256_prefix":"5c3be655c0eed423","mcp_get_code":{"code_sha256":"5c3be655c0eed423"}},{"arxiv_id":"2402.02111","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-look-ahead-in-bayesian","title":"Accelerating Look-ahead in Bayesian Optimization: Multilevel Monte Carlo is All you Need","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shangda-Yang/MLMCBO","path":"mlmcbo/acquisition_functions/mlmc_inc_functions.py","file_url":"https://github.com/Shangda-Yang/MLMCBO/blob/HEAD/mlmcbo/acquisition_functions/mlmc_inc_functions.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":"5821b16230a57328","code_sha256_prefix":"5821b16230a57328","mcp_get_code":{"code_sha256":"5821b16230a57328"}},{"arxiv_id":"2211.04446","arxiv_id_is_arxiv":true,"paper":"/paper/private-set-generation-with-discriminative","title":"Private Set Generation with Discriminative Information","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/Private-Set","path":"continual_learning/mean_embedding.py","file_url":"https://github.com/DingfanChen/Private-Set/blob/HEAD/continual_learning/mean_embedding.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":"9fe8d3a1ab728f44","code_sha256_prefix":"9fe8d3a1ab728f44","mcp_get_code":{"code_sha256":"9fe8d3a1ab728f44"}},{"arxiv_id":"2006.04250","arxiv_id_is_arxiv":true,"paper":"/paper/adalam-revisiting-handcrafted-outlier","title":"AdaLAM: Revisiting Handcrafted Outlier Detection","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antonbrazhnyi/AdaLAM","path":"adalam/utils.py","file_url":"https://github.com/antonbrazhnyi/AdaLAM/blob/HEAD/adalam/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a3a952583dcee63e","code_sha256_prefix":"a3a952583dcee63e","mcp_get_code":{"code_sha256":"a3a952583dcee63e"}},{"arxiv_id":"2006.04250","arxiv_id_is_arxiv":true,"paper":"/paper/adalam-revisiting-handcrafted-outlier","title":"AdaLAM: Revisiting Handcrafted Outlier Detection","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cavalli1234/AdaLAM","path":"adalam/utils.py","file_url":"https://github.com/cavalli1234/AdaLAM/blob/HEAD/adalam/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"044e5f3c6e44c154","code_sha256_prefix":"044e5f3c6e44c154","mcp_get_code":{"code_sha256":"044e5f3c6e44c154"}},{"arxiv_id":"1910.12958","arxiv_id_is_arxiv":true,"paper":"/paper/sinkhorn-divergences-for-unbalanced-optimal","title":"Sinkhorn Divergences for Unbalanced Optimal Transport","date":"2019-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thibsej/unbalanced-ot-functionals","path":"unbalancedot/utils.py","file_url":"https://github.com/thibsej/unbalanced-ot-functionals/blob/HEAD/unbalancedot/utils.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":"71c85d72e5e82243","code_sha256_prefix":"71c85d72e5e82243","mcp_get_code":{"code_sha256":"71c85d72e5e82243"}},{"arxiv_id":"1910.12252","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-stein-tests-for-multiple-model","title":"Kernel Stein Tests for Multiple Model Comparison","date":"2019-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jenninglim/model-comparison-test","path":"reltest/util.py","file_url":"https://github.com/jenninglim/model-comparison-test/blob/HEAD/reltest/util.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":"b682b7ee51bdc47b","code_sha256_prefix":"b682b7ee51bdc47b","mcp_get_code":{"code_sha256":"b682b7ee51bdc47b"}},{"arxiv_id":"1905.10033","arxiv_id_is_arxiv":true,"paper":"/paper/personalizing-dialogue-agents-via-meta","title":"Personalizing Dialogue Agents via Meta-Learning","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/PAML","path":"utils/data_reader.py","file_url":"https://github.com/HLTCHKUST/PAML/blob/HEAD/utils/data_reader.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":"65035f6a4a984f2e","code_sha256_prefix":"65035f6a4a984f2e","mcp_get_code":{"code_sha256":"65035f6a4a984f2e"}},{"arxiv_id":"1605.06796","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-distribution-features-with","title":"Interpretable Distribution Features with Maximum Testing Power","date":"2016-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wittawatj/interpretable-test","path":"freqopttest/util.py","file_url":"https://github.com/wittawatj/interpretable-test/blob/HEAD/freqopttest/util.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":"02fb3015fa5b11ba","code_sha256_prefix":"02fb3015fa5b11ba","mcp_get_code":{"code_sha256":"02fb3015fa5b11ba"}}],"record_sha256":"937a0d3363d8e737cbe2b604b11745a351dbe981fd34c7f0b4b059069e967d3e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}