{"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/softplus","entry":"softplus","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":26,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":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":23,"n_samples_ran":20,"n_samples_constructed":0,"n_samples_ran_checked":14,"n_samples_instrument":6,"n_samples_unverified":3,"n_samples_fingerprinted":19,"n_places":28,"n_places_pointer_only":13,"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":2,"ran_violates":4,"ran_draft_wrong":5,"ran_fixture":1,"ran":8,"unverified":3},"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":"2606.09875","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09875","title":"Integrating Local and Global Entropy for Uncertainty Quantification in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"qcri/GLU","path":"GLU_ablations.py","file_url":"https://github.com/qcri/GLU/blob/HEAD/GLU_ablations.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, qcri/GLU when it was checked","code_sha256":"279a553aa191de6d","code_sha256_prefix":"279a553aa191de6d","mcp_get_code":{"code_sha256":"279a553aa191de6d"}},{"arxiv_id":"2603.20388","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20388","title":"From Cross-Validation to SURE: Asymptotic Risk of Tuned Regularized Estimators","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"maxkasy/cv_and_sure_simulations","path":"cvsure_sim.py","file_url":"https://github.com/maxkasy/cv_and_sure_simulations/blob/HEAD/cvsure_sim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, maxkasy/cv_and_sure_simulations when it was checked","code_sha256":"ba4402a1f89a4c86","code_sha256_prefix":"ba4402a1f89a4c86","mcp_get_code":{"code_sha256":"ba4402a1f89a4c86"}},{"arxiv_id":"2601.21696","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21696","title":"Independent Component Discovery in Temporal Count Data","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"lindermanlab/ssm","path":"ssm/emissions.py","file_url":"https://github.com/lindermanlab/ssm/blob/HEAD/ssm/emissions.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a7769bf072e657d","code_sha256_prefix":"8a7769bf072e657d","mcp_get_code":{"code_sha256":"8a7769bf072e657d"}},{"arxiv_id":"2601.10690","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10690","title":"Data-driven stochastic reduced-order modeling of parametrized dynamical systems","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ailersic/rom-visde","path":"visde/kernel.py","file_url":"https://github.com/ailersic/rom-visde/blob/HEAD/visde/kernel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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, ailersic/rom-visde, is not in the permissive set Syntology serves inline","code_sha256":"1a69388e85d4e868","code_sha256_prefix":"1a69388e85d4e868","mcp_get_code":{"code_sha256":"1a69388e85d4e868"}},{"arxiv_id":"2509.01486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01486","title":"Prior-Guided Flow Matching for Target-Aware Molecule Design with Learnable Atom Number","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CMACH508/PAFlow","path":"models/en_diffusion.py","file_url":"https://github.com/CMACH508/PAFlow/blob/HEAD/models/en_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, CMACH508/PAFlow when it was checked","code_sha256":"e4040c4a1803207f","code_sha256_prefix":"e4040c4a1803207f","mcp_get_code":{"code_sha256":"e4040c4a1803207f"}},{"arxiv_id":"2406.16422","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-cross-domain-few-shot","title":"Exploring Cross-Domain Few-Shot Classification via Frequency-Aware Prompting","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkez/fap_cdfsc","path":"methods/backbone.py","file_url":"https://github.com/tinkez/fap_cdfsc/blob/HEAD/methods/backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, tinkez/fap_cdfsc when it was checked","code_sha256":"938085d32a386023","code_sha256_prefix":"938085d32a386023","mcp_get_code":{"code_sha256":"938085d32a386023"}},{"arxiv_id":"2406.07529","arxiv_id_is_arxiv":true,"paper":"/paper/map-low-compute-model-merging-with-amortized","title":"MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximation","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luli-git/MAP","path":"MAP.py","file_url":"https://github.com/luli-git/MAP/blob/HEAD/MAP.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, luli-git/MAP when it was checked","code_sha256":"e3dd7a56366f7f08","code_sha256_prefix":"e3dd7a56366f7f08","mcp_get_code":{"code_sha256":"e3dd7a56366f7f08"}},{"arxiv_id":"2404.07839","arxiv_id_is_arxiv":true,"paper":"/paper/recurrentgemma-moving-past-transformers-for","title":"RecurrentGemma: Moving Past Transformers for Efficient Open Language Models","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/recurrentgemma","path":"recurrentgemma/jax/complex_lib.py","file_url":"https://github.com/google-deepmind/recurrentgemma/blob/HEAD/recurrentgemma/jax/complex_lib.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":"18974767a2721a73","code_sha256_prefix":"18974767a2721a73","mcp_get_code":{"code_sha256":"18974767a2721a73"}},{"arxiv_id":"2403.00567","arxiv_id_is_arxiv":true,"paper":"/paper/flatten-long-range-loss-landscapes-for-cross","title":"Flatten Long-Range Loss Landscapes for Cross-Domain Few-Shot Learning","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/flor","path":"methods/backbone.py","file_url":"https://github.com/zoilsen/flor/blob/HEAD/methods/backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, zoilsen/flor when it was checked","code_sha256":"938085d32a386023","code_sha256_prefix":"938085d32a386023","mcp_get_code":{"code_sha256":"938085d32a386023"}},{"arxiv_id":"2311.02394","arxiv_id_is_arxiv":true,"paper":"/paper/neuroevobench-benchmarking-evolutionary","title":"NeuroEvoBench: Benchmarking Evolutionary Optimizers for Deep Learning Applications","date":"2023-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuroevobench/neuroevobench","path":"neuroevobench/blines/bo_utils/bo_gp.py","file_url":"https://github.com/neuroevobench/neuroevobench/blob/HEAD/neuroevobench/blines/bo_utils/bo_gp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a02278fd73f185a5","code_sha256_prefix":"a02278fd73f185a5","mcp_get_code":{"code_sha256":"a02278fd73f185a5"}},{"arxiv_id":"2210.12496","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-with-conformal-coverage","title":"Bayesian Optimization with Conformal Prediction Sets","date":"2022-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelstanton/conformal-bayesopt","path":"conformalbo/acquisition/monte_carlo.py","file_url":"https://github.com/samuelstanton/conformal-bayesopt/blob/HEAD/conformalbo/acquisition/monte_carlo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3cdb235923bd8c57","code_sha256_prefix":"3cdb235923bd8c57","mcp_get_code":{"code_sha256":"3cdb235923bd8c57"}},{"arxiv_id":"2210.02419","arxiv_id_is_arxiv":true,"paper":"/paper/explanation-uncertainty-with-decision","title":"Boundary-Aware Uncertainty for Feature Attribution Explainers","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davinhill/gpec","path":"GPEC/utils/utils_np.py","file_url":"https://github.com/davinhill/gpec/blob/HEAD/GPEC/utils/utils_np.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":"ba610ee24487a522","code_sha256_prefix":"ba610ee24487a522","mcp_get_code":{"code_sha256":"ba610ee24487a522"}},{"arxiv_id":"2208.10930","arxiv_id_is_arxiv":true,"paper":"/paper/fs-ban-born-again-networks-for-domain","title":"FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/Born-Again-FS","path":"baseline_model/methods/backbone.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/methods/backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 hytseng0509/CrossDomainFewShot, and GitHub detected no licence in that repository when it was checked","code_sha256":"938085d32a386023","code_sha256_prefix":"938085d32a386023","mcp_get_code":{"code_sha256":"938085d32a386023"}},{"arxiv_id":"2206.05291","arxiv_id_is_arxiv":true,"paper":"/paper/proactive-self-attentive-temporal-point","title":"ProActive: Self-Attentive Temporal Point Process Flows for Activity Sequences","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"data-iitd/proactive","path":"Utils.py","file_url":"https://github.com/data-iitd/proactive/blob/HEAD/Utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61d4401b78d08587","code_sha256_prefix":"61d4401b78d08587","mcp_get_code":{"code_sha256":"61d4401b78d08587"}},{"arxiv_id":"2205.00690","arxiv_id_is_arxiv":true,"paper":"/paper/from-noisy-prediction-to-true-label-noisy","title":"From Noisy Prediction to True Label: Noisy Prediction Calibration via Generative Model","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debajyotid2/noisy_prediction_calibration","path":"src/model.py","file_url":"https://github.com/debajyotid2/noisy_prediction_calibration/blob/HEAD/src/model.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, debajyotid2/noisy_prediction_calibration when it was checked","code_sha256":"71abe0c234120e1b","code_sha256_prefix":"71abe0c234120e1b","mcp_get_code":{"code_sha256":"71abe0c234120e1b"}},{"arxiv_id":"2203.17003","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-diffusion-for-molecule-generation","title":"Equivariant Diffusion for Molecule Generation in 3D","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ehoogeboom/e3_diffusion_for_molecules","path":"equivariant_diffusion/en_diffusion.py","file_url":"https://github.com/ehoogeboom/e3_diffusion_for_molecules/blob/HEAD/equivariant_diffusion/en_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 CMACH508/PAFlow, and GitHub detected no licence in that repository when it was checked","code_sha256":"e4040c4a1803207f","code_sha256_prefix":"e4040c4a1803207f","mcp_get_code":{"code_sha256":"e4040c4a1803207f"}},{"arxiv_id":"2102.13037","arxiv_id_is_arxiv":true,"paper":"/paper/spinn-sparse-physics-based-and-interpretable","title":"SPINN: Sparse, Physics-based, and partially Interpretable Neural Networks for PDEs","date":"2021-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nn4pde/SPINN","path":"automate.py","file_url":"https://github.com/nn4pde/SPINN/blob/HEAD/automate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nn4pde/SPINN (NOASSERTION)","code_sha256":"fb02b519122e4e22","code_sha256_prefix":"fb02b519122e4e22","mcp_get_code":{"code_sha256":"fb02b519122e4e22"}},{"arxiv_id":"2006.09661","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-neural-representations-with-periodic","title":"Implicit Neural Representations with Periodic Activation Functions","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusnie/diffcd","path":"diffcd/networks.py","file_url":"https://github.com/linusnie/diffcd/blob/HEAD/diffcd/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"412ae5f90dd4d2df","code_sha256_prefix":"412ae5f90dd4d2df","mcp_get_code":{"code_sha256":"412ae5f90dd4d2df"}},{"arxiv_id":"2006.05164","arxiv_id_is_arxiv":true,"paper":"/paper/ar-dae-towards-unbiased-neural-entropy","title":"AR-DAE: Towards Unbiased Neural Entropy Gradient Estimation","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lim0606/pytorch-ardae-rl","path":"models/graddae/mlp.py","file_url":"https://github.com/lim0606/pytorch-ardae-rl/blob/HEAD/models/graddae/mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, lim0606/pytorch-ardae-rl when it was checked","code_sha256":"813ad67d00d155ae","code_sha256_prefix":"813ad67d00d155ae","mcp_get_code":{"code_sha256":"813ad67d00d155ae"}},{"arxiv_id":"2004.04096","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-embeddings-for-speaker","title":"Probabilistic embeddings for speaker diarization","date":"2020-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bsxfan/probabilistic_embeddings","path":"lib/special/softplus.py","file_url":"https://github.com/bsxfan/probabilistic_embeddings/blob/HEAD/lib/special/softplus.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":"d82cc22f6cca675b","code_sha256_prefix":"d82cc22f6cca675b","mcp_get_code":{"code_sha256":"d82cc22f6cca675b"}},{"arxiv_id":"2002.09291","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-hawkes-process","title":"Transformer Hawkes Process","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SimiaoZuo/Transformer-Hawkes-Process","path":"Utils.py","file_url":"https://github.com/SimiaoZuo/Transformer-Hawkes-Process/blob/HEAD/Utils.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":"61d4401b78d08587","code_sha256_prefix":"61d4401b78d08587","mcp_get_code":{"code_sha256":"61d4401b78d08587"}},{"arxiv_id":"2002.02428","arxiv_id_is_arxiv":true,"paper":"/paper/normalizing-flows-on-tori-and-spheres","title":"Normalizing Flows on Tori and Spheres","date":"2020-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryushinn/flows-on-sphere","path":"utils.py","file_url":"https://github.com/ryushinn/flows-on-sphere/blob/HEAD/utils.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":"27581ba081b6790c","code_sha256_prefix":"27581ba081b6790c","mcp_get_code":{"code_sha256":"27581ba081b6790c"}},{"arxiv_id":"2001.08735","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-few-shot-classification-via-1","title":"Cross-Domain Few-Shot Classification via Learned Feature-Wise Transformation","date":"2020-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hytseng0509/CrossDomainFewShot","path":"methods/backbone.py","file_url":"https://github.com/hytseng0509/CrossDomainFewShot/blob/HEAD/methods/backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, hytseng0509/CrossDomainFewShot when it was checked","code_sha256":"938085d32a386023","code_sha256_prefix":"938085d32a386023","mcp_get_code":{"code_sha256":"938085d32a386023"}},{"arxiv_id":"1902.08408","arxiv_id_is_arxiv":true,"paper":"/paper/physnet-a-neural-network-for-predicting","title":"PhysNet: A Neural Network for Predicting Energies, Forces, Dipole Moments and Partial Charges","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"qsb300/PhysNetTF2","path":"neural_network/activation_fn.py","file_url":"https://github.com/qsb300/PhysNetTF2/blob/HEAD/neural_network/activation_fn.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":"2afff51165fbb5ea","code_sha256_prefix":"2afff51165fbb5ea","mcp_get_code":{"code_sha256":"2afff51165fbb5ea"}},{"arxiv_id":"1902.08408","arxiv_id_is_arxiv":true,"paper":"/paper/physnet-a-neural-network-for-predicting","title":"PhysNet: A Neural Network for Predicting Energies, Forces, Dipole Moments and Partial Charges","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"qsb300/PhysNetTF2M","path":"neural_network/activation_fn.py","file_url":"https://github.com/qsb300/PhysNetTF2M/blob/HEAD/neural_network/activation_fn.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":"9ac3731380d8f798","code_sha256_prefix":"9ac3731380d8f798","mcp_get_code":{"code_sha256":"9ac3731380d8f798"}},{"arxiv_id":"1902.08408","arxiv_id_is_arxiv":true,"paper":"/paper/physnet-a-neural-network-for-predicting","title":"PhysNet: A Neural Network for Predicting Energies, Forces, Dipole Moments and Partial Charges","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"MeuwlyGroup/PhysNet","path":"neural_network/activation_fn.py","file_url":"https://github.com/MeuwlyGroup/PhysNet/blob/HEAD/neural_network/activation_fn.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":"c4d6f9c2006dbff2","code_sha256_prefix":"c4d6f9c2006dbff2","mcp_get_code":{"code_sha256":"c4d6f9c2006dbff2"}},{"arxiv_id":"1703.04730","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-black-box-predictions-via","title":"Understanding Black-box Predictions via Influence Functions","date":"2017-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kohpangwei/influence-release","path":"influence/all_CNN_c.py","file_url":"https://github.com/kohpangwei/influence-release/blob/HEAD/influence/all_CNN_c.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":"9005c9773d16f9b9","code_sha256_prefix":"9005c9773d16f9b9","mcp_get_code":{"code_sha256":"9005c9773d16f9b9"}},{"arxiv_id":"1408.6686","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-generalized-eigenvalue-problem-via","title":"Sparse Generalized Eigenvalue Problem via Smooth Optimization","date":"2014-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aseyboldt/covadapt","path":"covadapt/eigvals_reg.py","file_url":"https://github.com/aseyboldt/covadapt/blob/HEAD/covadapt/eigvals_reg.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":"d9ed6406e1adf03f","code_sha256_prefix":"d9ed6406e1adf03f","mcp_get_code":{"code_sha256":"d9ed6406e1adf03f"}}],"record_sha256":"50aeb4faf761a0ea17db588c238b1acabcf8e45c67b0486a6f731ebd1f805bcc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}