{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-weights","entry":"get_weights","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":34,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":9,"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":32,"n_samples_ran":23,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":8,"n_samples_unverified":9,"n_samples_fingerprinted":2,"n_places":36,"n_places_pointer_only":11,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":7,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":2,"ran":8,"unverified":9},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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.02939","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02939","title":"Federated generative event models for tokenized electronic health records","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"bbj-lab/coreopsis","path":"src/coreopsis/task.py","file_url":"https://github.com/bbj-lab/coreopsis/blob/HEAD/src/coreopsis/task.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae8dd1052ccd2327","code_sha256_prefix":"ae8dd1052ccd2327","mcp_get_code":{"code_sha256":"ae8dd1052ccd2327"}},{"arxiv_id":"2606.23871","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23871","title":"Federated Survival Analysis in Healthcare: A Multi-Model Evaluation on Cross-Institutional Heterogeneous Breast Cancer Data","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nataliamorenob/Survival-Models-in-Federated-Healthcare-Settings","path":"src/Training_Modes/Federated_Learning/task.py","file_url":"https://github.com/nataliamorenob/Survival-Models-in-Federated-Healthcare-Settings/blob/HEAD/src/Training_Modes/Federated_Learning/task.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nataliamorenob/Survival-Models-in-Federated-Healthcare-Settings when it was checked","code_sha256":"59514d7e3fcfc6ba","code_sha256_prefix":"59514d7e3fcfc6ba","mcp_get_code":{"code_sha256":"59514d7e3fcfc6ba"}},{"arxiv_id":"2603.00039","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00039","title":"CARE: Confounder-Aware Aggregation for Reliable LLM Evaluation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"SprocketLab/CARE","path":"src/pgm_tools.py","file_url":"https://github.com/SprocketLab/CARE/blob/HEAD/src/pgm_tools.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SprocketLab/CARE when it was checked","code_sha256":"231e0b0f0a9a3920","code_sha256_prefix":"231e0b0f0a9a3920","mcp_get_code":{"code_sha256":"231e0b0f0a9a3920"}},{"arxiv_id":"2602.21846","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21846","title":"Scalable Kernel-Based Distances for Statistical Inference and Integration","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"MashaNaslidnyk/kqe","path":"kqe/kqd.py","file_url":"https://github.com/MashaNaslidnyk/kqe/blob/HEAD/kqe/kqd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, MashaNaslidnyk/kqe, is not in the permissive set Syntology serves inline","code_sha256":"47f33ec36d35e10d","code_sha256_prefix":"47f33ec36d35e10d","mcp_get_code":{"code_sha256":"47f33ec36d35e10d"}},{"arxiv_id":"2505.23017","arxiv_id_is_arxiv":true,"paper":"/paper/k-2-vae-a-koopman-kalman-enhanced-variational","title":"$K^2$VAE: A Koopman-Kalman Enhanced Variational AutoEncoder for Probabilistic Time Series Forecasting","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/k2vae","path":"probts/model/forecast_module.py","file_url":"https://github.com/decisionintelligence/k2vae/blob/HEAD/probts/model/forecast_module.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, decisionintelligence/k2vae, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"627f3d58e3247384","code_sha256_prefix":"627f3d58e3247384","mcp_get_code":{"code_sha256":"627f3d58e3247384"}},{"arxiv_id":"2411.01842","arxiv_id_is_arxiv":true,"paper":"/paper/elastst-towards-robust-varied-horizon","title":"ElasTST: Towards Robust Varied-Horizon Forecasting with Elastic Time-Series Transformer","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProbTS","path":"probts/model/forecast_module.py","file_url":"https://github.com/microsoft/ProbTS/blob/HEAD/probts/model/forecast_module.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"627f3d58e3247384","code_sha256_prefix":"627f3d58e3247384","mcp_get_code":{"code_sha256":"627f3d58e3247384"}},{"arxiv_id":"2411.01327","arxiv_id_is_arxiv":true,"paper":"/paper/visual-fourier-prompt-tuning","title":"Visual Fourier Prompt Tuning","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtsang/VFPT","path":"ls_net_plotter.py","file_url":"https://github.com/runtsang/VFPT/blob/HEAD/ls_net_plotter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, runtsang/VFPT (NOASSERTION)","code_sha256":"5fa87577ccee9cca","code_sha256_prefix":"5fa87577ccee9cca","mcp_get_code":{"code_sha256":"5fa87577ccee9cca"}},{"arxiv_id":"2410.22113","arxiv_id_is_arxiv":true,"paper":"/paper/where-do-large-learning-rates-lead-us","title":"Where Do Large Learning Rates Lead Us?","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isadrtdinov/understanding-large-lrs","path":"synthetic_example/model.py","file_url":"https://github.com/isadrtdinov/understanding-large-lrs/blob/HEAD/synthetic_example/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79a3e75a15ed94dd","code_sha256_prefix":"79a3e75a15ed94dd","mcp_get_code":{"code_sha256":"79a3e75a15ed94dd"}},{"arxiv_id":"2407.19938","arxiv_id_is_arxiv":true,"paper":"/paper/robust-conformal-volume-estimation-in-3d","title":"Robust Conformal Volume Estimation in 3D Medical Images","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benolmbrt/wcp_miccai","path":"weighted_cp.py","file_url":"https://github.com/benolmbrt/wcp_miccai/blob/HEAD/weighted_cp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, benolmbrt/wcp_miccai when it was checked","code_sha256":"f4e8f43c8e008e21","code_sha256_prefix":"f4e8f43c8e008e21","mcp_get_code":{"code_sha256":"f4e8f43c8e008e21"}},{"arxiv_id":"2407.07805","arxiv_id_is_arxiv":true,"paper":"/paper/sumix-mixup-with-semantic-and-uncertain","title":"SUMix: Mixup with Semantic and Uncertain Information","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinxins/sumix","path":"openmixup/utils/loss_landscape_utils.py","file_url":"https://github.com/jinxins/sumix/blob/HEAD/openmixup/utils/loss_landscape_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"5fa87577ccee9cca","code_sha256_prefix":"5fa87577ccee9cca","mcp_get_code":{"code_sha256":"5fa87577ccee9cca"}},{"arxiv_id":"2406.02645","arxiv_id_is_arxiv":true,"paper":"/paper/astral-training-physics-informed-neural","title":"Astral: training physics-informed neural networks with error majorants","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4gnskq5g2s-collab/Astral","path":"datasets/Convection_Diffusion.py","file_url":"https://github.com/4gnskq5g2s-collab/Astral/blob/HEAD/datasets/Convection_Diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"afa8720aaf616f2c","code_sha256_prefix":"afa8720aaf616f2c","mcp_get_code":{"code_sha256":"afa8720aaf616f2c"}},{"arxiv_id":"2312.00252","arxiv_id_is_arxiv":true,"paper":"/paper/pynerf-pyramidal-neural-radiance-fields-1","title":"PyNeRF: Pyramidal Neural Radiance Fields","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hturki/pynerf","path":"pynerf/fields/pynerf_base_field.py","file_url":"https://github.com/hturki/pynerf/blob/HEAD/pynerf/fields/pynerf_base_field.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hturki/pynerf when it was checked","code_sha256":"fa56d97e56f4074e","code_sha256_prefix":"fa56d97e56f4074e","mcp_get_code":{"code_sha256":"fa56d97e56f4074e"}},{"arxiv_id":"2311.03873","arxiv_id_is_arxiv":true,"paper":"/paper/mini-but-mighty-finetuning-vits-with-mini","title":"Mini but Mighty: Finetuning ViTs with Mini Adapters","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iemprog/mimi","path":"few_shot_prune.py","file_url":"https://github.com/iemprog/mimi/blob/HEAD/few_shot_prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, iemprog/mimi when it was checked","code_sha256":"e65098a07aaba1a6","code_sha256_prefix":"e65098a07aaba1a6","mcp_get_code":{"code_sha256":"e65098a07aaba1a6"}},{"arxiv_id":"2309.11103","arxiv_id_is_arxiv":true,"paper":"/paper/bold-but-cautious-unlocking-the-potential-of","title":"Bold but Cautious: Unlocking the Potential of Personalized Federated Learning through Cautiously Aggressive Collaboration","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kxzxvbk/Fling","path":"fling/component/client/fedcac_client.py","file_url":"https://github.com/kxzxvbk/Fling/blob/HEAD/fling/component/client/fedcac_client.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb9da6554a729a17","code_sha256_prefix":"cb9da6554a729a17","mcp_get_code":{"code_sha256":"cb9da6554a729a17"}},{"arxiv_id":"2306.08553","arxiv_id_is_arxiv":true,"paper":"/paper/noise-stability-optimization-for-flat-minima","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"virtuosoresearch/noise-stability-optimization","path":"exps_on_graph_datasets/compute_noise_stability.py","file_url":"https://github.com/virtuosoresearch/noise-stability-optimization/blob/HEAD/exps_on_graph_datasets/compute_noise_stability.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f5a965a9547d732","code_sha256_prefix":"7f5a965a9547d732","mcp_get_code":{"code_sha256":"7f5a965a9547d732"}},{"arxiv_id":"2306.00854","arxiv_id_is_arxiv":true,"paper":"/paper/spatio-angular-convolutions-for-super","title":"Spatio-Angular Convolutions for Super-resolution in Diffusion MRI","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-lyon/dmri-pcconv","path":"dmri_pcconv/core/weights.py","file_url":"https://github.com/m-lyon/dmri-pcconv/blob/HEAD/dmri_pcconv/core/weights.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90be7203b2cdb95e","code_sha256_prefix":"90be7203b2cdb95e","mcp_get_code":{"code_sha256":"90be7203b2cdb95e"}},{"arxiv_id":"2305.00097","arxiv_id_is_arxiv":true,"paper":"/paper/nnsplitter-an-active-defense-solution-to-dnn","title":"NNSplitter: An Active Defense Solution for DNN Model via Automated Weight Obfuscation","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongzhou0101/nnsplitter","path":"utils.py","file_url":"https://github.com/tongzhou0101/nnsplitter/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95420dae8de37f2f","code_sha256_prefix":"95420dae8de37f2f","mcp_get_code":{"code_sha256":"95420dae8de37f2f"}},{"arxiv_id":"2303.10837","arxiv_id_is_arxiv":true,"paper":"/paper/fedml-he-an-efficient-homomorphic-encryption","title":"FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FedML-AI/FedML","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/FedML-AI/FedML/blob/HEAD/python/fedml/utils/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"443938d9ecd165f7","code_sha256_prefix":"443938d9ecd165f7","mcp_get_code":{"code_sha256":"443938d9ecd165f7"}},{"arxiv_id":"2302.04451","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-in-graph-neural-networks","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","date":"2023-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"virtuosoresearch/generalization-in-graph-neural-networks","path":"src/compute_hessian_spectra.py","file_url":"https://github.com/virtuosoresearch/generalization-in-graph-neural-networks/blob/HEAD/src/compute_hessian_spectra.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7144f95dffb38b67","code_sha256_prefix":"7144f95dffb38b67","mcp_get_code":{"code_sha256":"7144f95dffb38b67"}},{"arxiv_id":"2302.04451","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-in-graph-neural-networks","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","date":"2023-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-statsml-research/generalization-in-graph-neural-networks","path":"src/compute_hessian_norm.py","file_url":"https://github.com/neu-statsml-research/generalization-in-graph-neural-networks/blob/HEAD/src/compute_hessian_norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f274d9139984ff5","code_sha256_prefix":"7f274d9139984ff5","mcp_get_code":{"code_sha256":"7f274d9139984ff5"}},{"arxiv_id":"2201.02177","arxiv_id_is_arxiv":true,"paper":"/paper/grokking-generalization-beyond-overfitting-on","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/grok","path":"grok/measure.py","file_url":"https://github.com/openai/grok/blob/HEAD/grok/measure.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"269ed6282c593f2f","code_sha256_prefix":"269ed6282c593f2f","mcp_get_code":{"code_sha256":"269ed6282c593f2f"}},{"arxiv_id":"2111.13171","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-dimension-persistent-homology-and-1","title":"Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tolgabirdal/phdimgeneralization","path":"train_analysis.py","file_url":"https://github.com/tolgabirdal/phdimgeneralization/blob/HEAD/train_analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84713b36556a5bdd","code_sha256_prefix":"84713b36556a5bdd","mcp_get_code":{"code_sha256":"84713b36556a5bdd"}},{"arxiv_id":"2111.13171","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-dimension-persistent-homology-and-1","title":"Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tolgabirdal/phdimgeneralization","path":"train_regularize.py","file_url":"https://github.com/tolgabirdal/phdimgeneralization/blob/HEAD/train_regularize.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ca6b94b401f3e65","code_sha256_prefix":"3ca6b94b401f3e65","mcp_get_code":{"code_sha256":"3ca6b94b401f3e65"}},{"arxiv_id":"2107.03356","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/efcp","path":"optimizers/dense/MFAC.py","file_url":"https://github.com/ist-daslab/efcp/blob/HEAD/optimizers/dense/MFAC.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d0a95782e972077b","code_sha256_prefix":"d0a95782e972077b","mcp_get_code":{"code_sha256":"d0a95782e972077b"}},{"arxiv_id":"2105.00266","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-discovery-of-physical-laws-with","title":"Data-driven discovery of Green's functions with human-understandable deep learning","date":"2021-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NBoulle/greenlearning","path":"greenlearning/quadrature_weights.py","file_url":"https://github.com/NBoulle/greenlearning/blob/HEAD/greenlearning/quadrature_weights.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1204baecf885804","code_sha256_prefix":"a1204baecf885804","mcp_get_code":{"code_sha256":"a1204baecf885804"}},{"arxiv_id":"2104.06394","arxiv_id_is_arxiv":true,"paper":"/paper/all-you-need-are-a-few-pixels-semantic","title":"All you need are a few pixels: semantic segmentation with PixelPick","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yazdaniamir38/madbal","path":"utils/losses.py","file_url":"https://github.com/yazdaniamir38/madbal/blob/HEAD/utils/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c204954f25139fdd","code_sha256_prefix":"c204954f25139fdd","mcp_get_code":{"code_sha256":"c204954f25139fdd"}},{"arxiv_id":"2010.09240","arxiv_id_is_arxiv":true,"paper":"/paper/multi-hop-question-generation-with-graph","title":"Multi-hop Question Generation with Graph Convolutional Network","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/MulQG","path":"GPG/encoders/graphfusion_encoder.py","file_url":"https://github.com/HLTCHKUST/MulQG/blob/HEAD/GPG/encoders/graphfusion_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"890a496ec7f7b9fd","code_sha256_prefix":"890a496ec7f7b9fd","mcp_get_code":{"code_sha256":"890a496ec7f7b9fd"}},{"arxiv_id":"2009.10588","arxiv_id_is_arxiv":true,"paper":"/paper/anomalous-diffusion-dynamics-of-learning-in","title":"Anomalous diffusion dynamics of learning in deep neural networks","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifgovh/Anomalous-diffusion-dynamics-of-SGD","path":"get_gradient_weight/net_plotter.py","file_url":"https://github.com/ifgovh/Anomalous-diffusion-dynamics-of-SGD/blob/HEAD/get_gradient_weight/net_plotter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"5fa87577ccee9cca","code_sha256_prefix":"5fa87577ccee9cca","mcp_get_code":{"code_sha256":"5fa87577ccee9cca"}},{"arxiv_id":"2007.13518","arxiv_id_is_arxiv":true,"paper":"/paper/fedml-a-research-library-and-benchmark-for","title":"FedML: A Research Library and Benchmark for Federated Machine Learning","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fedmlai/fedml","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/fedmlai/fedml/blob/HEAD/python/fedml/utils/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"443938d9ecd165f7","code_sha256_prefix":"443938d9ecd165f7","mcp_get_code":{"code_sha256":"443938d9ecd165f7"}},{"arxiv_id":"2006.11392","arxiv_id_is_arxiv":true,"paper":"/paper/pranet-parallel-reverse-attention-network-for","title":"PraNet: Parallel Reverse Attention Network for Polyp Segmentation","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Thehunk1206/PRANet-Polyps-Segmentation","path":"utils/visualize_bce_iou_loss_weigth.py","file_url":"https://github.com/Thehunk1206/PRANet-Polyps-Segmentation/blob/HEAD/utils/visualize_bce_iou_loss_weigth.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c598561b0fdb5cf","code_sha256_prefix":"4c598561b0fdb5cf","mcp_get_code":{"code_sha256":"4c598561b0fdb5cf"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"perplexingpegasus/EarthLandscapeGAN","path":"models/stylegan.py","file_url":"https://github.com/perplexingpegasus/EarthLandscapeGAN/blob/HEAD/models/stylegan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, perplexingpegasus/EarthLandscapeGAN when it was checked","code_sha256":"c4b2f09d3a63a16d","code_sha256_prefix":"c4b2f09d3a63a16d","mcp_get_code":{"code_sha256":"c4b2f09d3a63a16d"}},{"arxiv_id":"1805.07513","arxiv_id_is_arxiv":true,"paper":"/paper/diverse-few-shot-text-classification-with","title":"Diverse Few-Shot Text Classification with Multiple Metrics","date":"2018-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyuchen/few-shot-text-classification","path":"word2vec.py","file_url":"https://github.com/zhongyuchen/few-shot-text-classification/blob/HEAD/word2vec.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc74144ff7cdaf66","code_sha256_prefix":"cc74144ff7cdaf66","mcp_get_code":{"code_sha256":"cc74144ff7cdaf66"}},{"arxiv_id":"1805.00631","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-neural-transformer-via-an","title":"Accelerating Neural Transformer via an Average Attention Network","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangXMU/transformer-aan","path":"code/thumt/models/transformer.py","file_url":"https://github.com/bzhangXMU/transformer-aan/blob/HEAD/code/thumt/models/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b441b0d053c905a","code_sha256_prefix":"1b441b0d053c905a","mcp_get_code":{"code_sha256":"1b441b0d053c905a"}},{"arxiv_id":"1612.01744","arxiv_id_is_arxiv":true,"paper":"/paper/listen-and-translate-a-proof-of-concept-for","title":"Listen and Translate: A Proof of Concept for End-to-End Speech-to-Text Translation","date":"2016-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eske/seq2seq","path":"translate/beam_search.py","file_url":"https://github.com/eske/seq2seq/blob/HEAD/translate/beam_search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ac7677b1e6b3956","code_sha256_prefix":"2ac7677b1e6b3956","mcp_get_code":{"code_sha256":"2ac7677b1e6b3956"}},{"arxiv_id":"1612.01105","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-scene-parsing-network","title":"Pyramid Scene Parsing Network","date":"2016-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YininKorea/Contour-aware-equipotential-learning","path":"utils/loss.py","file_url":"https://github.com/YininKorea/Contour-aware-equipotential-learning/blob/HEAD/utils/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efb328cb1558491d","code_sha256_prefix":"efb328cb1558491d","mcp_get_code":{"code_sha256":"efb328cb1558491d"}},{"arxiv_id":"1008.3477","arxiv_id_is_arxiv":true,"paper":"/paper/the-density-matrix-renormalization-group-in","title":"The density-matrix renormalization group in the age of matrix product states","date":null,"month_inferred_from_arxiv_id":"2010-08","title_source":"archive","repo":"jhauschild/lecture_comp_methods","path":"1_monte_carlo/generate_data.py","file_url":"https://github.com/jhauschild/lecture_comp_methods/blob/HEAD/1_monte_carlo/generate_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bb2315184323d49","code_sha256_prefix":"9bb2315184323d49","mcp_get_code":{"code_sha256":"9bb2315184323d49"}}],"record_sha256":"c698e1821325a45668e84e131c8b1e181bf2f44ba13c087b3a27708fee44a6fc","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}