{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-samples","entry":"get_samples","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":18,"n_papers_ran":6,"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":18,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":1,"ran":1,"unverified":12},"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":"2411.02654","paper":"/paper/fair-and-welfare-efficient-constrained-multi","title":"Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinpayan/RAU2","path":"src/compute_allocations.py","file_url":"https://github.com/justinpayan/RAU2/blob/HEAD/src/compute_allocations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a7d652246f3cd301","mcp_get_code":{"code_sha256":"a7d652246f3cd301"}},{"arxiv_id":"2409.18602","paper":"/paper/do-llms-suffer-from-multi-party-hangover-a","title":"Do LLMs suffer from Multi-Party Hangover? A Diagnostic Approach to Addressee Recognition and Response Selection in Conversations","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhfbk/MPH","path":"diagnostic_analysis/prompt_design/0-verbose/mycode/tools.py","file_url":"https://github.com/dhfbk/MPH/blob/HEAD/diagnostic_analysis/prompt_design/0-verbose/mycode/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"89725370a1e215c4","mcp_get_code":{"code_sha256":"89725370a1e215c4"}},{"arxiv_id":"2409.16914","paper":"/paper/zero-shot-detection-of-llm-generated-text","title":"Zero-Shot Detection of LLM-Generated Text using Token Cohesiveness","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shixuan-Ma/TOCSIN","path":"TOCSIN.py","file_url":"https://github.com/Shixuan-Ma/TOCSIN/blob/HEAD/TOCSIN.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb9d821cd37f501a","mcp_get_code":{"code_sha256":"bb9d821cd37f501a"}},{"arxiv_id":"2408.13659","paper":"/paper/reactzyme-a-benchmark-for-enzyme-reaction","title":"ReactZyme: A Benchmark for Enzyme-Reaction Prediction","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willhua127/reactzyme","path":"data_utils.py","file_url":"https://github.com/willhua127/reactzyme/blob/HEAD/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"9c4e721069783c6b","mcp_get_code":{"code_sha256":"9c4e721069783c6b"}},{"arxiv_id":"2407.13307","paper":"/paper/conformal-performance-range-prediction-for","title":"Conformal Performance Range Prediction for Segmentation Output Quality Control","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"annawundram/PerformanceRangePrediction","path":"PerformancePrediction.py","file_url":"https://github.com/annawundram/PerformanceRangePrediction/blob/HEAD/PerformancePrediction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c471b12d586d0dc4","mcp_get_code":{"code_sha256":"c471b12d586d0dc4"}},{"arxiv_id":"2405.20067","paper":"/paper/n-dimensional-gaussians-for-fitting-of-high","title":"N-Dimensional Gaussians for Fitting of High Dimensional Functions","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel/ngd-fitting","path":"synthetic/synthetic_preview.py","file_url":"https://github.com/intel/ngd-fitting/blob/HEAD/synthetic/synthetic_preview.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e7d07ce905efe8f","mcp_get_code":{"code_sha256":"5e7d07ce905efe8f"}},{"arxiv_id":"2312.07540","paper":"/paper/diff-history-for-long-context-language-agents","title":"diff History for Neural Language Agents","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"upiterbarg/diff_history","path":"nethack_experiments/format_interaction_histories.py","file_url":"https://github.com/upiterbarg/diff_history/blob/HEAD/nethack_experiments/format_interaction_histories.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac742238e5f3474d","mcp_get_code":{"code_sha256":"ac742238e5f3474d"}},{"arxiv_id":"2305.14327","paper":"/paper/dynosaur-a-dynamic-growth-paradigm-for","title":"Dynosaur: A Dynamic Growth Paradigm for Instruction-Tuning Data Curation","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WadeYin9712/Dynosaur","path":"code/metadata_collection/download_data.py","file_url":"https://github.com/WadeYin9712/Dynosaur/blob/HEAD/code/metadata_collection/download_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8c06985d6cb4803e","mcp_get_code":{"code_sha256":"8c06985d6cb4803e"}},{"arxiv_id":"2302.14202","paper":"/paper/mixtures-of-all-trees","title":"Mixtures of All Trees","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucla-starai/moat","path":"sample.py","file_url":"https://github.com/ucla-starai/moat/blob/HEAD/sample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4573d66fb7a8a6b9","mcp_get_code":{"code_sha256":"4573d66fb7a8a6b9"}},{"arxiv_id":"2204.01139","paper":"/paper/bnv-fusion-dense-3d-reconstruction-using-bi","title":"BNV-Fusion: Dense 3D Reconstruction using Bi-level Neural Volume Fusion","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likojack/bnv_fusion","path":"src/utils/fusion_utils.py","file_url":"https://github.com/likojack/bnv_fusion/blob/HEAD/src/utils/fusion_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c05d35f03dc76e7c","mcp_get_code":{"code_sha256":"c05d35f03dc76e7c"}},{"arxiv_id":"2111.00053","paper":"/paper/symbolic-regression-via-neural-guided-genetic","title":"Symbolic Regression via Neural-Guided Genetic Programming Population Seeding","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brendenpetersen/deep-symbolic-optimization","path":"dso/dso/memory.py","file_url":"https://github.com/brendenpetersen/deep-symbolic-optimization/blob/HEAD/dso/dso/memory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"fa4716b703136678","mcp_get_code":{"code_sha256":"fa4716b703136678"}},{"arxiv_id":"2107.06882","paper":"/paper/conservative-objective-models-for-effective","title":"Conservative Objective Models for Effective Offline Model-Based Optimization","date":"2021-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhbrookes/CbAS","path":"src/optimization_algs.py","file_url":"https://github.com/dhbrookes/CbAS/blob/HEAD/src/optimization_algs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"48906955911d7219","mcp_get_code":{"code_sha256":"48906955911d7219"}},{"arxiv_id":"2103.13701","paper":"/paper/ecinn-efficient-counterfactuals-from","title":"ECINN: Efficient Counterfactuals from Invertible Neural Networks","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fhvilshoj/ecinn","path":"counterfactual/cf_utils.py","file_url":"https://github.com/fhvilshoj/ecinn/blob/HEAD/counterfactual/cf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"72efcbcd9f4adb20","mcp_get_code":{"code_sha256":"72efcbcd9f4adb20"}},{"arxiv_id":"2010.04625","paper":"/paper/examining-the-ordering-of-rhetorical","title":"Examining the Ordering of Rhetorical Strategies in Persuasive Requests","date":"2020-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-SALT/Persuasive-Orderings","path":"code/editing_utils.py","file_url":"https://github.com/GT-SALT/Persuasive-Orderings/blob/HEAD/code/editing_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c99352811ce651f3","mcp_get_code":{"code_sha256":"c99352811ce651f3"}},{"arxiv_id":"2006.14709","paper":"/paper/the-gaussian-equivalence-of-generative-models","title":"The Gaussian equivalence of generative models for learning with shallow neural networks","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgoldt/gaussian-equiv-2layer","path":"deepgen_online.py","file_url":"https://github.com/sgoldt/gaussian-equiv-2layer/blob/HEAD/deepgen_online.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"90cde0ebc61a7e8d","mcp_get_code":{"code_sha256":"90cde0ebc61a7e8d"}},{"arxiv_id":"2002.07514","paper":"/paper/balancing-reconstruction-error-and-kullback","title":"Balancing reconstruction error and Kullback-Leibler divergence in Variational Autoencoders","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lovelyscientist/rna-seq-vae","path":"gtex_loader.py","file_url":"https://github.com/lovelyscientist/rna-seq-vae/blob/HEAD/gtex_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42e0c9a532dc4421","mcp_get_code":{"code_sha256":"42e0c9a532dc4421"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soskek/dynamic_routing_between_capsules","path":"visualize.py","file_url":"https://github.com/soskek/dynamic_routing_between_capsules/blob/HEAD/visualize.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19f6c412420d3c16","mcp_get_code":{"code_sha256":"19f6c412420d3c16"}},{"arxiv_id":"2023.emnlp-main.979","paper":null,"title":"arXiv:2023.emnlp-main.979","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cyclexu/TacoPrompt","path":"TacoPrompt/Few-shot-Prompting-Llama/infer.py","file_url":"https://github.com/cyclexu/TacoPrompt/blob/HEAD/TacoPrompt/Few-shot-Prompting-Llama/infer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b21b0ac2590ea20","mcp_get_code":{"code_sha256":"3b21b0ac2590ea20"}}]}