{"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/generate-label","entry":"generate_label","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":3,"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":7,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"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":"2605.20538","paper":"/paper/arxiv-2605-20538","title":"Continual Segmentation under Joint Nonstationarity","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"prinshul/JASCL","path":"baselines_Med_mixed/CLIP_3D_UNet/label_transfer.py","file_url":"https://github.com/prinshul/JASCL/blob/HEAD/baselines_Med_mixed/CLIP_3D_UNet/label_transfer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5dfdc67825afdf2b","mcp_get_code":{"code_sha256":"5dfdc67825afdf2b"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Skyorca/JHGDA","path":"utils.py","file_url":"https://github.com/Skyorca/JHGDA/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d6c8e0fb0c0f0440","mcp_get_code":{"code_sha256":"d6c8e0fb0c0f0440"}},{"arxiv_id":"2405.18356","paper":"/paper/universal-and-extensible-language-vision","title":"Universal and Extensible Language-Vision Models for Organ Segmentation and Tumor Detection from Abdominal Computed Tomography","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljwztc/clip-driven-universal-model","path":"label_transfer.py","file_url":"https://github.com/ljwztc/clip-driven-universal-model/blob/HEAD/label_transfer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"24feeaf0de319fad","mcp_get_code":{"code_sha256":"24feeaf0de319fad"}},{"arxiv_id":"2312.04964","paper":"/paper/zept-zero-shot-pan-tumor-segmentation-via","title":"ZePT: Zero-Shot Pan-Tumor Segmentation via Query-Disentangling and Self-Prompting","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yankai96/zept","path":"label_transfer.py","file_url":"https://github.com/yankai96/zept/blob/HEAD/label_transfer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"40d1dc45c71f8516","mcp_get_code":{"code_sha256":"40d1dc45c71f8516"}},{"arxiv_id":"2206.04511","paper":"/paper/efficient-human-pose-estimation-via-3d-event","title":"Efficient Human Pose Estimation via 3D Event Point Cloud","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"masterhow/eventpointpose","path":"dataset/DHP19EPC.py","file_url":"https://github.com/masterhow/eventpointpose/blob/HEAD/dataset/DHP19EPC.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a5bd96c473d7a4d","mcp_get_code":{"code_sha256":"4a5bd96c473d7a4d"}},{"arxiv_id":"2009.00725","paper":"/paper/conditional-constrained-graph-variational","title":"Conditional Constrained Graph Variational Autoencoders for Molecule Design","date":"2020-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drigoni/ConditionalCGVAE","path":"model/data_augmentation.py","file_url":"https://github.com/drigoni/ConditionalCGVAE/blob/HEAD/model/data_augmentation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b3fed09d1b23615","mcp_get_code":{"code_sha256":"6b3fed09d1b23615"}},{"arxiv_id":"2003.10477","paper":"/paper/distillating-knowledge-from-graph","title":"Distilling Knowledge from Graph Convolutional Networks","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihollywhy/DistillGCN.PyTorch","path":"utils.py","file_url":"https://github.com/ihollywhy/DistillGCN.PyTorch/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74ef452085c20e34","mcp_get_code":{"code_sha256":"74ef452085c20e34"}},{"arxiv_id":"1809.02630","paper":"/paper/constrained-generation-of-semantically-valid","title":"Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoders","date":"2018-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/constrained-graph-variational-autoencoder","path":"data_augmentation.py","file_url":"https://github.com/Microsoft/constrained-graph-variational-autoencoder/blob/HEAD/data_augmentation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b3fed09d1b23615","mcp_get_code":{"code_sha256":"6b3fed09d1b23615"}}]}