{"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/func","entry":"func","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":29,"n_papers_ran":17,"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":29,"n_samples_ran":17,"n_samples_fingerprinted":8,"n_places":30,"n_places_pointer_only":17,"by_status":{"ran_honours":0,"ran_violates":7,"ran_draft_wrong":3,"ran_fixture":1,"ran":6,"unverified":12},"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":"2410.01086","paper":"/paper/an-introduction-to-deep-survival-analysis","title":"An Introduction to Deep Survival Analysis Models for Predicting Time-to-Event Outcomes","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgehc/survival-kernets","path":"auton_survival/utils.py","file_url":"https://github.com/georgehc/survival-kernets/blob/HEAD/auton_survival/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"8a71ec1e151548d6","mcp_get_code":{"code_sha256":"8a71ec1e151548d6"}},{"arxiv_id":"2407.09835","paper":"/paper/investigating-low-rank-training-in","title":"Investigating Low-Rank Training in Transformer Language Models: Efficiency and Scaling Analysis","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CLAIRE-Labo/StructuredFFN","path":"src/benchmark_eff/cac_batch.py","file_url":"https://github.com/CLAIRE-Labo/StructuredFFN/blob/HEAD/src/benchmark_eff/cac_batch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"55c08b060f32da53","mcp_get_code":{"code_sha256":"55c08b060f32da53"}},{"arxiv_id":"2406.15305","paper":"/paper/pid-prompt-independent-data-protection","title":"PID: Prompt-Independent Data Protection Against Latent Diffusion Models","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-ML/Diffusion-PID-Protection","path":"libsvm/python/brisquequality.py","file_url":"https://github.com/PKU-ML/Diffusion-PID-Protection/blob/HEAD/libsvm/python/brisquequality.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ea2446c1f9293896","mcp_get_code":{"code_sha256":"ea2446c1f9293896"}},{"arxiv_id":"2406.08434","paper":"/paper/taste-teaching-large-language-models-to","title":"TasTe: Teaching Large Language Models to Translate through Self-Reflection","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yutongwang1216/reflectionllmmt","path":"infer/infer_prompt.py","file_url":"https://github.com/yutongwang1216/reflectionllmmt/blob/HEAD/infer/infer_prompt.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":"2c2516c9976fbb3d","mcp_get_code":{"code_sha256":"2c2516c9976fbb3d"}},{"arxiv_id":"2403.10518","paper":"/paper/lodge-a-coarse-to-fine-diffusion-network-for","title":"Lodge: A Coarse to Fine Diffusion Network for Long Dance Generation Guided by the Characteristic Dance Primitives","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"li-ronghui/LODGE","path":"metric/keypoint2img.py","file_url":"https://github.com/li-ronghui/LODGE/blob/HEAD/metric/keypoint2img.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6e57517882ffbdf5","mcp_get_code":{"code_sha256":"6e57517882ffbdf5"}},{"arxiv_id":"2401.13560","paper":"/paper/segmamba-long-range-sequential-modeling-mamba","title":"SegMamba: Long-range Sequential Modeling Mamba For 3D Medical Image Segmentation","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ge-xing/segmamba","path":"3_train.py","file_url":"https://github.com/ge-xing/segmamba/blob/HEAD/3_train.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"10821989c9e63993","mcp_get_code":{"code_sha256":"10821989c9e63993"}},{"arxiv_id":"2311.11202","paper":"/paper/unmasking-and-improving-data-credibility-a","title":"Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"docta-ai/docta","path":"docta/core/hoc.py","file_url":"https://github.com/docta-ai/docta/blob/HEAD/docta/core/hoc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5a674060ffcfdbd4","mcp_get_code":{"code_sha256":"5a674060ffcfdbd4"}},{"arxiv_id":"2311.11202","paper":"/paper/unmasking-and-improving-data-credibility-a","title":"Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Docta-ai/docta","path":"docta/core/hoc.py","file_url":"https://github.com/Docta-ai/docta/blob/HEAD/docta/core/hoc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0f66f1dc117b565d","mcp_get_code":{"code_sha256":"0f66f1dc117b565d"}},{"arxiv_id":"2310.00681","paper":"/paper/pharmaconet-accelerating-structure-based","title":"PharmacoNet: Accelerating Large-Scale Virtual Screening by Deep Pharmacophore Modeling","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seonghwanseo/pharmaconet","path":"screening.py","file_url":"https://github.com/seonghwanseo/pharmaconet/blob/HEAD/screening.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0b86acf6c8fd414","mcp_get_code":{"code_sha256":"b0b86acf6c8fd414"}},{"arxiv_id":"2308.10603","paper":"/paper/a-step-towards-understanding-why","title":"A step towards understanding why classification helps regression","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silvialaurapintea/reg-cls","path":"1d/make_data1d.py","file_url":"https://github.com/silvialaurapintea/reg-cls/blob/HEAD/1d/make_data1d.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"af188df6229ac760","mcp_get_code":{"code_sha256":"af188df6229ac760"}},{"arxiv_id":"2307.04408","paper":"/paper/tim-teaching-large-language-models-to","title":"TIM: Teaching Large Language Models to Translate with Comparison","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lemon0830/tim","path":"inference/infer_bloom.py","file_url":"https://github.com/lemon0830/tim/blob/HEAD/inference/infer_bloom.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed08e40bd50484c4","mcp_get_code":{"code_sha256":"ed08e40bd50484c4"}},{"arxiv_id":"2305.19693","paper":"/paper/spontaneous-symmetry-breaking-in-generative-1","title":"Spontaneous Symmetry Breaking in Generative Diffusion Models","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabrielraya/symmetry_breaking_diffusion_models","path":"diversity_eval.py","file_url":"https://github.com/gabrielraya/symmetry_breaking_diffusion_models/blob/HEAD/diversity_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"899b121e3d100946","mcp_get_code":{"code_sha256":"899b121e3d100946"}},{"arxiv_id":"2207.00735","paper":"/paper/can-language-models-make-fun-a-case-study-in","title":"Can Language Models Make Fun? A Case Study in Chinese Comical Crosstalk","date":"2022-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonNo2/crosstalk-generation","path":"src/beta_code/muti_heatmap_demo.py","file_url":"https://github.com/anonNo2/crosstalk-generation/blob/HEAD/src/beta_code/muti_heatmap_demo.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":"97f913018bc28b19","mcp_get_code":{"code_sha256":"97f913018bc28b19"}},{"arxiv_id":"2205.10312","paper":"/paper/clusterea-scalable-entity-alignment-with","title":"ClusterEA: Scalable Entity Alignment with Stochastic Training and Normalized Mini-batch Similarities","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joker-xii/clusterea","path":"src/utils.py","file_url":"https://github.com/joker-xii/clusterea/blob/HEAD/src/utils.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":"ec075576300fe613","mcp_get_code":{"code_sha256":"ec075576300fe613"}},{"arxiv_id":"2202.01273","paper":"/paper/beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/beyondimages","path":"hoc.py","file_url":"https://github.com/ucsc-real/beyondimages/blob/HEAD/hoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd60bff3f7c47a28","mcp_get_code":{"code_sha256":"bd60bff3f7c47a28"}},{"arxiv_id":"2201.08967","paper":"/paper/a-robust-hot-subdwarfs-identification-method","title":"A Robust Hot Subdwarfs Identification Method Based on Deep Learning","date":null,"month_inferred_from_arxiv_id":"2022-01","title_source":"archive","repo":"astronomical-data-processing/cnn_spectra_classification","path":"spec_generation.py","file_url":"https://github.com/astronomical-data-processing/cnn_spectra_classification/blob/HEAD/spec_generation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f34d11007be3a537","mcp_get_code":{"code_sha256":"f34d11007be3a537"}},{"arxiv_id":"2201.04021","paper":"/paper/optimization-planning-for-3d-convnets-1","title":"Optimization Planning for 3D ConvNets","date":"2022-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofanqiu/optimization-planning-for-3d-convnets","path":"train_3d_op.py","file_url":"https://github.com/zhaofanqiu/optimization-planning-for-3d-convnets/blob/HEAD/train_3d_op.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f5555e4360d6910c","mcp_get_code":{"code_sha256":"f5555e4360d6910c"}},{"arxiv_id":"2102.05291","paper":"/paper/clusterability-as-an-alternative-to-anchor","title":"Clusterability as an Alternative to Anchor Points When Learning with Noisy Labels","date":"2021-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhaoweiZhu1995/HOC","path":"hoc.py","file_url":"https://github.com/ZhaoweiZhu1995/HOC/blob/HEAD/hoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5d07bccf4e30a813","mcp_get_code":{"code_sha256":"5d07bccf4e30a813"}},{"arxiv_id":"2012.08950","paper":"/paper/deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinklab-sjtu/rgm","path":"dqn_model_r.py","file_url":"https://github.com/thinklab-sjtu/rgm/blob/HEAD/dqn_model_r.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c6f677b13c0cb70f","mcp_get_code":{"code_sha256":"c6f677b13c0cb70f"}},{"arxiv_id":"2005.04857","paper":"/paper/continuous-mixture-autoregressive-networks","title":"Continuous-mixture Autoregressive Networks for efficient variational calculation of many-body systems","date":null,"month_inferred_from_arxiv_id":"2020-05","title_source":"archive","repo":"Anguswlx/VAN2XY","path":"correlator.py","file_url":"https://github.com/Anguswlx/VAN2XY/blob/HEAD/correlator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a049aebba72835a","mcp_get_code":{"code_sha256":"8a049aebba72835a"}},{"arxiv_id":"1912.13440","paper":"/paper/approximate-inference-for-fully-bayesian","title":"Approximate Inference for Fully Bayesian Gaussian Process Regression","date":"2019-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vr308/Generalised-Gaussian-Processes","path":"experiments/demo_1d_regression.py","file_url":"https://github.com/vr308/Generalised-Gaussian-Processes/blob/HEAD/experiments/demo_1d_regression.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8da9e8b61aaa0969","mcp_get_code":{"code_sha256":"8da9e8b61aaa0969"}},{"arxiv_id":"1911.07420","paper":"/paper/a-graph-autoencoder-approach-to-causal","title":"A Graph Autoencoder Approach to Causal Structure Learning","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThinkNaive/GAE-PSP","path":"pool.py","file_url":"https://github.com/ThinkNaive/GAE-PSP/blob/HEAD/pool.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0ba86f3f50731cbd","mcp_get_code":{"code_sha256":"0ba86f3f50731cbd"}},{"arxiv_id":"1906.07975","paper":"/paper/batch-active-learning-using-determinantal","title":"Batch Active Learning Using Determinantal Point Processes","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","path":"reward_learning/algos.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/algos.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36a4e0da182e8207","mcp_get_code":{"code_sha256":"36a4e0da182e8207"}},{"arxiv_id":"1812.01718","paper":"/paper/deep-learning-for-classical-japanese","title":"Deep Learning for Classical Japanese Literature","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huckiyang/MOT-Kuzushiji-Fashion-Video","path":"modules/submodules.py","file_url":"https://github.com/huckiyang/MOT-Kuzushiji-Fashion-Video/blob/HEAD/modules/submodules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79c9ed66ab16aba7","mcp_get_code":{"code_sha256":"79c9ed66ab16aba7"}},{"arxiv_id":"1810.04303","paper":"/paper/batch-active-preference-based-learning-of","title":"Batch Active Preference-Based Learning of Reward Functions","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/batch-active-preference-based-learning","path":"algos.py","file_url":"https://github.com/Stanford-ILIAD/batch-active-preference-based-learning/blob/HEAD/algos.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"274e1610509d19a0","mcp_get_code":{"code_sha256":"274e1610509d19a0"}},{"arxiv_id":"1803.09672","paper":"/paper/on-the-intrinsic-dimensionality-of-face","title":"On the Intrinsic Dimensionality of Image Representations","date":"2018-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human-analysis/intrinsic-dimensionality","path":"ID_estimate/ID_graph_largedata.py","file_url":"https://github.com/human-analysis/intrinsic-dimensionality/blob/HEAD/ID_estimate/ID_graph_largedata.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"073babdc8a31a49d","mcp_get_code":{"code_sha256":"073babdc8a31a49d"}},{"arxiv_id":"1711.05225","paper":"/paper/chexnet-radiologist-level-pneumonia-detection","title":"CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rahulcoding/CheXNet","path":"denseNet_localization.py","file_url":"https://github.com/rahulcoding/CheXNet/blob/HEAD/denseNet_localization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"7fc4e9d73fe8bdc0","mcp_get_code":{"code_sha256":"7fc4e9d73fe8bdc0"}},{"arxiv_id":"1705.02315","paper":"/paper/chestx-ray8-hospital-scale-chest-x-ray","title":"ChestX-ray8: Hospital-scale Chest X-ray Database and Benchmarks on Weakly-Supervised Classification and Localization of Common Thorax Diseases","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"7fc4e9d73fe8bdc0","mcp_get_code":{"code_sha256":"7fc4e9d73fe8bdc0"}},{"arxiv_id":"1703.01365","paper":"/paper/axiomatic-attribution-for-deep-networks","title":"Axiomatic Attribution for Deep Networks","date":"2017-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jankrepl/mildlyoverfitted","path":"mini_tutorials/gradient_wrt_input/explain.py","file_url":"https://github.com/jankrepl/mildlyoverfitted/blob/HEAD/mini_tutorials/gradient_wrt_input/explain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"671a764793394b27","mcp_get_code":{"code_sha256":"671a764793394b27"}},{"arxiv_id":"ijcai2023_0486","paper":null,"title":"arXiv:ijcai2023_0486","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nabenabe0928/constrained-tpe","path":"optimize_toy.py","file_url":"https://github.com/nabenabe0928/constrained-tpe/blob/HEAD/optimize_toy.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":"9f706c663759bcdb","mcp_get_code":{"code_sha256":"9f706c663759bcdb"}}]}