{"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-mean","entry":"get_mean","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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":2,"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":3,"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":"2410.10637","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"debiased/utils.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/debiased/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":"4114c085e849bdee","code_sha256_prefix":"4114c085e849bdee","mcp_get_code":{"code_sha256":"4114c085e849bdee"}},{"arxiv_id":"2408.13006","arxiv_id_is_arxiv":true,"paper":"/paper/systematic-evaluation-of-llm-as-a-judge-in","title":"Systematic Evaluation of LLM-as-a-Judge in LLM Alignment Tasks: Explainable Metrics and Diverse Prompt Templates","date":"2024-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenghh2015/llm-judge-eval","path":"utils/utils_visualize.py","file_url":"https://github.com/shenghh2015/llm-judge-eval/blob/HEAD/utils/utils_visualize.py","status":"unverified","verification_level":0,"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, shenghh2015/llm-judge-eval when it was checked","code_sha256":"ecc8c3ebd720ff32","code_sha256_prefix":"ecc8c3ebd720ff32","mcp_get_code":{"code_sha256":"ecc8c3ebd720ff32"}},{"arxiv_id":"2302.11552","arxiv_id_is_arxiv":true,"paper":"/paper/reduce-reuse-recycle-compositional-generation","title":"Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMC","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FraunhoferChalmersCentre/mcmc_corr_score_diffusion","path":"src/samplers/mcmc.py","file_url":"https://github.com/FraunhoferChalmersCentre/mcmc_corr_score_diffusion/blob/HEAD/src/samplers/mcmc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a0f2fa7e703b10","code_sha256_prefix":"f7a0f2fa7e703b10","mcp_get_code":{"code_sha256":"f7a0f2fa7e703b10"}},{"arxiv_id":"2106.03375","arxiv_id_is_arxiv":true,"paper":"/paper/commutative-lie-group-vae-for-disentanglement","title":"Commutative Lie Group VAE for Disentanglement Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuxinqimac/CommutativeLieGroupVAE-Pytorch","path":"collect_results.py","file_url":"https://github.com/zhuxinqimac/CommutativeLieGroupVAE-Pytorch/blob/HEAD/collect_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a16604e7e8d463ba","code_sha256_prefix":"a16604e7e8d463ba","mcp_get_code":{"code_sha256":"a16604e7e8d463ba"}},{"arxiv_id":"2009.09805","arxiv_id_is_arxiv":true,"paper":"/paper/learning-audio-visual-representations-with","title":"Active Contrastive Learning of Audio-Visual Video Representations","date":"2020-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunyikristy/CM-ACC","path":"mean.py","file_url":"https://github.com/yunyikristy/CM-ACC/blob/HEAD/mean.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":"e83fbcc5be03a1f6","code_sha256_prefix":"e83fbcc5be03a1f6","mcp_get_code":{"code_sha256":"e83fbcc5be03a1f6"}},{"arxiv_id":"2006.15731","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-video-1","title":"Unsupervised Learning of Video Representations via Dense Trajectory Clustering","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pvtokmakov/video_cluster","path":"3D-ResNet/mean.py","file_url":"https://github.com/pvtokmakov/video_cluster/blob/HEAD/3D-ResNet/mean.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":"e83fbcc5be03a1f6","code_sha256_prefix":"e83fbcc5be03a1f6","mcp_get_code":{"code_sha256":"e83fbcc5be03a1f6"}},{"arxiv_id":"1911.00997","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-futures-prediction","title":"Multiple Futures Prediction","date":"2019-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-multiple-futures-prediction","path":"multiple_futures_prediction/train_ngsim.py","file_url":"https://github.com/apple/ml-multiple-futures-prediction/blob/HEAD/multiple_futures_prediction/train_ngsim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, apple/ml-multiple-futures-prediction (NOASSERTION)","code_sha256":"b3850de2a92ec4c9","code_sha256_prefix":"b3850de2a92ec4c9","mcp_get_code":{"code_sha256":"b3850de2a92ec4c9"}}],"record_sha256":"e06ddfe4b8dc0ff65ca7c19b526bfb85a5749be1c46d31c5ad443cf0b325d737","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}