{"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/make-instance","entry":"make_instance","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":6,"n_papers_ran":2,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2608.05670","paper":"/paper/arxiv-2608-05670","title":"When Does Consensus Mean Correctness? Measuring the Agreement-Accuracy Coupling with Semantics-Preserving Re-Rendering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"KurbanIntelligenceLab/rendeq","path":"rendeq_generator.py","file_url":"https://github.com/KurbanIntelligenceLab/rendeq/blob/HEAD/rendeq_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd23735272130978","mcp_get_code":{"code_sha256":"cd23735272130978"}},{"arxiv_id":"2308.14104","paper":"/paper/towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaocrr/elg","path":"CVRP/generate_data.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/CVRP/generate_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7def9861cf1ab24","mcp_get_code":{"code_sha256":"c7def9861cf1ab24"}},{"arxiv_id":"2303.02442","paper":"/paper/neural-airport-ground-handling","title":"Neural Airport Ground Handling","date":"2023-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royalskye/agh","path":"Construction_based/problems/agh/problem_agh.py","file_url":"https://github.com/royalskye/agh/blob/HEAD/Construction_based/problems/agh/problem_agh.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8107c13c0668e63e","mcp_get_code":{"code_sha256":"8107c13c0668e63e"}},{"arxiv_id":"2104.04710","paper":"/paper/pyramidal-reservoir-graph-neural-network","title":"Pyramidal Reservoir Graph Neural Network","date":"2021-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FilippoMB/Benchmark_dataset_for_graph_classification","path":"make_dataset.py","file_url":"https://github.com/FilippoMB/Benchmark_dataset_for_graph_classification/blob/HEAD/make_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"388e4cf0d2700628","mcp_get_code":{"code_sha256":"388e4cf0d2700628"}},{"arxiv_id":"1811.09245","paper":"/paper/tganv2-efficient-training-of-large-models-for","title":"Train Sparsely, Generate Densely: Memory-efficient Unsupervised Training of High-resolution Temporal GAN","date":"2018-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/tgan2","path":"tgan2/utils.py","file_url":"https://github.com/pfnet-research/tgan2/blob/HEAD/tgan2/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd696a1b5338b469","mcp_get_code":{"code_sha256":"cd696a1b5338b469"}},{"arxiv_id":"ijcai2024_0764","paper":null,"title":"arXiv:ijcai2024_0764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lamda-bbo/ELG","path":"CVRP/generate_data.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/CVRP/generate_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7def9861cf1ab24","mcp_get_code":{"code_sha256":"c7def9861cf1ab24"}}]}