{"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-parameters","entry":"get_parameters","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":30,"n_papers_ran":10,"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":21,"n_samples_ran":9,"n_samples_fingerprinted":1,"n_places":31,"n_places_pointer_only":8,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":3,"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":"2604.17548","paper":"/paper/arxiv-2604-17548","title":"Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Aalto-QuML/Hourglass","path":"experiment.py","file_url":"https://github.com/Aalto-QuML/Hourglass/blob/HEAD/experiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"17eb2746c0fdb30c","mcp_get_code":{"code_sha256":"17eb2746c0fdb30c"}},{"arxiv_id":"2604.09452","paper":"/paper/arxiv-2604-09452","title":"SafeAdapt: Provably Safe Policy Updates in Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"maxanisimov/provably-safe-policy-updates","path":"abstract_gradient_training/model_utils.py","file_url":"https://github.com/maxanisimov/provably-safe-policy-updates/blob/HEAD/abstract_gradient_training/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7a1d7a0a22bcfcb","mcp_get_code":{"code_sha256":"d7a1d7a0a22bcfcb"}},{"arxiv_id":"2602.20671","paper":"/paper/arxiv-2602-20671","title":"Bikelution: Federated Gradient-Boosting for Scalable Shared Micro-Mobility Demand Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DataStories-UniPi/Bikelution","path":"src/helper.py","file_url":"https://github.com/DataStories-UniPi/Bikelution/blob/HEAD/src/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"f2d3a731c98a9cf0","mcp_get_code":{"code_sha256":"f2d3a731c98a9cf0"}},{"arxiv_id":"2510.16877","paper":"/paper/arxiv-2510-16877","title":"Fly-CL: A Fly-Inspired Framework for Enhancing Efficient Decorrelation and Reduced Training Time in Pre-trained Model-based Continual Representation Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"gfyddha/Fly-CL","path":"utils.py","file_url":"https://github.com/gfyddha/Fly-CL/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":"7c91acbf1ec3dfec","mcp_get_code":{"code_sha256":"7c91acbf1ec3dfec"}},{"arxiv_id":"2412.21197","paper":"/paper/a-large-scale-study-on-video-action-dataset","title":"A Large-Scale Study on Video Action Dataset Condensation","date":"2024-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcg-nju/video-dc","path":"utils.py","file_url":"https://github.com/mcg-nju/video-dc/blob/HEAD/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":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"2411.19946","paper":"/paper/delt-a-simple-diversity-driven-earlylate","title":"DELT: A Simple Diversity-driven EarlyLate Training for Dataset Distillation","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vila-lab/delt","path":"evaluation/validation/utils.py","file_url":"https://github.com/vila-lab/delt/blob/HEAD/evaluation/validation/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"2410.09893","paper":"/paper/rmb-comprehensively-benchmarking-reward","title":"RMB: Comprehensively Benchmarking Reward Models in LLM Alignment","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhou-zoey/rmb-reward-model-benchmark","path":"eval/scripts/my_run_rm.py","file_url":"https://github.com/zhou-zoey/rmb-reward-model-benchmark/blob/HEAD/eval/scripts/my_run_rm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ad14d89d1d8e6f44","mcp_get_code":{"code_sha256":"ad14d89d1d8e6f44"}},{"arxiv_id":"2409.16223","paper":"/paper/fine-tuning-is-fine-if-calibrated","title":"Fine-Tuning is Fine, if Calibrated","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OSU-MLB/Fine-Tuning-Is-Fine-If-Calibrated","path":"py/util/model.py","file_url":"https://github.com/OSU-MLB/Fine-Tuning-Is-Fine-If-Calibrated/blob/HEAD/py/util/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d829c6631f3d92c6","mcp_get_code":{"code_sha256":"d829c6631f3d92c6"}},{"arxiv_id":"2407.15138","paper":"/paper/d-4-m-dataset-distillation-via-disentangled","title":"D$^4$M: Dataset Distillation via Disentangled Diffusion Model","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richards94/D4M","path":"validate/utils.py","file_url":"https://github.com/richards94/D4M/blob/HEAD/validate/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"2406.13433","paper":"/paper/certificates-of-differential-privacy-and","title":"Certification for Differentially Private Prediction in Gradient-Based Training","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psosnin/AbstractGradientTraining","path":"abstract_gradient_training/model_utils.py","file_url":"https://github.com/psosnin/AbstractGradientTraining/blob/HEAD/abstract_gradient_training/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"d7a1d7a0a22bcfcb","mcp_get_code":{"code_sha256":"d7a1d7a0a22bcfcb"}},{"arxiv_id":"2406.07001","paper":"/paper/mitigating-boundary-ambiguity-and-inherent","title":"Mitigating Boundary Ambiguity and Inherent Bias for Text Classification in the Era of Large Language Models","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuge0335/pc-cot","path":"construct_prompt.py","file_url":"https://github.com/chuge0335/pc-cot/blob/HEAD/construct_prompt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7289b4621cb8dfe","mcp_get_code":{"code_sha256":"f7289b4621cb8dfe"}},{"arxiv_id":"2402.01514","paper":"/paper/mapping-the-multiverse-of-latent","title":"Mapping the Multiverse of Latent Representations","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidos-lab/Presto","path":"lsd/utils.py","file_url":"https://github.com/aidos-lab/Presto/blob/HEAD/lsd/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"281e62c87492afd4","mcp_get_code":{"code_sha256":"281e62c87492afd4"}},{"arxiv_id":"2312.03526","paper":"/paper/on-the-diversity-and-realism-of-distilled","title":"On the Diversity and Realism of Distilled Dataset: An Efficient Dataset Distillation Paradigm","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/rded","path":"validation/utils.py","file_url":"https://github.com/lins-lab/rded/blob/HEAD/validation/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":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"2311.06152","paper":"/paper/going-beyond-persistent-homology-using","title":"Going beyond persistent homology using persistent homology","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aalto-QuML/RePHINE","path":"experiment.py","file_url":"https://github.com/Aalto-QuML/RePHINE/blob/HEAD/experiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"17eb2746c0fdb30c","mcp_get_code":{"code_sha256":"17eb2746c0fdb30c"}},{"arxiv_id":"2306.12625","paper":"/paper/communication-efficient-federated-learning-20","title":"Adaptive Compression in Federated Learning via Side Information","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francescopase/federated-klms","path":"flower_fl/utils/models.py","file_url":"https://github.com/francescopase/federated-klms/blob/HEAD/flower_fl/utils/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f2d3a731c98a9cf0","mcp_get_code":{"code_sha256":"f2d3a731c98a9cf0"}},{"arxiv_id":"2302.14307","paper":"/paper/gradma-a-gradient-memory-based-accelerated","title":"GradMA: A Gradient-Memory-based Accelerated Federated Learning with Alleviated Catastrophic Forgetting","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lkyddd/GradMA","path":"LightFed/experiments/horizontal/GradMA/trainer.py","file_url":"https://github.com/lkyddd/GradMA/blob/HEAD/LightFed/experiments/horizontal/GradMA/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d624202e744b125","mcp_get_code":{"code_sha256":"0d624202e744b125"}},{"arxiv_id":"2302.02807","paper":"/paper/federated-survival-forests","title":"Federated Survival Forests","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"archettialberto/federated_survival_forests","path":"utils.py","file_url":"https://github.com/archettialberto/federated_survival_forests/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":"9b13c88ff5cc9398","mcp_get_code":{"code_sha256":"9b13c88ff5cc9398"}},{"arxiv_id":"2211.02878","paper":"/paper/textual-manifold-based-defense-against","title":"Textual Manifold-based Defense Against Natural Language Adversarial Examples","date":"2022-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dangne/tmd","path":"src/train/train_sweep_generator.py","file_url":"https://github.com/dangne/tmd/blob/HEAD/src/train/train_sweep_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7f49f3930b08c55","mcp_get_code":{"code_sha256":"e7f49f3930b08c55"}},{"arxiv_id":"2206.15306","paper":"/paper/transfer-learning-with-deep-tabular-models","title":"Transfer Learning with Deep Tabular Models","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"levinroman/tabular-transfer-learning","path":"optune_from_scratch.py","file_url":"https://github.com/levinroman/tabular-transfer-learning/blob/HEAD/optune_from_scratch.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":"6c413ad79849a013","mcp_get_code":{"code_sha256":"6c413ad79849a013"}},{"arxiv_id":"2203.03535","paper":"/paper/influencing-long-term-behavior-in-multiagent","title":"Influencing Long-Term Behavior in Multiagent Reinforcement Learning","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dkkim93/further","path":"algorithm/further/agent.py","file_url":"https://github.com/dkkim93/further/blob/HEAD/algorithm/further/agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a460d87b686cc889","mcp_get_code":{"code_sha256":"a460d87b686cc889"}},{"arxiv_id":"2202.06866","paper":"/paper/delaunay-component-analysis-for-evaluation-of-1","title":"Delaunay Component Analysis for Evaluation of Data Representations","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petrapoklukar/dca","path":"dca/loggers.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/loggers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84664625dedeb394","mcp_get_code":{"code_sha256":"84664625dedeb394"}},{"arxiv_id":"2110.10083","paper":"/paper/contrastive-active-inference","title":"Contrastive Active Inference","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazpie/contrastive-aif","path":"agents.py","file_url":"https://github.com/mazpie/contrastive-aif/blob/HEAD/agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3091e1fe6e877363","mcp_get_code":{"code_sha256":"3091e1fe6e877363"}},{"arxiv_id":"1912.01603","paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KohMat/carracing-dreamer","path":"dreamer/utils/freeze_parameter.py","file_url":"https://github.com/KohMat/carracing-dreamer/blob/HEAD/dreamer/utils/freeze_parameter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c53ea31731e9c271","mcp_get_code":{"code_sha256":"c53ea31731e9c271"}},{"arxiv_id":"1912.01603","paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juliusfrost/dreamer-pytorch","path":"dreamer/utils/module.py","file_url":"https://github.com/juliusfrost/dreamer-pytorch/blob/HEAD/dreamer/utils/module.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00749ea05ebef1a6","mcp_get_code":{"code_sha256":"00749ea05ebef1a6"}},{"arxiv_id":"1909.09501","paper":"/paper/trivializations-for-gradient-based","title":"Trivializations for Gradient-Based Optimization on Manifolds","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93fa2cac3cbd6302","mcp_get_code":{"code_sha256":"93fa2cac3cbd6302"}},{"arxiv_id":"1904.00420","paper":"/paper/single-path-one-shot-neural-architecture","title":"Single Path One-Shot Neural Architecture Search with Uniform Sampling","date":"2019-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-model/SinglePathOneShot","path":"src/Supernet/utils.py","file_url":"https://github.com/megvii-model/SinglePathOneShot/blob/HEAD/src/Supernet/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"1903.10979","paper":"/paper/detnas-neural-architecture-search-on-object","title":"DetNAS: Backbone Search for Object Detection","date":"2019-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-model/DetNAS","path":"Supernet-ImageNet/utils.py","file_url":"https://github.com/megvii-model/DetNAS/blob/HEAD/Supernet-ImageNet/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"1901.08428","paper":"/paper/cheap-orthogonal-constraints-in-neural","title":"Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lezcano/expRNN","path":"parametrization.py","file_url":"https://github.com/Lezcano/expRNN/blob/HEAD/parametrization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93fa2cac3cbd6302","mcp_get_code":{"code_sha256":"93fa2cac3cbd6302"}},{"arxiv_id":"1807.11164","paper":"/paper/shufflenet-v2-practical-guidelines-for","title":"ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Design","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-model/ShuffleNet-Series","path":"ShuffleNetV1/utils.py","file_url":"https://github.com/megvii-model/ShuffleNet-Series/blob/HEAD/ShuffleNetV1/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a700a3b149f4952","mcp_get_code":{"code_sha256":"9a700a3b149f4952"}},{"arxiv_id":"1605.07723","paper":"/paper/data-programming-creating-large-training-sets","title":"Data Programming: Creating Large Training Sets, Quickly","date":"2016-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/snorkel","path":"snorkel/map/core.py","file_url":"https://github.com/HazyResearch/snorkel/blob/HEAD/snorkel/map/core.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":"9daba8a219f31d0d","mcp_get_code":{"code_sha256":"9daba8a219f31d0d"}},{"arxiv_id":"1511.02680","paper":"/paper/bayesian-segnet-model-uncertainty-in-deep","title":"Bayesian SegNet: Model Uncertainty in Deep Convolutional Encoder-Decoder Architectures for Scene Understanding","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hosshonarvar/Image-Segmentation","path":"my_code/Src/parameters.py","file_url":"https://github.com/hosshonarvar/Image-Segmentation/blob/HEAD/my_code/Src/parameters.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b793951869a5684","mcp_get_code":{"code_sha256":"6b793951869a5684"}}]}