{"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/calculate-correlation","entry":"calculate_correlation","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":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":1,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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.02184","arxiv_id_is_arxiv":true,"paper":"/paper/codejudge-evaluating-code-generation-with","title":"CodeJudge: Evaluating Code Generation with Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VichyTong/CodeJudge","path":"evaluation/apps/calculate_single_correlation.py","file_url":"https://github.com/VichyTong/CodeJudge/blob/HEAD/evaluation/apps/calculate_single_correlation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dbad7c7765ac00d","code_sha256_prefix":"2dbad7c7765ac00d","mcp_get_code":{"code_sha256":"2dbad7c7765ac00d"}},{"arxiv_id":"2410.02184","arxiv_id_is_arxiv":true,"paper":"/paper/codejudge-evaluating-code-generation-with","title":"CodeJudge: Evaluating Code Generation with Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VichyTong/CodeJudge","path":"evaluation/apps/calculate_table.py","file_url":"https://github.com/VichyTong/CodeJudge/blob/HEAD/evaluation/apps/calculate_table.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5216eb6022b6ac5b","code_sha256_prefix":"5216eb6022b6ac5b","mcp_get_code":{"code_sha256":"5216eb6022b6ac5b"}},{"arxiv_id":"2410.02184","arxiv_id_is_arxiv":true,"paper":"/paper/codejudge-evaluating-code-generation-with","title":"CodeJudge: Evaluating Code Generation with Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VichyTong/CodeJudge","path":"evaluation/apps/calculate_accuracy.py","file_url":"https://github.com/VichyTong/CodeJudge/blob/HEAD/evaluation/apps/calculate_accuracy.py","status":"unverified","verification_level":0,"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":"8afc902197b67802","code_sha256_prefix":"8afc902197b67802","mcp_get_code":{"code_sha256":"8afc902197b67802"}},{"arxiv_id":"2406.16749","arxiv_id_is_arxiv":true,"paper":"/paper/inferring-stochastic-low-rank-recurrent","title":"Inferring stochastic low-rank recurrent neural networks from neural data","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/smc_rnns","path":"evaluation/calc_stats.py","file_url":"https://github.com/mackelab/smc_rnns/blob/HEAD/evaluation/calc_stats.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e47cd6071cb66e5","code_sha256_prefix":"8e47cd6071cb66e5","mcp_get_code":{"code_sha256":"8e47cd6071cb66e5"}},{"arxiv_id":"2404.19563","arxiv_id_is_arxiv":true,"paper":"/paper/repeval-effective-text-evaluation-with-llm","title":"RepEval: Effective Text Evaluation with LLM Representation","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maszhongming/UniEval","path":"reproduce/correlation.py","file_url":"https://github.com/maszhongming/UniEval/blob/HEAD/reproduce/correlation.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":"31b107371370f1bf","code_sha256_prefix":"31b107371370f1bf","mcp_get_code":{"code_sha256":"31b107371370f1bf"}},{"arxiv_id":"2310.05657","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-into-automatic-evaluation-using","title":"A Closer Look into Automatic Evaluation Using Large Language Models","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d223302/a-closer-look-to-llm-evaluation","path":"all_eval.py","file_url":"https://github.com/d223302/a-closer-look-to-llm-evaluation/blob/HEAD/all_eval.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, d223302/a-closer-look-to-llm-evaluation when it was checked","code_sha256":"f8f9c3b9fc2b97e9","code_sha256_prefix":"f8f9c3b9fc2b97e9","mcp_get_code":{"code_sha256":"f8f9c3b9fc2b97e9"}},{"arxiv_id":"2303.16634","arxiv_id_is_arxiv":true,"paper":"/paper/gpteval-nlg-evaluation-using-gpt-4-with","title":"G-Eval: NLG Evaluation using GPT-4 with Better Human Alignment","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/geval","path":"meta_eval_summeval.py","file_url":"https://github.com/nlpyang/geval/blob/HEAD/meta_eval_summeval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from d223302/a-closer-look-to-llm-evaluation, and GitHub detected no licence in that repository when it was checked","code_sha256":"f8f9c3b9fc2b97e9","code_sha256_prefix":"f8f9c3b9fc2b97e9","mcp_get_code":{"code_sha256":"f8f9c3b9fc2b97e9"}}],"record_sha256":"042f12181ac23e79981080a22ede6d59e09d67edd2a880da71ba9765a9912385","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}