{"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/create-pairs","entry":"create_pairs","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":5,"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":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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":"2603.15546","paper":"/paper/arxiv-2603-15546","title":"Kimodo: Scaling Controllable Human Motion Generation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"nv-tlabs/kimodo","path":"kimodo/constraints.py","file_url":"https://github.com/nv-tlabs/kimodo/blob/HEAD/kimodo/constraints.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":"495275fac958edb6","mcp_get_code":{"code_sha256":"495275fac958edb6"}},{"arxiv_id":"2405.14589","paper":"/paper/top-down-partitioning-for-efficient-list-wise","title":"Top-Down Partitioning for Efficient List-Wise Ranking","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parry-parry/tdpart","path":"partitionrank/transformer/pair_t5.py","file_url":"https://github.com/parry-parry/tdpart/blob/HEAD/partitionrank/transformer/pair_t5.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73e41675e0c23626","mcp_get_code":{"code_sha256":"73e41675e0c23626"}},{"arxiv_id":"2312.14000","paper":"/paper/risk-sensitive-stochastic-optimal-control-as","title":"Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanyas/psoc","path":"psoc/utils.py","file_url":"https://github.com/hanyas/psoc/blob/HEAD/psoc/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bc6e48c637fba27","mcp_get_code":{"code_sha256":"1bc6e48c637fba27"}},{"arxiv_id":"1807.09536","paper":"/paper/end-to-end-incremental-learning","title":"End-to-End Incremental Learning","date":"2018-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axelmukwena/biometricECG","path":"snn.py","file_url":"https://github.com/axelmukwena/biometricECG/blob/HEAD/snn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77a608bac7d684d4","mcp_get_code":{"code_sha256":"77a608bac7d684d4"}},{"arxiv_id":"1504.06993","paper":"/paper/compression-artifacts-reduction-by-a-deep","title":"Compression Artifacts Reduction by a Deep Convolutional Network","date":"2015-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinayak19th/ARCNN-keras","path":"dataset.py","file_url":"https://github.com/vinayak19th/ARCNN-keras/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4d1f937d83bdb2ba","mcp_get_code":{"code_sha256":"4d1f937d83bdb2ba"}}]}