{"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/cut","entry":"cut","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":8,"n_papers_ran":4,"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":9,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":5},"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.23473","paper":"/paper/arxiv-2608-23473","title":"METACASTER: Meta-Harness-Optimized Agent for End-to-End Few-Shot Learning of Lightweight Time Series Forecasters","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"D2I-Group/metacaster","path":"generation/core/_runtime.py","file_url":"https://github.com/D2I-Group/metacaster/blob/HEAD/generation/core/_runtime.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a3cf26a57b048000","mcp_get_code":{"code_sha256":"a3cf26a57b048000"}},{"arxiv_id":"2604.04287","paper":"/paper/arxiv-2604-04287","title":"Entropy, Disagreement, and the Limits of Foundation Models in Genomics","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"lbcb-sci/GFMs","path":"discriminator/inference.py","file_url":"https://github.com/lbcb-sci/GFMs/blob/HEAD/discriminator/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3246e96fb267885d","mcp_get_code":{"code_sha256":"3246e96fb267885d"}},{"arxiv_id":"2410.06802","paper":"/paper/seg2act-global-context-aware-action","title":"Seg2Act: Global Context-aware Action Generation for Document Logical Structuring","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cascip/seg2act","path":"seg2act/eval/ChCatExt/seg2act_eval.py","file_url":"https://github.com/cascip/seg2act/blob/HEAD/seg2act/eval/ChCatExt/seg2act_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"021ff08125ee88b1","mcp_get_code":{"code_sha256":"021ff08125ee88b1"}},{"arxiv_id":"2406.14017","paper":"/paper/eager-two-stream-generative-recommender-with-1","title":"EAGER: Two-Stream Generative Recommender with Behavior-Semantic Collaboration","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzz/EAGER","path":"EAGER/lib/generate_train_and_test_data.py","file_url":"https://github.com/yewzz/EAGER/blob/HEAD/EAGER/lib/generate_train_and_test_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7a6c7633bb7110ea","mcp_get_code":{"code_sha256":"7a6c7633bb7110ea"}},{"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/threshold_guess.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/threshold_guess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f0a82d5c9574c28b","mcp_get_code":{"code_sha256":"f0a82d5c9574c28b"}},{"arxiv_id":"2312.04028","paper":"/paper/imface-a-sophisticated-nonlinear-3d-morphable","title":"ImFace++: A Sophisticated Nonlinear 3D Morphable Face Model with Implicit Neural Representations","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingwuzheng/imface","path":"data_preprocess/cut_mesh.py","file_url":"https://github.com/mingwuzheng/imface/blob/HEAD/data_preprocess/cut_mesh.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04b253f3d203fbde","mcp_get_code":{"code_sha256":"04b253f3d203fbde"}},{"arxiv_id":"2211.07349","paper":"/paper/finding-skill-neurons-in-pre-trained","title":"Finding Skill Neurons in Pre-trained Transformer-based Language Models","date":"2022-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/Skill-Neuron","path":"src/mask.py","file_url":"https://github.com/THU-KEG/Skill-Neuron/blob/HEAD/src/mask.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ac2d952980db18f","mcp_get_code":{"code_sha256":"3ac2d952980db18f"}},{"arxiv_id":"2211.07349","paper":"/paper/finding-skill-neurons-in-pre-trained","title":"Finding Skill Neurons in Pre-trained Transformer-based Language Models","date":"2022-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/Skill-Neuron","path":"src/prune.py","file_url":"https://github.com/THU-KEG/Skill-Neuron/blob/HEAD/src/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0ff446cbe51ea","mcp_get_code":{"code_sha256":"21b0ff446cbe51ea"}},{"arxiv_id":"2020.emnlp-main.315","paper":null,"title":"arXiv:2020.emnlp-main.315","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mrpeerat/SEFR_CUT","path":"sefr_cut/SEFR_CUT.py","file_url":"https://github.com/mrpeerat/SEFR_CUT/blob/HEAD/sefr_cut/SEFR_CUT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"182d0a8b8887ec44","mcp_get_code":{"code_sha256":"182d0a8b8887ec44"}}]}