{"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-z","entry":"get_z","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":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":3,"n_samples_ran":0,"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":0,"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":"2401.15330","paper":"/paper/optimal-sparse-survival-trees","title":"Optimal Sparse Survival Trees","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruizhang1996/optimal-sparse-survival-trees-public","path":"osst/model/imbalance/osdt_sup.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_sup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"853df50d15ebc2ef","mcp_get_code":{"code_sha256":"853df50d15ebc2ef"}},{"arxiv_id":"2212.14474","paper":"/paper/learning-3d-human-pose-estimation-from-dozens","title":"Learning 3D Human Pose Estimation from Dozens of Datasets using a Geometry-Aware Autoencoder to Bridge Between Skeleton Formats","date":"2022-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isarandi/posepile","path":"src/posepile/compositing.py","file_url":"https://github.com/isarandi/posepile/blob/HEAD/src/posepile/compositing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f844d1da50ec728","mcp_get_code":{"code_sha256":"9f844d1da50ec728"}},{"arxiv_id":"2203.08063","paper":"/paper/motionclip-exposing-human-motion-generation","title":"MotionCLIP: Exposing Human Motion Generation to CLIP Space","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guytevet/motionclip","path":"src/datasets/amass.py","file_url":"https://github.com/guytevet/motionclip/blob/HEAD/src/datasets/amass.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e182600b67dc0a48","mcp_get_code":{"code_sha256":"e182600b67dc0a48"}},{"arxiv_id":"2104.05670","paper":"/paper/action-conditioned-3d-human-motion-synthesis","title":"Action-Conditioned 3D Human Motion Synthesis with Transformer VAE","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mathux/ACTOR","path":"src/datasets/uestc.py","file_url":"https://github.com/Mathux/ACTOR/blob/HEAD/src/datasets/uestc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e182600b67dc0a48","mcp_get_code":{"code_sha256":"e182600b67dc0a48"}},{"arxiv_id":"2006.08690","paper":"/paper/generalized-optimal-sparse-decision-trees","title":"Generalized and Scalable Optimal Sparse Decision Trees","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhichen96/interpretable_ml_metamaterials","path":"gosdt/osdt_sup.py","file_url":"https://github.com/zhichen96/interpretable_ml_metamaterials/blob/HEAD/gosdt/osdt_sup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"853df50d15ebc2ef","mcp_get_code":{"code_sha256":"853df50d15ebc2ef"}}]}