{"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/train-step","entry":"train_step","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":47,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":23,"n_papers_ran_instrument_only":6,"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":57,"n_samples_ran":33,"n_samples_constructed":0,"n_samples_ran_checked":27,"n_samples_instrument":6,"n_samples_unverified":24,"n_samples_fingerprinted":1,"n_places":58,"n_places_pointer_only":24,"n_places_pointer_only_link_open":0,"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":4,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":3,"ran":23,"unverified":24},"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.22627","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22627","title":"Orthogonal Representation Editing: Decoupling Semantic Entanglement in Batch Knowledge Editing of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YVVH/ORE","path":"ORE/ORE_main.py","file_url":"https://github.com/YVVH/ORE/blob/HEAD/ORE/ORE_main.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":"5813326e00feabd0","code_sha256_prefix":"5813326e00feabd0","mcp_get_code":{"code_sha256":"5813326e00feabd0"}},{"arxiv_id":"2602.17171","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17171","title":"In-Context Learning in Linear vs. Quadratic Attention Models: An Empirical Study on Regression Tasks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Yushgoel/icl-benchmarking","path":"src/training/trainer.py","file_url":"https://github.com/Yushgoel/icl-benchmarking/blob/HEAD/src/training/trainer.py","status":"ran","verification_level":1,"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, Yushgoel/icl-benchmarking when it was checked","code_sha256":"a9cac69a38c2e2f8","code_sha256_prefix":"a9cac69a38c2e2f8","mcp_get_code":{"code_sha256":"a9cac69a38c2e2f8"}},{"arxiv_id":"2512.11784","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-11784","title":"Softmax as Linear Attention in the Large-Prompt Regime: a Measure-based Perspective","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"eboursier/softmax_as_linear","path":"run_experiments.py","file_url":"https://github.com/eboursier/softmax_as_linear/blob/HEAD/run_experiments.py","status":"ran","verification_level":1,"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, eboursier/softmax_as_linear when it was checked","code_sha256":"e770dd61f4f4c86a","code_sha256_prefix":"e770dd61f4f4c86a","mcp_get_code":{"code_sha256":"e770dd61f4f4c86a"}},{"arxiv_id":"2512.01428","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-01428","title":"Masked Symbol Modeling for Demodulation of Oversampled Baseband Communication Signals in Impulsive Noise-Dominated Channels","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"OguzBedir/Masked_Symbol_Modeling","path":"core/engine.py","file_url":"https://github.com/OguzBedir/Masked_Symbol_Modeling/blob/HEAD/core/engine.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, OguzBedir/Masked_Symbol_Modeling when it was checked","code_sha256":"cdc6afbb64a20f40","code_sha256_prefix":"cdc6afbb64a20f40","mcp_get_code":{"code_sha256":"cdc6afbb64a20f40"}},{"arxiv_id":"2511.03197","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-03197","title":"A Probabilistic U-Net Approach to Downscaling Climate Simulations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"MaryamAlipourH/prob-unet-climate-downscaling","path":"src/trainmodel.py","file_url":"https://github.com/MaryamAlipourH/prob-unet-climate-downscaling/blob/HEAD/src/trainmodel.py","status":"ran","verification_level":1,"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, MaryamAlipourH/prob-unet-climate-downscaling when it was checked","code_sha256":"7ba04b2294ce3fac","code_sha256_prefix":"7ba04b2294ce3fac","mcp_get_code":{"code_sha256":"7ba04b2294ce3fac"}},{"arxiv_id":"2509.07963","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07963","title":"Customizing the Inductive Biases of Softmax Attention using Structured Matrices","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"YilunKuang/structured-attention","path":"train_ICL.py","file_url":"https://github.com/YilunKuang/structured-attention/blob/HEAD/train_ICL.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":"6d19d7bf19c36fb9","code_sha256_prefix":"6d19d7bf19c36fb9","mcp_get_code":{"code_sha256":"6d19d7bf19c36fb9"}},{"arxiv_id":"2507.07101","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.07101","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"martin-marek/batch-size","path":"finetuning/finetune.py","file_url":"https://github.com/martin-marek/batch-size/blob/HEAD/finetuning/finetune.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":"063239541bbfbe70","code_sha256_prefix":"063239541bbfbe70","mcp_get_code":{"code_sha256":"063239541bbfbe70"}},{"arxiv_id":"2409.11697","arxiv_id_is_arxiv":true,"paper":"/paper/monomial-matrix-group-equivariant-neural","title":"Monomial Matrix Group Equivariant Neural Functional Networks","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathematicalai-nus/monomial-nfn","path":"experiments/classify_siren.py","file_url":"https://github.com/mathematicalai-nus/monomial-nfn/blob/HEAD/experiments/classify_siren.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":"baf32f15bff306f8","code_sha256_prefix":"baf32f15bff306f8","mcp_get_code":{"code_sha256":"baf32f15bff306f8"}},{"arxiv_id":"2409.02606","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2409.02606","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":null,"repo":"princetonlips/neural_fdm","path":"src/neural_fdm/training.py","file_url":"https://github.com/princetonlips/neural_fdm/blob/HEAD/src/neural_fdm/training.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, princetonlips/neural_fdm when it was checked","code_sha256":"c42ff70c20028648","code_sha256_prefix":"c42ff70c20028648","mcp_get_code":{"code_sha256":"c42ff70c20028648"}},{"arxiv_id":"2406.04601","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-size-generalization-in-graph-neural","title":"Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphminddartmouth/disgen","path":"src/train_util.py","file_url":"https://github.com/graphminddartmouth/disgen/blob/HEAD/src/train_util.py","status":"ran","verification_level":1,"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, graphminddartmouth/disgen when it was checked","code_sha256":"93792408ad287326","code_sha256_prefix":"93792408ad287326","mcp_get_code":{"code_sha256":"93792408ad287326"}},{"arxiv_id":"2404.17752","arxiv_id_is_arxiv":true,"paper":"/paper/generative-diffusion-based-downscaling-for","title":"Generative Diffusion-based Downscaling for Climate","date":"2024-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robbiewatt1/climatediffuse","path":"src/TrainUnet.py","file_url":"https://github.com/robbiewatt1/climatediffuse/blob/HEAD/src/TrainUnet.py","status":"ran","verification_level":1,"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, robbiewatt1/climatediffuse when it was checked","code_sha256":"24c744794804a6b0","code_sha256_prefix":"24c744794804a6b0","mcp_get_code":{"code_sha256":"24c744794804a6b0"}},{"arxiv_id":"2404.06356","arxiv_id_is_arxiv":true,"paper":"/paper/policy-guided-diffusion","title":"Policy-Guided Diffusion","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emptyjackson/policy-guided-diffusion","path":"diffusion/edm.py","file_url":"https://github.com/emptyjackson/policy-guided-diffusion/blob/HEAD/diffusion/edm.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":"9b56bf0de382cda7","code_sha256_prefix":"9b56bf0de382cda7","mcp_get_code":{"code_sha256":"9b56bf0de382cda7"}},{"arxiv_id":"2402.12946","arxiv_id_is_arxiv":true,"paper":"/paper/cell-graph-transformer-for-nuclei","title":"Cell Graph Transformer for Nuclei Classification","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhaof/CGT","path":"models/CGT/run_desc.py","file_url":"https://github.com/lhaof/CGT/blob/HEAD/models/CGT/run_desc.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, lhaof/CGT when it was checked","code_sha256":"2f4c495b7d47dc55","code_sha256_prefix":"2f4c495b7d47dc55","mcp_get_code":{"code_sha256":"2f4c495b7d47dc55"}},{"arxiv_id":"2402.12366","arxiv_id_is_arxiv":true,"paper":"/paper/a-critical-evaluation-of-ai-feedback-for","title":"A Critical Evaluation of AI Feedback for Aligning Large Language Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"architsharma97/dpo-rlaif","path":"reward_trainer.py","file_url":"https://github.com/architsharma97/dpo-rlaif/blob/HEAD/reward_trainer.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":"12be818ac399701d","code_sha256_prefix":"12be818ac399701d","mcp_get_code":{"code_sha256":"12be818ac399701d"}},{"arxiv_id":"2402.04248","arxiv_id_is_arxiv":true,"paper":"/paper/can-mamba-learn-how-to-learn-a-comparative","title":"Can Mamba Learn How to Learn? A Comparative Study on In-Context Learning Tasks","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krafton-ai/mambaformer-icl","path":"src/train_parallel.py","file_url":"https://github.com/krafton-ai/mambaformer-icl/blob/HEAD/src/train_parallel.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":"47f61861b53edf4d","code_sha256_prefix":"47f61861b53edf4d","mcp_get_code":{"code_sha256":"47f61861b53edf4d"}},{"arxiv_id":"2402.03485","arxiv_id_is_arxiv":true,"paper":"/paper/attention-meets-post-hoc-interpretability-a","title":"Attention Meets Post-hoc Interpretability: A Mathematical Perspective","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gianluigilopardo/attention_meets_xai","path":"multi_head_trainer.py","file_url":"https://github.com/gianluigilopardo/attention_meets_xai/blob/HEAD/multi_head_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, gianluigilopardo/attention_meets_xai when it was checked","code_sha256":"63b9f52bfaf4e99d","code_sha256_prefix":"63b9f52bfaf4e99d","mcp_get_code":{"code_sha256":"63b9f52bfaf4e99d"}},{"arxiv_id":"2312.05410","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-materials-simulations-blending","title":"Rethinking materials simulations: Blending direct numerical simulations with neural operators","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vivek-brown/UNet-with-temporal-conditioning","path":"src/code/train_unet.py","file_url":"https://github.com/vivek-brown/UNet-with-temporal-conditioning/blob/HEAD/src/code/train_unet.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, vivek-brown/UNet-with-temporal-conditioning when it was checked","code_sha256":"196ce81dc470cea6","code_sha256_prefix":"196ce81dc470cea6","mcp_get_code":{"code_sha256":"196ce81dc470cea6"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_peptides_func.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_peptides_func.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, skeletondyh/GRED when it was checked","code_sha256":"9bc42f02f987a9cc","code_sha256_prefix":"9bc42f02f987a9cc","mcp_get_code":{"code_sha256":"9bc42f02f987a9cc"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_peptides_struct.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_peptides_struct.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, skeletondyh/GRED when it was checked","code_sha256":"551c7a7eef38710d","code_sha256_prefix":"551c7a7eef38710d","mcp_get_code":{"code_sha256":"551c7a7eef38710d"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_pixel.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_pixel.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, skeletondyh/GRED when it was checked","code_sha256":"5ab5f97bf4fe2a26","code_sha256_prefix":"5ab5f97bf4fe2a26","mcp_get_code":{"code_sha256":"5ab5f97bf4fe2a26"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/GRED","path":"train_sbm.py","file_url":"https://github.com/skeletondyh/GRED/blob/HEAD/train_sbm.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, skeletondyh/GRED when it was checked","code_sha256":"2f7255aaf56805b4","code_sha256_prefix":"2f7255aaf56805b4","mcp_get_code":{"code_sha256":"2f7255aaf56805b4"}},{"arxiv_id":"2311.17141","arxiv_id_is_arxiv":true,"paper":"/paper/a-point-cloud-approach-to-generative-modeling","title":"A point cloud approach to generative modeling for galaxy surveys at the field level","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smsharma/point-cloud-galaxy-diffusion","path":"models/train_utils.py","file_url":"https://github.com/smsharma/point-cloud-galaxy-diffusion/blob/HEAD/models/train_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":"23d317520a5f2b18","code_sha256_prefix":"23d317520a5f2b18","mcp_get_code":{"code_sha256":"23d317520a5f2b18"}},{"arxiv_id":"2310.17086","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-learn-higher-order-optimization","title":"Transformers Learn to Achieve Second-Order Convergence Rates for In-Context Linear Regression","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeqingFu/transformers-icl-second-order","path":"src/train_linear.py","file_url":"https://github.com/DeqingFu/transformers-icl-second-order/blob/HEAD/src/train_linear.py","status":"ran","verification_level":1,"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, DeqingFu/transformers-icl-second-order when it was checked","code_sha256":"dcdff2706acbf855","code_sha256_prefix":"dcdff2706acbf855","mcp_get_code":{"code_sha256":"dcdff2706acbf855"}},{"arxiv_id":"2310.16111","arxiv_id_is_arxiv":true,"paper":"/paper/locally-differentially-private-document","title":"Locally Differentially Private Document Generation Using Zero Shot Prompting","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saitejautpala/dp_prompt","path":"attacks/embedding_attacker_architecture.py","file_url":"https://github.com/saitejautpala/dp_prompt/blob/HEAD/attacks/embedding_attacker_architecture.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":"480709d96ec54bf8","code_sha256_prefix":"480709d96ec54bf8","mcp_get_code":{"code_sha256":"480709d96ec54bf8"}},{"arxiv_id":"2310.16111","arxiv_id_is_arxiv":true,"paper":"/paper/locally-differentially-private-document","title":"Locally Differentially Private Document Generation Using Zero Shot Prompting","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saitejautpala/dp_prompt","path":"mechanisms/sentencelevel/deep_candidate.py","file_url":"https://github.com/saitejautpala/dp_prompt/blob/HEAD/mechanisms/sentencelevel/deep_candidate.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":"6dd4947c1a74cf75","code_sha256_prefix":"6dd4947c1a74cf75","mcp_get_code":{"code_sha256":"6dd4947c1a74cf75"}},{"arxiv_id":"2310.09486","arxiv_id_is_arxiv":true,"paper":"/paper/mirage-model-agnostic-graph-distillation-for","title":"Mirage: Model-Agnostic Graph Distillation for Graph Classification","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-iitd/mirage","path":"ogbg-molbace/optimization/train_and_test.py","file_url":"https://github.com/idea-iitd/mirage/blob/HEAD/ogbg-molbace/optimization/train_and_test.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, idea-iitd/mirage when it was checked","code_sha256":"8aba6b7e1a6477c1","code_sha256_prefix":"8aba6b7e1a6477c1","mcp_get_code":{"code_sha256":"8aba6b7e1a6477c1"}},{"arxiv_id":"2310.07152","arxiv_id_is_arxiv":true,"paper":"/paper/no-privacy-left-outside-on-the-in-security-of","title":"No Privacy Left Outside: On the (In-)Security of TEE-Shielded DNN Partition for On-Device ML","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqi-zhang/teeslice-artifact","path":"membership-inference/knockoff_train.py","file_url":"https://github.com/ziqi-zhang/teeslice-artifact/blob/HEAD/membership-inference/knockoff_train.py","status":"ran","verification_level":1,"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, ziqi-zhang/teeslice-artifact when it was checked","code_sha256":"104afcbc0f6f4143","code_sha256_prefix":"104afcbc0f6f4143","mcp_get_code":{"code_sha256":"104afcbc0f6f4143"}},{"arxiv_id":"2309.00570","arxiv_id_is_arxiv":true,"paper":"/paper/mechanism-of-feature-learning-in","title":"Mechanism of feature learning in convolutional neural networks","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/convrfm","path":"conv_nets/trainer.py","file_url":"https://github.com/aradha/convrfm/blob/HEAD/conv_nets/trainer.py","status":"ran","verification_level":1,"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, aradha/convrfm when it was checked","code_sha256":"8742a8050792c3dd","code_sha256_prefix":"8742a8050792c3dd","mcp_get_code":{"code_sha256":"8742a8050792c3dd"}},{"arxiv_id":"2308.06912","arxiv_id_is_arxiv":true,"paper":"/paper/causallm-is-not-optimal-for-in-context","title":"CausalLM is not optimal for in-context learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/causallm_icl","path":"model_trainer.py","file_url":"https://github.com/google-research/causallm_icl/blob/HEAD/model_trainer.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":"db573bba4a35a0c9","code_sha256_prefix":"db573bba4a35a0c9","mcp_get_code":{"code_sha256":"db573bba4a35a0c9"}},{"arxiv_id":"2306.09468","arxiv_id_is_arxiv":true,"paper":"/paper/ffb-a-fair-fairness-benchmark-for-in","title":"FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahxt/fair_fairness_benchmark","path":"src/ffb_image_diffdp.py","file_url":"https://github.com/ahxt/fair_fairness_benchmark/blob/HEAD/src/ffb_image_diffdp.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":"ec995a87fb3aa08f","code_sha256_prefix":"ec995a87fb3aa08f","mcp_get_code":{"code_sha256":"ec995a87fb3aa08f"}},{"arxiv_id":"2306.09468","arxiv_id_is_arxiv":true,"paper":"/paper/ffb-a-fair-fairness-benchmark-for-in","title":"FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahxt/fair_fairness_benchmark","path":"src/ffb_image_diffeodd.py","file_url":"https://github.com/ahxt/fair_fairness_benchmark/blob/HEAD/src/ffb_image_diffeodd.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":"a6a63d55993a1803","code_sha256_prefix":"a6a63d55993a1803","mcp_get_code":{"code_sha256":"a6a63d55993a1803"}},{"arxiv_id":"2306.09468","arxiv_id_is_arxiv":true,"paper":"/paper/ffb-a-fair-fairness-benchmark-for-in","title":"FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahxt/fair_fairness_benchmark","path":"src/ffb_image_erm.py","file_url":"https://github.com/ahxt/fair_fairness_benchmark/blob/HEAD/src/ffb_image_erm.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":"fdec6b87d8ff457b","code_sha256_prefix":"fdec6b87d8ff457b","mcp_get_code":{"code_sha256":"fdec6b87d8ff457b"}},{"arxiv_id":"2306.09468","arxiv_id_is_arxiv":true,"paper":"/paper/ffb-a-fair-fairness-benchmark-for-in","title":"FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahxt/fair_fairness_benchmark","path":"src/ffb_tabular_adv_gr.py","file_url":"https://github.com/ahxt/fair_fairness_benchmark/blob/HEAD/src/ffb_tabular_adv_gr.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":"4313a3b250fe0838","code_sha256_prefix":"4313a3b250fe0838","mcp_get_code":{"code_sha256":"4313a3b250fe0838"}},{"arxiv_id":"2306.05212","arxiv_id_is_arxiv":true,"paper":"/paper/reta-llm-a-retrieval-augmented-large-language","title":"RETA-LLM: A Retrieval-Augmented Large Language Model Toolkit","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruc-gsai/yulan-ir","path":"WebBrain/generator/run_model_train.py","file_url":"https://github.com/ruc-gsai/yulan-ir/blob/HEAD/WebBrain/generator/run_model_train.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":"3b820c3547a5622d","code_sha256_prefix":"3b820c3547a5622d","mcp_get_code":{"code_sha256":"3b820c3547a5622d"}},{"arxiv_id":"2305.19534","arxiv_id_is_arxiv":true,"paper":"/paper/recasting-self-attention-with-holographic","title":"Recasting Self-Attention with Holographic Reduced Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FutureComputing4AI/Hrrformer","path":"malware/hrrformer_mgpu.py","file_url":"https://github.com/FutureComputing4AI/Hrrformer/blob/HEAD/malware/hrrformer_mgpu.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":"73cf404c6a2e8e98","code_sha256_prefix":"73cf404c6a2e8e98","mcp_get_code":{"code_sha256":"73cf404c6a2e8e98"}},{"arxiv_id":"2305.14876","arxiv_id_is_arxiv":true,"paper":"/paper/2305-14876","title":"Reconstructive Neuron Pruning for Backdoor Defense","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/rnp","path":"train_backdoor.py","file_url":"https://github.com/bboylyg/rnp/blob/HEAD/train_backdoor.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, bboylyg/rnp when it was checked","code_sha256":"1766a1f110a8bd59","code_sha256_prefix":"1766a1f110a8bd59","mcp_get_code":{"code_sha256":"1766a1f110a8bd59"}},{"arxiv_id":"2305.14343","arxiv_id_is_arxiv":true,"paper":"/paper/video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyuolab/VIPER-torch","path":"scripts/train_vqgan.py","file_url":"https://github.com/nyuolab/VIPER-torch/blob/HEAD/scripts/train_vqgan.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":"1afd8c944e46c401","code_sha256_prefix":"1afd8c944e46c401","mcp_get_code":{"code_sha256":"1afd8c944e46c401"}},{"arxiv_id":"2305.14343","arxiv_id_is_arxiv":true,"paper":"/paper/video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyuolab/VIPER-torch","path":"scripts/train_videogpt.py","file_url":"https://github.com/nyuolab/VIPER-torch/blob/HEAD/scripts/train_videogpt.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":"ecce8632ff15a248","code_sha256_prefix":"ecce8632ff15a248","mcp_get_code":{"code_sha256":"ecce8632ff15a248"}},{"arxiv_id":"2303.09166","arxiv_id_is_arxiv":true,"paper":"/paper/identifiability-results-for-multimodal","title":"Identifiability Results for Multimodal Contrastive Learning","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imantdaunhawer/multimodal-contrastive-learning","path":"main_imgtxt.py","file_url":"https://github.com/imantdaunhawer/multimodal-contrastive-learning/blob/HEAD/main_imgtxt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, imantdaunhawer/multimodal-contrastive-learning (NOASSERTION)","code_sha256":"600f5a2225c1b02c","code_sha256_prefix":"600f5a2225c1b02c","mcp_get_code":{"code_sha256":"600f5a2225c1b02c"}},{"arxiv_id":"2303.09166","arxiv_id_is_arxiv":true,"paper":"/paper/identifiability-results-for-multimodal","title":"Identifiability Results for Multimodal Contrastive Learning","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imantdaunhawer/multimodal-contrastive-learning","path":"main_mlp.py","file_url":"https://github.com/imantdaunhawer/multimodal-contrastive-learning/blob/HEAD/main_mlp.py","status":"unverified","verification_level":0,"contract_check":null,"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, imantdaunhawer/multimodal-contrastive-learning (NOASSERTION)","code_sha256":"5b044fb11a2bde22","code_sha256_prefix":"5b044fb11a2bde22","mcp_get_code":{"code_sha256":"5b044fb11a2bde22"}},{"arxiv_id":"2302.04246","arxiv_id_is_arxiv":true,"paper":"/paper/shortcut-detection-with-variational","title":"Shortcut Detection with Variational Autoencoders","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fraunhofer-aisec/shortcut-detection-vae","path":"scripts/train_vae.py","file_url":"https://github.com/fraunhofer-aisec/shortcut-detection-vae/blob/HEAD/scripts/train_vae.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":"c9b5a4e0c35dc967","code_sha256_prefix":"c9b5a4e0c35dc967","mcp_get_code":{"code_sha256":"c9b5a4e0c35dc967"}},{"arxiv_id":"2206.01909","arxiv_id_is_arxiv":true,"paper":"/paper/toward-learning-robust-and-invariant","title":"Toward Learning Robust and Invariant Representations with Alignment Regularization and Data Augmentation","date":"2022-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyanln/alignreg","path":"src/alignreg/tf_training.py","file_url":"https://github.com/jyanln/alignreg/blob/HEAD/src/alignreg/tf_training.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":"b4c6a8550e4357bf","code_sha256_prefix":"b4c6a8550e4357bf","mcp_get_code":{"code_sha256":"b4c6a8550e4357bf"}},{"arxiv_id":"2204.13957","arxiv_id_is_arxiv":true,"paper":"/paper/pie-a-parameter-and-inference-efficient","title":"PIE: a Parameter and Inference Efficient Solution for Large Scale Knowledge Graph Embedding Reasoning","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alipay/parameter_inference_efficient_pie","path":"entity_typing/src/model.py","file_url":"https://github.com/alipay/parameter_inference_efficient_pie/blob/HEAD/entity_typing/src/model.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":"de25933894de2114","code_sha256_prefix":"de25933894de2114","mcp_get_code":{"code_sha256":"de25933894de2114"}},{"arxiv_id":"2201.05989","arxiv_id_is_arxiv":true,"paper":"/paper/instant-neural-graphics-primitives-with-a","title":"Instant Neural Graphics Primitives with a Multiresolution Hash Encoding","date":"2022-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blurgyy/jaxngp","path":"app/imagefit.py","file_url":"https://github.com/blurgyy/jaxngp/blob/HEAD/app/imagefit.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":"b2c79c7c992d6668","code_sha256_prefix":"b2c79c7c992d6668","mcp_get_code":{"code_sha256":"b2c79c7c992d6668"}},{"arxiv_id":"2112.05253","arxiv_id_is_arxiv":true,"paper":"/paper/magma-multimodal-augmentation-of-generative","title":"MAGMA -- Multimodal Augmentation of Generative Models through Adapter-based Finetuning","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aleph-Alpha/magma","path":"magma/train_loop.py","file_url":"https://github.com/Aleph-Alpha/magma/blob/HEAD/magma/train_loop.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":"5c7e7dc9d5bdc305","code_sha256_prefix":"5c7e7dc9d5bdc305","mcp_get_code":{"code_sha256":"5c7e7dc9d5bdc305"}},{"arxiv_id":"2108.12510","arxiv_id_is_arxiv":true,"paper":"/paper/pulling-up-by-the-causal-bootstraps-causal","title":"Pulling Up by the Causal Bootstraps: Causal Data Augmentation for Pre-training Debiasing","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MLforHealth/CausalDA","path":"src/training.py","file_url":"https://github.com/MLforHealth/CausalDA/blob/HEAD/src/training.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":"c146534ad54e89c3","code_sha256_prefix":"c146534ad54e89c3","mcp_get_code":{"code_sha256":"c146534ad54e89c3"}},{"arxiv_id":"2011.00316","arxiv_id_is_arxiv":true,"paper":"/paper/again-vc-a-one-shot-voice-conversion-using","title":"AGAIN-VC: A One-shot Voice Conversion using Activation Guidance and Adaptive Instance Normalization","date":null,"month_inferred_from_arxiv_id":"2020-11","title_source":"archive","repo":"KimythAnly/AGAIN-VC","path":"model/again.py","file_url":"https://github.com/KimythAnly/AGAIN-VC/blob/HEAD/model/again.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":"37bab301d0d6a8f0","code_sha256_prefix":"37bab301d0d6a8f0","mcp_get_code":{"code_sha256":"37bab301d0d6a8f0"}},{"arxiv_id":"2007.06965","arxiv_id_is_arxiv":true,"paper":"/paper/automated-synthetic-to-real-generalization","title":"Automated Synthetic-to-Real Generalization","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/ASG","path":"l2o_train.py","file_url":"https://github.com/NVlabs/ASG/blob/HEAD/l2o_train.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, NVlabs/ASG (NOASSERTION)","code_sha256":"e0b335b3890feb6d","code_sha256_prefix":"e0b335b3890feb6d","mcp_get_code":{"code_sha256":"e0b335b3890feb6d"}},{"arxiv_id":"1804.06872","arxiv_id_is_arxiv":true,"paper":"/paper/co-teaching-robust-training-of-deep-neural","title":"Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labels","date":"2018-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeachan-kr/pytorch-coteaching","path":"runs/train_coteaching.py","file_url":"https://github.com/yeachan-kr/pytorch-coteaching/blob/HEAD/runs/train_coteaching.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yeachan-kr/pytorch-coteaching when it was checked","code_sha256":"5107b016c3d369b0","code_sha256_prefix":"5107b016c3d369b0","mcp_get_code":{"code_sha256":"5107b016c3d369b0"}},{"arxiv_id":"1803.08375","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-using-rectified-linear-units","title":"Deep Learning using Rectified Linear Units (ReLU)","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AFAgarap/relu-classifier","path":"models/neural_net.py","file_url":"https://github.com/AFAgarap/relu-classifier/blob/HEAD/models/neural_net.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":"b43efda1e2fdb72e","code_sha256_prefix":"b43efda1e2fdb72e","mcp_get_code":{"code_sha256":"b43efda1e2fdb72e"}},{"arxiv_id":"1707.04585","arxiv_id_is_arxiv":true,"paper":"/paper/the-reversible-residual-network","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","date":"2017-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengye/revnet-public","path":"run_cifar_train.py","file_url":"https://github.com/renmengye/revnet-public/blob/HEAD/run_cifar_train.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":"afcb9f0b0da3af03","code_sha256_prefix":"afcb9f0b0da3af03","mcp_get_code":{"code_sha256":"afcb9f0b0da3af03"}},{"arxiv_id":"1707.04585","arxiv_id_is_arxiv":true,"paper":"/paper/the-reversible-residual-network","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","date":"2017-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengye/revnet-public","path":"run_imagenet_train.py","file_url":"https://github.com/renmengye/revnet-public/blob/HEAD/run_imagenet_train.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":"c5abb3c9365dc91c","code_sha256_prefix":"c5abb3c9365dc91c","mcp_get_code":{"code_sha256":"c5abb3c9365dc91c"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajaystar8/PDRUNet-PyTorch","path":"engine.py","file_url":"https://github.com/ajaystar8/PDRUNet-PyTorch/blob/HEAD/engine.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":"9bd37700bbb48c38","code_sha256_prefix":"9bd37700bbb48c38","mcp_get_code":{"code_sha256":"9bd37700bbb48c38"}},{"arxiv_id":"1512.02325","arxiv_id_is_arxiv":true,"paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aniketmaurya/ssd-tf2-tfds","path":"train_tfds.py","file_url":"https://github.com/aniketmaurya/ssd-tf2-tfds/blob/HEAD/train_tfds.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":"aea7d0ddcbf2b4b3","code_sha256_prefix":"aea7d0ddcbf2b4b3","mcp_get_code":{"code_sha256":"aea7d0ddcbf2b4b3"}},{"arxiv_id":"1409.7495","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenkang121/DANN","path":"DANN_minit_to_mnist_m.py","file_url":"https://github.com/chenkang121/DANN/blob/HEAD/DANN_minit_to_mnist_m.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chenkang121/DANN when it was checked","code_sha256":"810938a759273697","code_sha256_prefix":"810938a759273697","mcp_get_code":{"code_sha256":"810938a759273697"}},{"arxiv_id":"aaai_21180","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21180","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yuanmu97/MLink","path":"mlink/seq_to_seq.py","file_url":"https://github.com/yuanmu97/MLink/blob/HEAD/mlink/seq_to_seq.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":"505ddfc37d48c30b","code_sha256_prefix":"505ddfc37d48c30b","mcp_get_code":{"code_sha256":"505ddfc37d48c30b"}},{"arxiv_id":"aaai_21180","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21180","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yuanmu97/MLink","path":"mlink/vec_to_seq.py","file_url":"https://github.com/yuanmu97/MLink/blob/HEAD/mlink/vec_to_seq.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":"fed5424f4f1af917","code_sha256_prefix":"fed5424f4f1af917","mcp_get_code":{"code_sha256":"fed5424f4f1af917"}},{"arxiv_id":"2023.findings-emnlp.566","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.566","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SaitejaUtpala/dp_prompt","path":"attacks/embedding_attacker_architecture.py","file_url":"https://github.com/SaitejaUtpala/dp_prompt/blob/HEAD/attacks/embedding_attacker_architecture.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":"480709d96ec54bf8","code_sha256_prefix":"480709d96ec54bf8","mcp_get_code":{"code_sha256":"480709d96ec54bf8"}}],"record_sha256":"984de097b81a520ee1d6ad17047d59d00f098ffd0d1865d41b2ef1a2ace15151","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}