{"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","entry":"train","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":522,"n_papers_ran":210,"n_papers_ran_no_instrument_failure":168,"n_papers_ran_instrument_only":42,"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":616,"n_samples_ran":234,"n_samples_constructed":0,"n_samples_ran_checked":190,"n_samples_instrument":44,"n_samples_unverified":382,"n_samples_fingerprinted":4,"n_places":643,"n_places_pointer_only":255,"n_places_pointer_only_link_open":1,"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":39,"ran_violates":1,"ran_draft_wrong":31,"ran_fixture":13,"ran":150,"unverified":382},"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":"2609.01888","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01888","title":"Does Playing it Safe Count as Faithfulness? Reassessing LVLM Hallucination Mitigation Methods","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mehrdadfazli/AssessHalVLM","path":"methods/after/train_estimator.py","file_url":"https://github.com/mehrdadfazli/AssessHalVLM/blob/HEAD/methods/after/train_estimator.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, mehrdadfazli/AssessHalVLM when it was checked","code_sha256":"69b18779ad10493b","code_sha256_prefix":"69b18779ad10493b","mcp_get_code":{"code_sha256":"69b18779ad10493b"}},{"arxiv_id":"2608.17171","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17171","title":"Polaris: Learning to Generate Table Descriptions from Retrieval Feedback","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"anhaidgroup/polaris","path":"polaris/dpo.py","file_url":"https://github.com/anhaidgroup/polaris/blob/HEAD/polaris/dpo.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":"f53e0fd9fbcbd09f","code_sha256_prefix":"f53e0fd9fbcbd09f","mcp_get_code":{"code_sha256":"f53e0fd9fbcbd09f"}},{"arxiv_id":"2608.10636","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10636","title":"DistilVDR: A Compact End-to-End Visual Document Retriever via Dual-Student Distillation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Ryenhails/NanoVDR","path":"nanovdr/train/engine.py","file_url":"https://github.com/Ryenhails/NanoVDR/blob/HEAD/nanovdr/train/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":"127a0feff3a2188e","code_sha256_prefix":"127a0feff3a2188e","mcp_get_code":{"code_sha256":"127a0feff3a2188e"}},{"arxiv_id":"2607.09371","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09371","title":"Spectrally Deconfounded Gradient Boosting","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"fabsig/GPBoost","path":"python-package/gpboost/engine.py","file_url":"https://github.com/fabsig/GPBoost/blob/HEAD/python-package/gpboost/engine.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, fabsig/GPBoost (NOASSERTION)","code_sha256":"4772352de75c28c7","code_sha256_prefix":"4772352de75c28c7","mcp_get_code":{"code_sha256":"4772352de75c28c7"}},{"arxiv_id":"2607.00671","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-00671","title":"Multi-Label Node Classification with Label Influence Propagation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Xtra-Computing/LIP_MLNC","path":"main_lip.py","file_url":"https://github.com/Xtra-Computing/LIP_MLNC/blob/HEAD/main_lip.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, Xtra-Computing/LIP_MLNC when it was checked","code_sha256":"7c09811451e578c2","code_sha256_prefix":"7c09811451e578c2","mcp_get_code":{"code_sha256":"7c09811451e578c2"}},{"arxiv_id":"2606.29706","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29706","title":"ARMOR: Adaptive Retriever Optimization for Low-Resource Telecom Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"heshandevaka/ARMOR","path":"retriever_training/train_armor.py","file_url":"https://github.com/heshandevaka/ARMOR/blob/HEAD/retriever_training/train_armor.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":"fd86ed415f30d13b","code_sha256_prefix":"fd86ed415f30d13b","mcp_get_code":{"code_sha256":"fd86ed415f30d13b"}},{"arxiv_id":"2606.19374","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19374","title":"Protein Representation Learning with Secondary-Structure and Energy-Filtered Hydrogen-Bond Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mohamedmohamed2021/SSProNet","path":"run_ProNet.py","file_url":"https://github.com/mohamedmohamed2021/SSProNet/blob/HEAD/run_ProNet.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, mohamedmohamed2021/SSProNet when it was checked","code_sha256":"88aa51b004dc8bdf","code_sha256_prefix":"88aa51b004dc8bdf","mcp_get_code":{"code_sha256":"88aa51b004dc8bdf"}},{"arxiv_id":"2606.13568","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-13568","title":"Adjusted Cup-Product Neural Layer","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nssprogrammer/cup-nn","path":"experiments/mbchern.py","file_url":"https://github.com/nssprogrammer/cup-nn/blob/HEAD/experiments/mbchern.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":"e970b3965de044c9","code_sha256_prefix":"e970b3965de044c9","mcp_get_code":{"code_sha256":"e970b3965de044c9"}},{"arxiv_id":"2606.08574","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-08574","title":"OrderDP: A Theoretically Guaranteed Lossless Dynamic Data Pruning Framework","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"shengze-xu/OrderDP","path":"imagenet/prune_experiment_orderdp.py","file_url":"https://github.com/shengze-xu/OrderDP/blob/HEAD/imagenet/prune_experiment_orderdp.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, shengze-xu/OrderDP when it was checked","code_sha256":"61c792e4de50ba01","code_sha256_prefix":"61c792e4de50ba01","mcp_get_code":{"code_sha256":"61c792e4de50ba01"}},{"arxiv_id":"2606.08574","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-08574","title":"OrderDP: A Theoretically Guaranteed Lossless Dynamic Data Pruning Framework","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"shengze-xu/OrderDP","path":"imagenet/prune_experiment_unsup.py","file_url":"https://github.com/shengze-xu/OrderDP/blob/HEAD/imagenet/prune_experiment_unsup.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, shengze-xu/OrderDP when it was checked","code_sha256":"e826073a8a2eebf4","code_sha256_prefix":"e826073a8a2eebf4","mcp_get_code":{"code_sha256":"e826073a8a2eebf4"}},{"arxiv_id":"2606.07728","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07728","title":"Characterizing the Discrete Geometry of ReLU Networks","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"bl-ake/ICLR-2026","path":"experiments.py","file_url":"https://github.com/bl-ake/ICLR-2026/blob/HEAD/experiments.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, bl-ake/ICLR-2026 when it was checked","code_sha256":"02895932687b47c7","code_sha256_prefix":"02895932687b47c7","mcp_get_code":{"code_sha256":"02895932687b47c7"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/CC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/CC.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":"d0f49064fbed326b","code_sha256_prefix":"d0f49064fbed326b","mcp_get_code":{"code_sha256":"d0f49064fbed326b"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/DIVC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/DIVC.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":"47d9f496a3f5f2d3","code_sha256_prefix":"47d9f496a3f5f2d3","mcp_get_code":{"code_sha256":"47d9f496a3f5f2d3"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/PICA.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/PICA.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":"83c6fcc5dbf3b90f","code_sha256_prefix":"83c6fcc5dbf3b90f","mcp_get_code":{"code_sha256":"83c6fcc5dbf3b90f"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/DEC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/DEC.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":"25747a9d381c8339","code_sha256_prefix":"25747a9d381c8339","mcp_get_code":{"code_sha256":"25747a9d381c8339"}},{"arxiv_id":"2605.29933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29933","title":"CLUBench: A Clustering Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xiaofeng-github/CLUBench","path":"CLUBench/algorithms/IDEC.py","file_url":"https://github.com/xiaofeng-github/CLUBench/blob/HEAD/CLUBench/algorithms/IDEC.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":"e26e1f92ac47c906","code_sha256_prefix":"e26e1f92ac47c906","mcp_get_code":{"code_sha256":"e26e1f92ac47c906"}},{"arxiv_id":"2605.26733","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26733","title":"Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"njuyxw/STARS","path":"ouro_experiment/train_large.py","file_url":"https://github.com/njuyxw/STARS/blob/HEAD/ouro_experiment/train_large.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, njuyxw/STARS when it was checked","code_sha256":"f6f5bd43bec6368a","code_sha256_prefix":"f6f5bd43bec6368a","mcp_get_code":{"code_sha256":"f6f5bd43bec6368a"}},{"arxiv_id":"2605.24903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24903","title":"SEED: Semi-supervised Continual MalwarE Detection for Tackling ConcEpt Drift on a BuDget","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"amalapuram/SEED","path":"SSCL.py","file_url":"https://github.com/amalapuram/SEED/blob/HEAD/SSCL.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, amalapuram/SEED when it was checked","code_sha256":"e0030d15324d9552","code_sha256_prefix":"e0030d15324d9552","mcp_get_code":{"code_sha256":"e0030d15324d9552"}},{"arxiv_id":"2605.22644","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22644","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"brain-lab-research/SGDiffusion","path":"src/statistic.py","file_url":"https://github.com/brain-lab-research/SGDiffusion/blob/HEAD/src/statistic.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, brain-lab-research/SGDiffusion when it was checked","code_sha256":"d0d3b43ce3b9e921","code_sha256_prefix":"d0d3b43ce3b9e921","mcp_get_code":{"code_sha256":"d0d3b43ce3b9e921"}},{"arxiv_id":"2605.17839","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17839","title":"Balancing Knowledge Distillation for Imbalance Learning with Bilevel Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"phan-tho/Bilevel-balancing-kd","path":"train_student.py","file_url":"https://github.com/phan-tho/Bilevel-balancing-kd/blob/HEAD/train_student.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, phan-tho/Bilevel-balancing-kd when it was checked","code_sha256":"065d2cb0ad758aed","code_sha256_prefix":"065d2cb0ad758aed","mcp_get_code":{"code_sha256":"065d2cb0ad758aed"}},{"arxiv_id":"2605.10395","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10395","title":"Sharp feature-learning transitions and Bayes-optimal neural scaling laws in extensive-width networks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Minh-Toan/scaling-laws","path":"sgd.py","file_url":"https://github.com/Minh-Toan/scaling-laws/blob/HEAD/sgd.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, Minh-Toan/scaling-laws when it was checked","code_sha256":"a1741ebdbf77adc8","code_sha256_prefix":"a1741ebdbf77adc8","mcp_get_code":{"code_sha256":"a1741ebdbf77adc8"}},{"arxiv_id":"2605.08464","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08464","title":"The Geometric Structure of Models Learning Sparse Data","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ThomasWalker1/RFAM","path":"utils/rfm.py","file_url":"https://github.com/ThomasWalker1/RFAM/blob/HEAD/utils/rfm.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, ThomasWalker1/RFAM when it was checked","code_sha256":"6ec0ce87d7ed07f5","code_sha256_prefix":"6ec0ce87d7ed07f5","mcp_get_code":{"code_sha256":"6ec0ce87d7ed07f5"}},{"arxiv_id":"2605.00604","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00604","title":"Affinity Is Not Enough: Recovering the Free Energy Principle in Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"russellwmy/affinity-is-not-enough","path":"prototype/ablation.py","file_url":"https://github.com/russellwmy/affinity-is-not-enough/blob/HEAD/prototype/ablation.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":"8224a4d3a0cba015","code_sha256_prefix":"8224a4d3a0cba015","mcp_get_code":{"code_sha256":"8224a4d3a0cba015"}},{"arxiv_id":"2604.16593","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-16593","title":"Revisiting a Pain in the Neck: A Semantic Reasoning Benchmark for Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jacklanda/SemanticQA","path":"semantic_qa/training/semantic-phrases-interpretation/finetune_t5_paraphrase.py","file_url":"https://github.com/jacklanda/SemanticQA/blob/HEAD/semantic_qa/training/semantic-phrases-interpretation/finetune_t5_paraphrase.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":"2c049b37a5596d8f","code_sha256_prefix":"2c049b37a5596d8f","mcp_get_code":{"code_sha256":"2c049b37a5596d8f"}},{"arxiv_id":"2603.06248","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-06248","title":"Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"tml-epfl/softmax","path":"exp_classification.py","file_url":"https://github.com/tml-epfl/softmax/blob/HEAD/exp_classification.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, tml-epfl/softmax when it was checked","code_sha256":"0dbeea554881e4bd","code_sha256_prefix":"0dbeea554881e4bd","mcp_get_code":{"code_sha256":"0dbeea554881e4bd"}},{"arxiv_id":"2602.21307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21307","title":"SymTorch: Symbolic Distillation of Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"astroautomata/SymTorch","path":"case_studies/pinn_demo/pinn_script.py","file_url":"https://github.com/astroautomata/SymTorch/blob/HEAD/case_studies/pinn_demo/pinn_script.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, astroautomata/SymTorch when it was checked","code_sha256":"c470692c665eb0c0","code_sha256_prefix":"c470692c665eb0c0","mcp_get_code":{"code_sha256":"c470692c665eb0c0"}},{"arxiv_id":"2602.07915","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07915","title":"CausalCompass: Evaluating the Robustness of Time-Series Causal Discovery in Misspecified Scenarios","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ckassaad/causal_discovery_for_time_series","path":"baselines/scripts_python/kitmi.py","file_url":"https://github.com/ckassaad/causal_discovery_for_time_series/blob/HEAD/baselines/scripts_python/kitmi.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, ckassaad/causal_discovery_for_time_series when it was checked","code_sha256":"525a91883f4d1214","code_sha256_prefix":"525a91883f4d1214","mcp_get_code":{"code_sha256":"525a91883f4d1214"}},{"arxiv_id":"2602.03824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03824","title":"Quantifying Avian Morphological Evolution through Deep Representation Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sun-jiao/MetaFGNet","path":"MetaFGNet_with_Sample_Selection/trainer.py","file_url":"https://github.com/sun-jiao/MetaFGNet/blob/HEAD/MetaFGNet_with_Sample_Selection/trainer.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":"98d6f3bacdbea87a","code_sha256_prefix":"98d6f3bacdbea87a","mcp_get_code":{"code_sha256":"98d6f3bacdbea87a"}},{"arxiv_id":"2602.03824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03824","title":"Quantifying Avian Morphological Evolution through Deep Representation Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sun-jiao/MetaFGNet","path":"MetaFGNet_without_Sample_Selection/trainer.py","file_url":"https://github.com/sun-jiao/MetaFGNet/blob/HEAD/MetaFGNet_without_Sample_Selection/trainer.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":"3236c67cd90174fa","code_sha256_prefix":"3236c67cd90174fa","mcp_get_code":{"code_sha256":"3236c67cd90174fa"}},{"arxiv_id":"2602.01139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01139","title":"-I ∈ R n×n : The Identity matrix; -A ∈ [0, 1] n×n : The Adjacency matrix of G; -D ∈ R n×n : The degree matrix, i.e., a diagonal matrix defined as D ii = ∑ n i=1 a ij ; -A ∈ R n×n : The normalized adjacency matrix of G, i.e., A = D -1/2 AD -1/2 ; -L ∈ R n×n : The Unnormalised Laplacian matrix of G; -Q ∈ R n×n : The Signless Laplacian matrix of G; -L rw ∈ R n×n : The Random-walk Normalised Laplacian of G; vii -L sym ∈ R n×n : The Symmetric Normalised Laplacian matrix of G; -Â ∈ R n×n : The Normalised Adjacency matrix of G; λ 1 (L rw ) : The Equidistribution radius of G; ϱ r (H) : The Normalized Spectral Gap of G; -X G ∈ R n×K , or simply X ∈ R n×K : The node feature matrix of the graph G, obtained by stacking up all x i vectors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Sennadir/GCORN","path":"utils.py","file_url":"https://github.com/Sennadir/GCORN/blob/HEAD/utils.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":"2ee40e003ac849b9","code_sha256_prefix":"2ee40e003ac849b9","mcp_get_code":{"code_sha256":"2ee40e003ac849b9"}},{"arxiv_id":"2601.03401","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03401","title":"Rendering Data Unlearnable by Exploiting LLM Alignment Mechanisms","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cat-claws/unlearnable","path":"cifar10-retrain.py","file_url":"https://github.com/cat-claws/unlearnable/blob/HEAD/cifar10-retrain.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, cat-claws/unlearnable when it was checked","code_sha256":"84300d44f7c4a28c","code_sha256_prefix":"84300d44f7c4a28c","mcp_get_code":{"code_sha256":"84300d44f7c4a28c"}},{"arxiv_id":"2512.17762","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-17762","title":"Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Graph-ECHO-Benchmark/ECHO","path":"PyG_implementation/echo_benchmark_example.py","file_url":"https://github.com/Graph-ECHO-Benchmark/ECHO/blob/HEAD/PyG_implementation/echo_benchmark_example.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":"2f8e820b05290657","code_sha256_prefix":"2f8e820b05290657","mcp_get_code":{"code_sha256":"2f8e820b05290657"}},{"arxiv_id":"2511.03168","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-03168","title":"UnCLe: Towards Scalable Dynamic Causal Discovery in Non-linear Temporal Systems","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"M-Nauta/TCDF","path":"TCDF.py","file_url":"https://github.com/M-Nauta/TCDF/blob/HEAD/TCDF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, M-Nauta/TCDF, is not in the permissive set Syntology serves inline","code_sha256":"370f9d40e486fc23","code_sha256_prefix":"370f9d40e486fc23","mcp_get_code":{"code_sha256":"370f9d40e486fc23"}},{"arxiv_id":"2510.07474","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07474","title":"Surrogate Modeling for the Design of Optimal Lattice Structures using Tensor Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion","path":"tensor_completion_models/codes_costco_tucker/TuckER.py","file_url":"https://github.com/shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion/blob/HEAD/tensor_completion_models/codes_costco_tucker/TuckER.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, shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion when it was checked","code_sha256":"5e612b463d9352f9","code_sha256_prefix":"5e612b463d9352f9","mcp_get_code":{"code_sha256":"5e612b463d9352f9"}},{"arxiv_id":"2510.03690","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03690","title":"From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"aliaaz99/moments2models","path":"gmam/encoder.py","file_url":"https://github.com/aliaaz99/moments2models/blob/HEAD/gmam/encoder.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, aliaaz99/moments2models when it was checked","code_sha256":"2ba08c7acbc38f37","code_sha256_prefix":"2ba08c7acbc38f37","mcp_get_code":{"code_sha256":"2ba08c7acbc38f37"}},{"arxiv_id":"2509.18376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_amazon_ratings.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_amazon_ratings.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, idea-iitd/GnnXemplar when it was checked","code_sha256":"7440801ef06f8848","code_sha256_prefix":"7440801ef06f8848","mcp_get_code":{"code_sha256":"7440801ef06f8848"}},{"arxiv_id":"2509.18376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_arxiv_gcn.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_arxiv_gcn.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, idea-iitd/GnnXemplar when it was checked","code_sha256":"f0acc30a9e7ed1aa","code_sha256_prefix":"f0acc30a9e7ed1aa","mcp_get_code":{"code_sha256":"f0acc30a9e7ed1aa"}},{"arxiv_id":"2509.18376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_citeseer.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_citeseer.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, idea-iitd/GnnXemplar when it was checked","code_sha256":"afdfd772a195bd6b","code_sha256_prefix":"afdfd772a195bd6b","mcp_get_code":{"code_sha256":"afdfd772a195bd6b"}},{"arxiv_id":"2509.12019","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12019","title":"AMQ: Enabling AutoML for Mixed-precision Weight-Only Quantization of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"dlwns147/amq","path":"amq/predictor/mlp.py","file_url":"https://github.com/dlwns147/amq/blob/HEAD/amq/predictor/mlp.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":"1953dc972a2df485","code_sha256_prefix":"1953dc972a2df485","mcp_get_code":{"code_sha256":"1953dc972a2df485"}},{"arxiv_id":"2507.20163","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.20163","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"Zeyu1226-mt/LLM-IAVC","path":"stage_two/train_LLM_VC_1.py","file_url":"https://github.com/Zeyu1226-mt/LLM-IAVC/blob/HEAD/stage_two/train_LLM_VC_1.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, Zeyu1226-mt/LLM-IAVC when it was checked","code_sha256":"59d3ab6821c52d5b","code_sha256_prefix":"59d3ab6821c52d5b","mcp_get_code":{"code_sha256":"59d3ab6821c52d5b"}},{"arxiv_id":"2507.20163","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.20163","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"Zeyu1226-mt/LLM-IAVC","path":"code/player_train_timesformer.py","file_url":"https://github.com/Zeyu1226-mt/LLM-IAVC/blob/HEAD/code/player_train_timesformer.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, Zeyu1226-mt/LLM-IAVC when it was checked","code_sha256":"2c202dc2baf250be","code_sha256_prefix":"2c202dc2baf250be","mcp_get_code":{"code_sha256":"2c202dc2baf250be"}},{"arxiv_id":"2507.03474","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-machine-learning-using-euler","title":"Molecular Machine Learning Using Euler Characteristic Transforms","date":"2025-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victosdur/ectformoleculelearningtask","path":"utils.py","file_url":"https://github.com/victosdur/ectformoleculelearningtask/blob/HEAD/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":"9c2f1520e0b48e84","code_sha256_prefix":"9c2f1520e0b48e84","mcp_get_code":{"code_sha256":"9c2f1520e0b48e84"}},{"arxiv_id":"2506.07549","arxiv_id_is_arxiv":true,"paper":"/paper/improving-memory-efficiency-for-training-kans","title":"Improving Memory Efficiency for Training KANs via Meta Learning","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murphyzc/metakan","path":"image_classification/train_meta.py","file_url":"https://github.com/murphyzc/metakan/blob/HEAD/image_classification/train_meta.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, murphyzc/metakan when it was checked","code_sha256":"f5071e69b20f7f81","code_sha256_prefix":"f5071e69b20f7f81","mcp_get_code":{"code_sha256":"f5071e69b20f7f81"}},{"arxiv_id":"2505.23176","arxiv_id_is_arxiv":true,"paper":"/paper/the-panaceas-for-improving-low-rank","title":"The Panaceas for Improving Low-Rank Decomposition in Communication-Efficient Federated Learning","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leopold1423/fedmud-icml25","path":"train/trainer.py","file_url":"https://github.com/leopold1423/fedmud-icml25/blob/HEAD/train/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, leopold1423/fedmud-icml25 when it was checked","code_sha256":"27cbdeab90a7fc0d","code_sha256_prefix":"27cbdeab90a7fc0d","mcp_get_code":{"code_sha256":"27cbdeab90a7fc0d"}},{"arxiv_id":"2505.19932","arxiv_id_is_arxiv":true,"paper":"/paper/logic-gate-neural-networks-are-good-for","title":"Logic Gate Neural Networks are Good for Verification","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HyberionBrew/difflogic_verify","path":"train_model.py","file_url":"https://github.com/HyberionBrew/difflogic_verify/blob/HEAD/train_model.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":"c9d259cd59abf3c7","code_sha256_prefix":"c9d259cd59abf3c7","mcp_get_code":{"code_sha256":"c9d259cd59abf3c7"}},{"arxiv_id":"2505.19764","arxiv_id_is_arxiv":true,"paper":"/paper/agentic-predictor-performance-prediction-for","title":"Agentic Predictor: Performance Prediction for Agentic Workflows via Multi-View Encoding","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepauto-ai/agentic-predictor","path":"agent_predictor/train_mvgnn.py","file_url":"https://github.com/deepauto-ai/agentic-predictor/blob/HEAD/agent_predictor/train_mvgnn.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":"30f9fa49f5eecb6a","code_sha256_prefix":"30f9fa49f5eecb6a","mcp_get_code":{"code_sha256":"30f9fa49f5eecb6a"}},{"arxiv_id":"2505.13027","arxiv_id_is_arxiv":true,"paper":"/paper/unpacking-positional-encoding-in-transformers","title":"Unpacking Positional Encoding in Transformers: A Spectral Analysis of Content-Position Coupling","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qihuai27/Deposit-Pattern-Research","path":"count_gen/2_models/mla.py","file_url":"https://github.com/Qihuai27/Deposit-Pattern-Research/blob/HEAD/count_gen/2_models/mla.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":"f7002b57212e6f6f","code_sha256_prefix":"f7002b57212e6f6f","mcp_get_code":{"code_sha256":"f7002b57212e6f6f"}},{"arxiv_id":"2504.10817","arxiv_id_is_arxiv":true,"paper":"/paper/fhbench-towards-efficient-and-personalized","title":"FHBench: Towards Efficient and Personalized Federated Learning for Multimodal Healthcare","date":"2025-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wph6/fhbench","path":"Audio_Lora/core/traineval.py","file_url":"https://github.com/wph6/fhbench/blob/HEAD/Audio_Lora/core/traineval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"adf461a24e27811e","code_sha256_prefix":"adf461a24e27811e","mcp_get_code":{"code_sha256":"adf461a24e27811e"}},{"arxiv_id":"2503.17782","arxiv_id_is_arxiv":true,"paper":"/paper/goal-global-local-object-alignment-learning","title":"GOAL: Global-local Object Alignment Learning","date":"2025-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PerceptualAI-Lab/GOAL","path":"goal.py","file_url":"https://github.com/PerceptualAI-Lab/GOAL/blob/HEAD/goal.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, PerceptualAI-Lab/GOAL when it was checked","code_sha256":"f2535872761f96c6","code_sha256_prefix":"f2535872761f96c6","mcp_get_code":{"code_sha256":"f2535872761f96c6"}},{"arxiv_id":"2503.17267","arxiv_id_is_arxiv":true,"paper":"/paper/physical-plausibility-aware-trajectory","title":"Physical Plausibility-aware Trajectory Prediction via Locomotion Embodiment","date":"2025-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ImIntheMiddle/EmLoco","path":"EqMotion/main_eth_diverse.py","file_url":"https://github.com/ImIntheMiddle/EmLoco/blob/HEAD/EqMotion/main_eth_diverse.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":"74dc8d1665324c49","code_sha256_prefix":"74dc8d1665324c49","mcp_get_code":{"code_sha256":"74dc8d1665324c49"}},{"arxiv_id":"2502.15828","arxiv_id_is_arxiv":true,"paper":"/paper/a-stronger-mixture-of-low-rank-experts-for","title":"A Stronger Mixture of Low-Rank Experts for Fine-Tuning Foundation Models","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/moelora_riemannian","path":"train_llama.py","file_url":"https://github.com/thudm/moelora_riemannian/blob/HEAD/train_llama.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, thudm/moelora_riemannian when it was checked","code_sha256":"5be4c50239d0eed7","code_sha256_prefix":"5be4c50239d0eed7","mcp_get_code":{"code_sha256":"5be4c50239d0eed7"}},{"arxiv_id":"2502.00270","arxiv_id_is_arxiv":true,"paper":"/paper/duet-optimizing-training-data-mixtures-via","title":"DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Tasks","date":"2025-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmsdapfmbf/duet","path":"BO.py","file_url":"https://github.com/pmsdapfmbf/duet/blob/HEAD/BO.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":"cc175e23e0a2d108","code_sha256_prefix":"cc175e23e0a2d108","mcp_get_code":{"code_sha256":"cc175e23e0a2d108"}},{"arxiv_id":"2501.07575","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-committee-voting","title":"Dataset Distillation via Committee Voting","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/cv-dd","path":"squeeze/squeeze_imagenet1k_prior.py","file_url":"https://github.com/jiacheng8/cv-dd/blob/HEAD/squeeze/squeeze_imagenet1k_prior.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":"ff01d3802d4ba4b2","code_sha256_prefix":"ff01d3802d4ba4b2","mcp_get_code":{"code_sha256":"ff01d3802d4ba4b2"}},{"arxiv_id":"2501.05906","arxiv_id_is_arxiv":true,"paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"mol_pretrain.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/mol_pretrain.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":"a1df49500665d958","code_sha256_prefix":"a1df49500665d958","mcp_get_code":{"code_sha256":"a1df49500665d958"}},{"arxiv_id":"2501.05906","arxiv_id_is_arxiv":true,"paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"xyz_pretrain.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/xyz_pretrain.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":"2d25e9e17df1e84f","code_sha256_prefix":"2d25e9e17df1e84f","mcp_get_code":{"code_sha256":"2d25e9e17df1e84f"}},{"arxiv_id":"2412.21197","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-scale-study-on-video-action-dataset","title":"A Large-Scale Study on Video Action Dataset Condensation","date":"2024-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcg-nju/video-dc","path":"val.py","file_url":"https://github.com/mcg-nju/video-dc/blob/HEAD/val.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":"98d8180630eb3d57","code_sha256_prefix":"98d8180630eb3d57","mcp_get_code":{"code_sha256":"98d8180630eb3d57"}},{"arxiv_id":"2412.15241","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-positional-biases-in-text","title":"Quantifying Positional Biases in Text Embedding Models","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgoel97/neurips-embedding-positional-bias","path":"finetune.py","file_url":"https://github.com/sgoel97/neurips-embedding-positional-bias/blob/HEAD/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":"46d3e1bae86d145b","code_sha256_prefix":"46d3e1bae86d145b","mcp_get_code":{"code_sha256":"46d3e1bae86d145b"}},{"arxiv_id":"2412.12841","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-and-understanding-compositional","title":"Benchmarking and Understanding Compositional Relational Reasoning of LLMs","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyun-ai/gar","path":"MLP/code/train_and_test_MLP.py","file_url":"https://github.com/caiyun-ai/gar/blob/HEAD/MLP/code/train_and_test_MLP.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, caiyun-ai/gar when it was checked","code_sha256":"7e5f981c6c901bda","code_sha256_prefix":"7e5f981c6c901bda","mcp_get_code":{"code_sha256":"7e5f981c6c901bda"}},{"arxiv_id":"2412.07106","arxiv_id_is_arxiv":true,"paper":"/paper/covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfinkelshtein/CoveredForests","path":"utils/trainer.py","file_url":"https://github.com/benfinkelshtein/CoveredForests/blob/HEAD/utils/trainer.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":"184919a11c57d04d","code_sha256_prefix":"184919a11c57d04d","mcp_get_code":{"code_sha256":"184919a11c57d04d"}},{"arxiv_id":"2412.01003","arxiv_id_is_arxiv":true,"paper":"/paper/competition-dynamics-shape-algorithmic-phases","title":"Competition Dynamics Shape Algorithmic Phases of In-Context Learning","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cfpark00/markov-mixtures","path":"mltools/ml_utils.py","file_url":"https://github.com/cfpark00/markov-mixtures/blob/HEAD/mltools/ml_utils.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":"36d847cba1e96c54","code_sha256_prefix":"36d847cba1e96c54","mcp_get_code":{"code_sha256":"36d847cba1e96c54"}},{"arxiv_id":"2411.19666","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-whole-slide-foundation-model-for","title":"Multimodal Whole Slide Foundation Model for Pathology","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahmoodlab/titan","path":"titan/finetune.py","file_url":"https://github.com/mahmoodlab/titan/blob/HEAD/titan/finetune.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, mahmoodlab/titan when it was checked","code_sha256":"35ed8192ced57323","code_sha256_prefix":"35ed8192ced57323","mcp_get_code":{"code_sha256":"35ed8192ced57323"}},{"arxiv_id":"2411.19331","arxiv_id_is_arxiv":true,"paper":"/paper/talking-to-dino-bridging-self-supervised","title":"Talking to DINO: Bridging Self-Supervised Vision Backbones with Language for Open-Vocabulary Segmentation","date":"2024-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/Talk2DINO","path":"src/train_util.py","file_url":"https://github.com/lorebianchi98/Talk2DINO/blob/HEAD/src/train_util.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":"5b444cb020759a17","code_sha256_prefix":"5b444cb020759a17","mcp_get_code":{"code_sha256":"5b444cb020759a17"}},{"arxiv_id":"2411.12558","arxiv_id_is_arxiv":true,"paper":"/paper/recall-and-refine-a-simple-but-effective","title":"Recall and Refine: A Simple but Effective Source-free Open-set Domain Adaptation Framework","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ismailnejjar/RRDA","path":"train_source.py","file_url":"https://github.com/ismailnejjar/RRDA/blob/HEAD/train_source.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a3adf02695ba72c3","code_sha256_prefix":"a3adf02695ba72c3","mcp_get_code":{"code_sha256":"a3adf02695ba72c3"}},{"arxiv_id":"2411.12431","arxiv_id_is_arxiv":true,"paper":"/paper/cv-cities-advancing-cross-view-geo","title":"CV-Cities: Advancing Cross-View Geo-Localization in Global Cities","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaoshuang98/cvcities","path":"cvcities_base/trainer.py","file_url":"https://github.com/gaoshuang98/cvcities/blob/HEAD/cvcities_base/trainer.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":"61b2774538a60499","code_sha256_prefix":"61b2774538a60499","mcp_get_code":{"code_sha256":"61b2774538a60499"}},{"arxiv_id":"2411.04466","arxiv_id_is_arxiv":true,"paper":"/paper/enabling-adaptive-agent-training-in-open","title":"Enabling Adaptive Agent Training in Open-Ended Simulators by Targeting Diversity","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DIVA","path":"paper_experiments/malaria/diva/experiment_diva_top10_resnet_new.py","file_url":"https://github.com/AMLab-Amsterdam/DIVA/blob/HEAD/paper_experiments/malaria/diva/experiment_diva_top10_resnet_new.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":"8c933ed6e26dcecc","code_sha256_prefix":"8c933ed6e26dcecc","mcp_get_code":{"code_sha256":"8c933ed6e26dcecc"}},{"arxiv_id":"2411.04358","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lcs2-iiitd/monteclora","path":"finetune.py","file_url":"https://github.com/lcs2-iiitd/monteclora/blob/HEAD/finetune.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":"7852c586e42377d2","code_sha256_prefix":"7852c586e42377d2","mcp_get_code":{"code_sha256":"7852c586e42377d2"}},{"arxiv_id":"2411.03025","arxiv_id_is_arxiv":true,"paper":"/paper/da-moe-addressing-depth-sensitivity-in-graph","title":"DA-MoE: Addressing Depth-Sensitivity in Graph-Level Analysis through Mixture of Experts","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"celin-yao/da-moe","path":"graph_classification/train/main_graph.py","file_url":"https://github.com/celin-yao/da-moe/blob/HEAD/graph_classification/train/main_graph.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, celin-yao/da-moe when it was checked","code_sha256":"9839952e23a76564","code_sha256_prefix":"9839952e23a76564","mcp_get_code":{"code_sha256":"9839952e23a76564"}},{"arxiv_id":"2411.03025","arxiv_id_is_arxiv":true,"paper":"/paper/da-moe-addressing-depth-sensitivity-in-graph","title":"DA-MoE: Addressing Depth-Sensitivity in Graph-Level Analysis through Mixture of Experts","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"celin-yao/da-moe","path":"node_classification/main_node_arxiv.py","file_url":"https://github.com/celin-yao/da-moe/blob/HEAD/node_classification/main_node_arxiv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, celin-yao/da-moe when it was checked","code_sha256":"3bbf2963d8be10dd","code_sha256_prefix":"3bbf2963d8be10dd","mcp_get_code":{"code_sha256":"3bbf2963d8be10dd"}},{"arxiv_id":"2411.01981","arxiv_id_is_arxiv":true,"paper":"/paper/typicalness-aware-learning-for-failure","title":"Typicalness-Aware Learning for Failure Detection","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyijungoon/tal","path":"trainer/train_TAL.py","file_url":"https://github.com/liuyijungoon/tal/blob/HEAD/trainer/train_TAL.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":"1c7f6c7e81a98693","code_sha256_prefix":"1c7f6c7e81a98693","mcp_get_code":{"code_sha256":"1c7f6c7e81a98693"}},{"arxiv_id":"2411.01833","arxiv_id_is_arxiv":true,"paper":"/paper/owmatch-conditional-self-labeling-with","title":"OwMatch: Conditional Self-Labeling with Consistency for Open-World Semi-Supervised Learning","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niusj03/owmatch","path":"owmatch.py","file_url":"https://github.com/niusj03/owmatch/blob/HEAD/owmatch.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":"17795ae706d474a4","code_sha256_prefix":"17795ae706d474a4","mcp_get_code":{"code_sha256":"17795ae706d474a4"}},{"arxiv_id":"2410.24181","arxiv_id_is_arxiv":true,"paper":"/paper/federated-black-box-adaptation-for-semantic","title":"Federated Black-Box Adaptation for Semantic Segmentation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayparanjape/blackfed","path":"train_rev.py","file_url":"https://github.com/jayparanjape/blackfed/blob/HEAD/train_rev.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, jayparanjape/blackfed when it was checked","code_sha256":"724539b4ca03f0a4","code_sha256_prefix":"724539b4ca03f0a4","mcp_get_code":{"code_sha256":"724539b4ca03f0a4"}},{"arxiv_id":"2410.21042","arxiv_id_is_arxiv":true,"paper":"/paper/improving-visual-prompt-tuning-by-gaussian","title":"Improving Visual Prompt Tuning by Gaussian Neighborhood Minimization for Long-Tailed Visual Recognition","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keke921/gnm-pt","path":"vtab/train_full.py","file_url":"https://github.com/keke921/gnm-pt/blob/HEAD/vtab/train_full.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":"5a7b1c8f58adefd0","code_sha256_prefix":"5a7b1c8f58adefd0","mcp_get_code":{"code_sha256":"5a7b1c8f58adefd0"}},{"arxiv_id":"2410.21042","arxiv_id_is_arxiv":true,"paper":"/paper/improving-visual-prompt-tuning-by-gaussian","title":"Improving Visual Prompt Tuning by Gaussian Neighborhood Minimization for Long-Tailed Visual Recognition","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Keke921/GNM-PT","path":"train_full-lmk-st2.py","file_url":"https://github.com/Keke921/GNM-PT/blob/HEAD/train_full-lmk-st2.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":"8a2d99dd6fd9f0de","code_sha256_prefix":"8a2d99dd6fd9f0de","mcp_get_code":{"code_sha256":"8a2d99dd6fd9f0de"}},{"arxiv_id":"2410.20957","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-symbolic-learning-yielding-logical-1","title":"Neuro-symbolic Learning Yielding Logical Constraints","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lizn-zn/nesy-programming","path":"Chain-XOR/nn_utils.py","file_url":"https://github.com/lizn-zn/nesy-programming/blob/HEAD/Chain-XOR/nn_utils.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, lizn-zn/nesy-programming when it was checked","code_sha256":"f9b62e48fb3851e5","code_sha256_prefix":"f9b62e48fb3851e5","mcp_get_code":{"code_sha256":"f9b62e48fb3851e5"}},{"arxiv_id":"2410.19816","arxiv_id_is_arxiv":true,"paper":"/paper/divshift-exploring-domain-specific","title":"DivShift: Exploring Domain-Specific Distribution Shifts in Large-Scale, Volunteer-Collected Biodiversity Datasets","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moiexpositoalonsolab/DivShift","path":"src/supervised_train.py","file_url":"https://github.com/moiexpositoalonsolab/DivShift/blob/HEAD/src/supervised_train.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":"8cecb34f0bcef7ce","code_sha256_prefix":"8cecb34f0bcef7ce","mcp_get_code":{"code_sha256":"8cecb34f0bcef7ce"}},{"arxiv_id":"2410.17389","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-noisy-feedback-enhancing","title":"Navigating Noisy Feedback: Enhancing Reinforcement Learning with Error-Prone Language Models","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sy-shi/RLAIF_ScoreDiff","path":"train_rm.py","file_url":"https://github.com/sy-shi/RLAIF_ScoreDiff/blob/HEAD/train_rm.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, sy-shi/RLAIF_ScoreDiff when it was checked","code_sha256":"dd0ba84e7526171f","code_sha256_prefix":"dd0ba84e7526171f","mcp_get_code":{"code_sha256":"dd0ba84e7526171f"}},{"arxiv_id":"2410.16954","arxiv_id_is_arxiv":true,"paper":"/paper/lora-c-parameter-efficient-fine-tuning-of","title":"LoRA-C: Parameter-Efficient Fine-Tuning of Robust CNN for IoT Devices","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"alexyyds2024/lora-C","path":"train_lora.py","file_url":"https://github.com/alexyyds2024/lora-C/blob/HEAD/train_lora.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":"22aa24adf1dcd435","code_sha256_prefix":"22aa24adf1dcd435","mcp_get_code":{"code_sha256":"22aa24adf1dcd435"}},{"arxiv_id":"2410.14273","arxiv_id_is_arxiv":true,"paper":"/paper/reef-representation-encoding-fingerprints-for","title":"REEF: Representation Encoding Fingerprints for Large Language Models","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmylla/reef","path":"src/train_cls_gcn.py","file_url":"https://github.com/tmylla/reef/blob/HEAD/src/train_cls_gcn.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, tmylla/reef when it was checked","code_sha256":"66d2718c00dfd494","code_sha256_prefix":"66d2718c00dfd494","mcp_get_code":{"code_sha256":"66d2718c00dfd494"}},{"arxiv_id":"2410.10637","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"demo_ROC_ratio.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/demo_ROC_ratio.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":"31a43b5aa312ddc4","code_sha256_prefix":"31a43b5aa312ddc4","mcp_get_code":{"code_sha256":"31a43b5aa312ddc4"}},{"arxiv_id":"2410.09437","arxiv_id_is_arxiv":true,"paper":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pumpkin-co/mtl-lora","path":"lora_finetune.py","file_url":"https://github.com/pumpkin-co/mtl-lora/blob/HEAD/lora_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":"6cf4a819aa35986b","code_sha256_prefix":"6cf4a819aa35986b","mcp_get_code":{"code_sha256":"6cf4a819aa35986b"}},{"arxiv_id":"2410.09437","arxiv_id_is_arxiv":true,"paper":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pumpkin-co/mtl-lora","path":"lora_finetune_single.py","file_url":"https://github.com/pumpkin-co/mtl-lora/blob/HEAD/lora_finetune_single.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":"823409f0ab13f67c","code_sha256_prefix":"823409f0ab13f67c","mcp_get_code":{"code_sha256":"823409f0ab13f67c"}},{"arxiv_id":"2410.05527","arxiv_id_is_arxiv":true,"paper":"/paper/dopl-direct-online-preference-learning-for","title":"DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flash-36/DOPL","path":"dopl/train/algos/dopl.py","file_url":"https://github.com/flash-36/DOPL/blob/HEAD/dopl/train/algos/dopl.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, flash-36/DOPL when it was checked","code_sha256":"de762eb83b6b40ad","code_sha256_prefix":"de762eb83b6b40ad","mcp_get_code":{"code_sha256":"de762eb83b6b40ad"}},{"arxiv_id":"2410.04010","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"finetune_gemma.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/finetune_gemma.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, marlin-codes/HypLLM when it was checked","code_sha256":"89be12b59a6331d6","code_sha256_prefix":"89be12b59a6331d6","mcp_get_code":{"code_sha256":"89be12b59a6331d6"}},{"arxiv_id":"2410.04010","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"finetune_gemma7b.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/finetune_gemma7b.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, marlin-codes/HypLLM when it was checked","code_sha256":"265773714d80dabf","code_sha256_prefix":"265773714d80dabf","mcp_get_code":{"code_sha256":"265773714d80dabf"}},{"arxiv_id":"2410.04010","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"finetune_llama3.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/finetune_llama3.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, marlin-codes/HypLLM when it was checked","code_sha256":"fbba0cdd6457bbf4","code_sha256_prefix":"fbba0cdd6457bbf4","mcp_get_code":{"code_sha256":"fbba0cdd6457bbf4"}},{"arxiv_id":"2410.04010","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"finetune_qwen.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/finetune_qwen.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, marlin-codes/HypLLM when it was checked","code_sha256":"1200fafec7c5e3d1","code_sha256_prefix":"1200fafec7c5e3d1","mcp_get_code":{"code_sha256":"1200fafec7c5e3d1"}},{"arxiv_id":"2409.17836","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-as-zero-shot-lossless","title":"Language Models as Zero-shot Lossless Gradient Compressors: Towards General Neural Parameter Prior Models","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hui-po-wang/lm-gc","path":"train_and_collect_grad.py","file_url":"https://github.com/hui-po-wang/lm-gc/blob/HEAD/train_and_collect_grad.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":"a14e485102e0eff2","code_sha256_prefix":"a14e485102e0eff2","mcp_get_code":{"code_sha256":"a14e485102e0eff2"}},{"arxiv_id":"2409.17504","arxiv_id_is_arxiv":true,"paper":"/paper/haloscope-harnessing-unlabeled-llm","title":"HaloScope: Harnessing Unlabeled LLM Generations for Hallucination Detection","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/haloscope","path":"linear_probe.py","file_url":"https://github.com/deeplearning-wisc/haloscope/blob/HEAD/linear_probe.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, deeplearning-wisc/haloscope when it was checked","code_sha256":"e01d82ee5f1bfbdd","code_sha256_prefix":"e01d82ee5f1bfbdd","mcp_get_code":{"code_sha256":"e01d82ee5f1bfbdd"}},{"arxiv_id":"2409.12255","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-data-subset-selection-to-generalize-1","title":"Efficient Data Subset Selection to Generalize Training Across Models: Transductive and Inductive Networks","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/subselnet","path":"train_subset/train_full_partial.py","file_url":"https://github.com/structlearning/subselnet/blob/HEAD/train_subset/train_full_partial.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, structlearning/subselnet when it was checked","code_sha256":"f9015e49754188e9","code_sha256_prefix":"f9015e49754188e9","mcp_get_code":{"code_sha256":"f9015e49754188e9"}},{"arxiv_id":"2409.12191","arxiv_id_is_arxiv":true,"paper":"/paper/qwen2-vl-enhancing-vision-language-model-s","title":"Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolution","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/University","path":"PDF_MS/trainner.py","file_url":"https://github.com/yangyucheng000/University/blob/HEAD/PDF_MS/trainner.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":"2fe12723d2eed03d","code_sha256_prefix":"2fe12723d2eed03d","mcp_get_code":{"code_sha256":"2fe12723d2eed03d"}},{"arxiv_id":"2409.06706","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-long-term-effects-on-parameter","title":"SAN: Hypothesizing Long-Term Synaptic Development and Neural Engram Mechanism in Scalable Model's Parameter-Efficient Fine-Tuning","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daviddaiiiii/san-peft","path":"train_code/SAN_base.py","file_url":"https://github.com/daviddaiiiii/san-peft/blob/HEAD/train_code/SAN_base.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, daviddaiiiii/san-peft when it was checked","code_sha256":"7ba3eaccb626f19f","code_sha256_prefix":"7ba3eaccb626f19f","mcp_get_code":{"code_sha256":"7ba3eaccb626f19f"}},{"arxiv_id":"2408.17003","arxiv_id_is_arxiv":true,"paper":"/paper/safety-layers-of-aligned-large-language","title":"Safety Layers in Aligned Large Language Models: The Key to LLM Security","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"listen0425/safety-layers","path":"Code/Fine_tune/SPPFT.py","file_url":"https://github.com/listen0425/safety-layers/blob/HEAD/Code/Fine_tune/SPPFT.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, listen0425/safety-layers when it was checked","code_sha256":"afead4d15856351f","code_sha256_prefix":"afead4d15856351f","mcp_get_code":{"code_sha256":"afead4d15856351f"}},{"arxiv_id":"2408.16939","arxiv_id_is_arxiv":true,"paper":"/paper/theoretical-insights-into-overparameterized","title":"Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learning","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aminbana/MTL-Theory","path":"train_continual.py","file_url":"https://github.com/aminbana/MTL-Theory/blob/HEAD/train_continual.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, aminbana/MTL-Theory when it was checked","code_sha256":"422741d97a377fc1","code_sha256_prefix":"422741d97a377fc1","mcp_get_code":{"code_sha256":"422741d97a377fc1"}},{"arxiv_id":"2408.07919","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-multi-grained-alignment-for","title":"Advancing Multi-grained Alignment for Contrastive Language-Audio Pre-training","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ming-er/mga-clap","path":"pretrain.py","file_url":"https://github.com/ming-er/mga-clap/blob/HEAD/pretrain.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, ming-er/mga-clap when it was checked","code_sha256":"2570f2ac20b362fe","code_sha256_prefix":"2570f2ac20b362fe","mcp_get_code":{"code_sha256":"2570f2ac20b362fe"}},{"arxiv_id":"2408.06292","arxiv_id_is_arxiv":true,"paper":"/paper/the-ai-scientist-towards-fully-automated-open","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sakanaai/ai-scientist","path":"example_papers/layerwise_lr_grokking/experiment.py","file_url":"https://github.com/sakanaai/ai-scientist/blob/HEAD/example_papers/layerwise_lr_grokking/experiment.py","status":"ran","verification_level":1,"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, sakanaai/ai-scientist (NOASSERTION)","code_sha256":"a8a8eb2391a886e7","code_sha256_prefix":"a8a8eb2391a886e7","mcp_get_code":{"code_sha256":"a8a8eb2391a886e7"}},{"arxiv_id":"2408.06292","arxiv_id_is_arxiv":true,"paper":"/paper/the-ai-scientist-towards-fully-automated-open","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Masao-Taketani/AI-Scientist-with-Local-LLMs","path":"templates/nanoGPT/experiment.py","file_url":"https://github.com/Masao-Taketani/AI-Scientist-with-Local-LLMs/blob/HEAD/templates/nanoGPT/experiment.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":"d3a0ec611e5c88d1","code_sha256_prefix":"d3a0ec611e5c88d1","mcp_get_code":{"code_sha256":"d3a0ec611e5c88d1"}},{"arxiv_id":"2407.16674","arxiv_id_is_arxiv":true,"paper":"/paper/kan-or-mlp-a-fairer-comparison","title":"KAN or MLP: A Fairer Comparison","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/kanbefair","path":"src/train_continual_learning.py","file_url":"https://github.com/yu-rp/kanbefair/blob/HEAD/src/train_continual_learning.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, yu-rp/kanbefair when it was checked","code_sha256":"610ffde183692a23","code_sha256_prefix":"610ffde183692a23","mcp_get_code":{"code_sha256":"610ffde183692a23"}},{"arxiv_id":"2407.14459","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification_large_graph/training_batch.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification_large_graph/training_batch.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, air029/polyformer when it was checked","code_sha256":"b756e3430fe59b3a","code_sha256_prefix":"b756e3430fe59b3a","mcp_get_code":{"code_sha256":"b756e3430fe59b3a"}},{"arxiv_id":"2407.11756","arxiv_id_is_arxiv":true,"paper":"/paper/a-theoretical-formulation-of-many-body","title":"A Theoretical Formulation of Many-body Message Passing Neural Networks","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jthh/many-body-mpnn","path":"utils.py","file_url":"https://github.com/jthh/many-body-mpnn/blob/HEAD/utils.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, jthh/many-body-mpnn when it was checked","code_sha256":"4dd698b1c78ec59a","code_sha256_prefix":"4dd698b1c78ec59a","mcp_get_code":{"code_sha256":"4dd698b1c78ec59a"}},{"arxiv_id":"2407.11542","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-counting-in-small-transformers","title":"Counting in Small Transformers: The Delicate Interplay between Attention and Feed-Forward Layers","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SPOC-group/counting-attention","path":"random_embd/memory_exp.py","file_url":"https://github.com/SPOC-group/counting-attention/blob/HEAD/random_embd/memory_exp.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, SPOC-group/counting-attention when it was checked","code_sha256":"a543f8665b98f5d4","code_sha256_prefix":"a543f8665b98f5d4","mcp_get_code":{"code_sha256":"a543f8665b98f5d4"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_unsupervised/gnn.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_unsupervised/gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82f54a95d4951b19","code_sha256_prefix":"82f54a95d4951b19","mcp_get_code":{"code_sha256":"82f54a95d4951b19"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_semisupervised/gnn.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_semisupervised/gnn.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":"758d5dd9e231d846","code_sha256_prefix":"758d5dd9e231d846","mcp_get_code":{"code_sha256":"758d5dd9e231d846"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_unsupervised/gnn_da.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_unsupervised/gnn_da.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":"20a9feb6dd535706","code_sha256_prefix":"20a9feb6dd535706","mcp_get_code":{"code_sha256":"20a9feb6dd535706"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GDA-SpecReg","path":"paper_topic_classification/ogbn_arxiv_semisupervised/gnn_da.py","file_url":"https://github.com/Shen-Lab/GDA-SpecReg/blob/HEAD/paper_topic_classification/ogbn_arxiv_semisupervised/gnn_da.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":"0b6755f3ee7c7fde","code_sha256_prefix":"0b6755f3ee7c7fde","mcp_get_code":{"code_sha256":"0b6755f3ee7c7fde"}},{"arxiv_id":"2407.10670","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-retrieval-and-managing-retrieval-a","title":"Enhancing Retrieval and Managing Retrieval: A Four-Module Synergy for Improved Quality and Efficiency in RAG Systems","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ancientshi/erm4","path":"finetune_gemma_rewriter.py","file_url":"https://github.com/ancientshi/erm4/blob/HEAD/finetune_gemma_rewriter.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, ancientshi/erm4 (NOASSERTION)","code_sha256":"7268f2124fba73a9","code_sha256_prefix":"7268f2124fba73a9","mcp_get_code":{"code_sha256":"7268f2124fba73a9"}},{"arxiv_id":"2407.07841","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-embedding-aggregation-methods-in","title":"Benchmarking Embedding Aggregation Methods in Computational Pathology: A Clinical Data Perspective","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuchs-lab-public/cpath_sabenchmark","path":"code/train_classification_model_report.py","file_url":"https://github.com/fuchs-lab-public/cpath_sabenchmark/blob/HEAD/code/train_classification_model_report.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":"fb7240786a8186f7","code_sha256_prefix":"fb7240786a8186f7","mcp_get_code":{"code_sha256":"fb7240786a8186f7"}},{"arxiv_id":"2407.07841","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-embedding-aggregation-methods-in","title":"Benchmarking Embedding Aggregation Methods in Computational Pathology: A Clinical Data Perspective","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuchs-lab-public/cpath_sabenchmark","path":"code/train_classification_mccv.py","file_url":"https://github.com/fuchs-lab-public/cpath_sabenchmark/blob/HEAD/code/train_classification_mccv.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":"74e7e7b0af0e3d0b","code_sha256_prefix":"74e7e7b0af0e3d0b","mcp_get_code":{"code_sha256":"74e7e7b0af0e3d0b"}},{"arxiv_id":"2407.07457","arxiv_id_is_arxiv":true,"paper":"/paper/glbench-a-comprehensive-benchmark-for-graph","title":"GLBench: A Comprehensive Benchmark for Graph with Large Language Models","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nineabyss/glbench","path":"models/gnn/mlp.py","file_url":"https://github.com/nineabyss/glbench/blob/HEAD/models/gnn/mlp.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":"fffc14ec419e60ce","code_sha256_prefix":"fffc14ec419e60ce","mcp_get_code":{"code_sha256":"fffc14ec419e60ce"}},{"arxiv_id":"2407.04345","arxiv_id_is_arxiv":true,"paper":"/paper/canonicalfusion-generating-drivable-3d-human","title":"CanonicalFusion: Generating Drivable 3D Human Avatars from Multiple Images","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jsshin98/CanonicalFusion","path":"reconstructor/train_color2model.py","file_url":"https://github.com/jsshin98/CanonicalFusion/blob/HEAD/reconstructor/train_color2model.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":"bc70e3c7eb7c1354","code_sha256_prefix":"bc70e3c7eb7c1354","mcp_get_code":{"code_sha256":"bc70e3c7eb7c1354"}},{"arxiv_id":"2406.18380","arxiv_id_is_arxiv":true,"paper":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RomanBresson/KAGNN","path":"graph_classification/graph_classification_utils.py","file_url":"https://github.com/RomanBresson/KAGNN/blob/HEAD/graph_classification/graph_classification_utils.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, RomanBresson/KAGNN when it was checked","code_sha256":"5ca873d38e249a8f","code_sha256_prefix":"5ca873d38e249a8f","mcp_get_code":{"code_sha256":"5ca873d38e249a8f"}},{"arxiv_id":"2406.14673","arxiv_id_is_arxiv":true,"paper":"/paper/insights-into-llm-long-context-failures-when","title":"Insights into LLM Long-Context Failures: When Transformers Know but Don't Tell","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TaiMingLu/know-dont-tell","path":"code/probe/probe.py","file_url":"https://github.com/TaiMingLu/know-dont-tell/blob/HEAD/code/probe/probe.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, TaiMingLu/know-dont-tell when it was checked","code_sha256":"9589a134d9eac768","code_sha256_prefix":"9589a134d9eac768","mcp_get_code":{"code_sha256":"9589a134d9eac768"}},{"arxiv_id":"2406.13828","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-symbolic-training-for-reasoning-over","title":"Neuro-symbolic Training for Reasoning over Spatial Language","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"premsrit/SPARTUNQChain","path":"main_rel.py","file_url":"https://github.com/premsrit/SPARTUNQChain/blob/HEAD/main_rel.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, premsrit/SPARTUNQChain when it was checked","code_sha256":"9519ecd7a0509878","code_sha256_prefix":"9519ecd7a0509878","mcp_get_code":{"code_sha256":"9519ecd7a0509878"}},{"arxiv_id":"2406.13392","arxiv_id_is_arxiv":true,"paper":"/paper/strengthening-layer-interaction-via-dynamic","title":"Strengthening Layer Interaction via Dynamic Layer Attention","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tunantu/dynamic-layer-attention","path":"image_classification/imagenet/train_pro.py","file_url":"https://github.com/tunantu/dynamic-layer-attention/blob/HEAD/image_classification/imagenet/train_pro.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, tunantu/dynamic-layer-attention when it was checked","code_sha256":"d6a70da7dc77eebd","code_sha256_prefix":"d6a70da7dc77eebd","mcp_get_code":{"code_sha256":"d6a70da7dc77eebd"}},{"arxiv_id":"2406.13155","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-kolmogorov-arnold-networks","title":"Convolutional Kolmogorov-Arnold Networks","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoniotepsich/convolutional-kans","path":"evaluations.py","file_url":"https://github.com/antoniotepsich/convolutional-kans/blob/HEAD/evaluations.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":"6bfd9d473bd3943b","code_sha256_prefix":"6bfd9d473bd3943b","mcp_get_code":{"code_sha256":"6bfd9d473bd3943b"}},{"arxiv_id":"2406.12639","arxiv_id_is_arxiv":true,"paper":"/paper/ask-before-plan-proactive-language-agents-for","title":"Ask-before-Plan: Proactive Language Agents for Real-World Planning","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magicgh/ask-before-plan","path":"src/finetune.py","file_url":"https://github.com/magicgh/ask-before-plan/blob/HEAD/src/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":"4b9384d019401c5a","code_sha256_prefix":"4b9384d019401c5a","mcp_get_code":{"code_sha256":"4b9384d019401c5a"}},{"arxiv_id":"2406.10815","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-effectiveness-of-supervision-in","title":"On the Effectiveness of Supervision in Asymmetric Non-Contrastive Learning","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jh-oh-23/sup-ancl","path":"linear.py","file_url":"https://github.com/jh-oh-23/sup-ancl/blob/HEAD/linear.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"301ca971eacdfdcb","code_sha256_prefix":"301ca971eacdfdcb","mcp_get_code":{"code_sha256":"301ca971eacdfdcb"}},{"arxiv_id":"2406.10727","arxiv_id_is_arxiv":true,"paper":"/paper/text-space-graph-foundation-models","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currytang/tsgfm","path":"fulllink.py","file_url":"https://github.com/currytang/tsgfm/blob/HEAD/fulllink.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":"41057c04e7b22f04","code_sha256_prefix":"41057c04e7b22f04","mcp_get_code":{"code_sha256":"41057c04e7b22f04"}},{"arxiv_id":"2406.10310","arxiv_id_is_arxiv":true,"paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_HitsK.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_HitsK.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":"b9125d103f13768d","code_sha256_prefix":"b9125d103f13768d","mcp_get_code":{"code_sha256":"b9125d103f13768d"}},{"arxiv_id":"2406.10310","arxiv_id_is_arxiv":true,"paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_HitsK_loader.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_HitsK_loader.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":"93ed7f8d21768471","code_sha256_prefix":"93ed7f8d21768471","mcp_get_code":{"code_sha256":"93ed7f8d21768471"}},{"arxiv_id":"2406.10310","arxiv_id_is_arxiv":true,"paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_MRR.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_MRR.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":"ad21068f2893ab5c","code_sha256_prefix":"ad21068f2893ab5c","mcp_get_code":{"code_sha256":"ad21068f2893ab5c"}},{"arxiv_id":"2406.10310","arxiv_id_is_arxiv":true,"paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Link_MRR_loader.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Link_MRR_loader.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":"70a4a68841982fea","code_sha256_prefix":"70a4a68841982fea","mcp_get_code":{"code_sha256":"70a4a68841982fea"}},{"arxiv_id":"2406.10310","arxiv_id_is_arxiv":true,"paper":"/paper/teg-db-a-comprehensive-dataset-and-benchmark","title":"TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhuofeng-Li/TEG-Benchmark","path":"GNN/GNN_Node.py","file_url":"https://github.com/Zhuofeng-Li/TEG-Benchmark/blob/HEAD/GNN/GNN_Node.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":"4f3238930893cc90","code_sha256_prefix":"4f3238930893cc90","mcp_get_code":{"code_sha256":"4f3238930893cc90"}},{"arxiv_id":"2406.09586","arxiv_id_is_arxiv":true,"paper":"/paper/protein-nucleic-acid-complex-modeling-with","title":"Protein-Nucleic Acid Complex Modeling with Frame Averaging Transformer","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-and-geometric-learning/frame-averaging-transformer","path":"faformer/app/aptamer_aff_train.py","file_url":"https://github.com/graph-and-geometric-learning/frame-averaging-transformer/blob/HEAD/faformer/app/aptamer_aff_train.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, graph-and-geometric-learning/frame-averaging-transformer when it was checked","code_sha256":"145d6b278ec8e06c","code_sha256_prefix":"145d6b278ec8e06c","mcp_get_code":{"code_sha256":"145d6b278ec8e06c"}},{"arxiv_id":"2406.06158","arxiv_id_is_arxiv":true,"paper":"/paper/get-rich-quick-exact-solutions-reveal-how","title":"Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learning","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allanraventos/getrichquick","path":"two-layer-relu/utils.py","file_url":"https://github.com/allanraventos/getrichquick/blob/HEAD/two-layer-relu/utils.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":"184ff0807fd1777f","code_sha256_prefix":"184ff0807fd1777f","mcp_get_code":{"code_sha256":"184ff0807fd1777f"}},{"arxiv_id":"2406.04984","arxiv_id_is_arxiv":true,"paper":"/paper/meft-memory-efficient-fine-tuning-through","title":"MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currentf/meft","path":"full_finetune.py","file_url":"https://github.com/currentf/meft/blob/HEAD/full_finetune.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, currentf/meft when it was checked","code_sha256":"5b7dee34064b4f2d","code_sha256_prefix":"5b7dee34064b4f2d","mcp_get_code":{"code_sha256":"5b7dee34064b4f2d"}},{"arxiv_id":"2406.03344","arxiv_id_is_arxiv":true,"paper":"/paper/audio-mamba-bidirectional-state-space-model","title":"Audio Mamba: Bidirectional State Space Model for Audio Representation Learning","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mhamzaerol/audio-mamba-aum","path":"src/traintest.py","file_url":"https://github.com/mhamzaerol/audio-mamba-aum/blob/HEAD/src/traintest.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":"ff5d747f7c356f30","code_sha256_prefix":"ff5d747f7c356f30","mcp_get_code":{"code_sha256":"ff5d747f7c356f30"}},{"arxiv_id":"2406.02529","arxiv_id_is_arxiv":true,"paper":"/paper/relus-are-sufficient-for-learning-implicit","title":"ReLUs Are Sufficient for Learning Implicit Neural Representations","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeshenouda/relu-inrs","path":"exp_univariate_path_norms.py","file_url":"https://github.com/joeshenouda/relu-inrs/blob/HEAD/exp_univariate_path_norms.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, joeshenouda/relu-inrs when it was checked","code_sha256":"99ff1691eba94bb2","code_sha256_prefix":"99ff1691eba94bb2","mcp_get_code":{"code_sha256":"99ff1691eba94bb2"}},{"arxiv_id":"2406.01899","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-graph-data-scaling-a-showcase","title":"Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenzhuotang/uniaug","path":"graph_pred.py","file_url":"https://github.com/wenzhuotang/uniaug/blob/HEAD/graph_pred.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":"cf44ccd02553d4ce","code_sha256_prefix":"cf44ccd02553d4ce","mcp_get_code":{"code_sha256":"cf44ccd02553d4ce"}},{"arxiv_id":"2406.00816","arxiv_id_is_arxiv":true,"paper":"/paper/invisible-backdoor-attacks-on-diffusion","title":"Invisible Backdoor Attacks on Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linweiii/backdoordm","path":"classifier_models/train_classifiers.py","file_url":"https://github.com/linweiii/backdoordm/blob/HEAD/classifier_models/train_classifiers.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":"92cb5c70af1c2002","code_sha256_prefix":"92cb5c70af1c2002","mcp_get_code":{"code_sha256":"92cb5c70af1c2002"}},{"arxiv_id":"2406.00816","arxiv_id_is_arxiv":true,"paper":"/paper/invisible-backdoor-attacks-on-diffusion","title":"Invisible Backdoor Attacks on Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linweiii/backdoordm","path":"classifier_models/resnet.py","file_url":"https://github.com/linweiii/backdoordm/blob/HEAD/classifier_models/resnet.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":"c24870633e16b862","code_sha256_prefix":"c24870633e16b862","mcp_get_code":{"code_sha256":"c24870633e16b862"}},{"arxiv_id":"2405.20666","arxiv_id_is_arxiv":true,"paper":"/paper/masa-motion-aware-masked-autoencoder-with","title":"MASA: Motion-aware Masked Autoencoder with Semantic Alignment for Sign Language Recognition","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sakura2233565548/masa","path":"pretrain.py","file_url":"https://github.com/sakura2233565548/masa/blob/HEAD/pretrain.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, sakura2233565548/masa when it was checked","code_sha256":"e80cb369929174bb","code_sha256_prefix":"e80cb369929174bb","mcp_get_code":{"code_sha256":"e80cb369929174bb"}},{"arxiv_id":"2405.19230","arxiv_id_is_arxiv":true,"paper":"/paper/valid-conformal-prediction-for-dynamic-gnns","title":"Valid Conformal Prediction for Dynamic GNNs","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edwarddavis1/valid_conformal_for_dynamic_gnn","path":"Conformal_GNN_Flight_Experiments.py","file_url":"https://github.com/edwarddavis1/valid_conformal_for_dynamic_gnn/blob/HEAD/Conformal_GNN_Flight_Experiments.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, edwarddavis1/valid_conformal_for_dynamic_gnn when it was checked","code_sha256":"d7aa3608877162ac","code_sha256_prefix":"d7aa3608877162ac","mcp_get_code":{"code_sha256":"d7aa3608877162ac"}},{"arxiv_id":"2405.19230","arxiv_id_is_arxiv":true,"paper":"/paper/valid-conformal-prediction-for-dynamic-gnns","title":"Valid Conformal Prediction for Dynamic GNNs","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edwarddavis1/valid_conformal_for_dynamic_gnn","path":"Conformal_GNN_Global_Experiments.py","file_url":"https://github.com/edwarddavis1/valid_conformal_for_dynamic_gnn/blob/HEAD/Conformal_GNN_Global_Experiments.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, edwarddavis1/valid_conformal_for_dynamic_gnn when it was checked","code_sha256":"08ae9e2d51fdc4c0","code_sha256_prefix":"08ae9e2d51fdc4c0","mcp_get_code":{"code_sha256":"08ae9e2d51fdc4c0"}},{"arxiv_id":"2405.18979","arxiv_id_is_arxiv":true,"paper":"/paper/mano-exploiting-matrix-norm-for-unsupervised","title":"MANO: Exploiting Matrix Norm for Unsupervised Accuracy Estimation Under Distribution Shifts","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renchunzi-xie/mano","path":"init_base_model.py","file_url":"https://github.com/renchunzi-xie/mano/blob/HEAD/init_base_model.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":"5b04001dec8a2695","code_sha256_prefix":"5b04001dec8a2695","mcp_get_code":{"code_sha256":"5b04001dec8a2695"}},{"arxiv_id":"2405.18635","arxiv_id_is_arxiv":true,"paper":"/paper/when-and-how-does-in-distribution-label-help","title":"When and How Does In-Distribution Label Help Out-of-Distribution Detection?","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/id_label","path":"linear_probe.py","file_url":"https://github.com/deeplearning-wisc/id_label/blob/HEAD/linear_probe.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, deeplearning-wisc/id_label when it was checked","code_sha256":"1ae39c289c58b21c","code_sha256_prefix":"1ae39c289c58b21c","mcp_get_code":{"code_sha256":"1ae39c289c58b21c"}},{"arxiv_id":"2405.18217","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-inter-concept-relationships-in","title":"Understanding Inter-Concept Relationships in Concept-Based Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naveenr414/Concept-Learning","path":"cem/experiments/cbm_models.py","file_url":"https://github.com/naveenr414/Concept-Learning/blob/HEAD/cem/experiments/cbm_models.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, naveenr414/Concept-Learning when it was checked","code_sha256":"6810adb2ac653d75","code_sha256_prefix":"6810adb2ac653d75","mcp_get_code":{"code_sha256":"6810adb2ac653d75"}},{"arxiv_id":"2405.17163","arxiv_id_is_arxiv":true,"paper":"/paper/injecting-hamiltonian-architectural-bias-into","title":"Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networks","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simonheilig/porthamiltonian-dgn","path":"graph_prop_pred/train_GraphProp.py","file_url":"https://github.com/simonheilig/porthamiltonian-dgn/blob/HEAD/graph_prop_pred/train_GraphProp.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":"ccdff96dde8c6510","code_sha256_prefix":"ccdff96dde8c6510","mcp_get_code":{"code_sha256":"ccdff96dde8c6510"}},{"arxiv_id":"2405.16405","arxiv_id_is_arxiv":true,"paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"gnn_misg.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/gnn_misg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Leirunlin/Text-level-Graph-Attack when it was checked","code_sha256":"15cbb9f3adf7eca7","code_sha256_prefix":"15cbb9f3adf7eca7","mcp_get_code":{"code_sha256":"15cbb9f3adf7eca7"}},{"arxiv_id":"2405.14303","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-navigated-conformal-prediction-for","title":"Similarity-Navigated Conformal Prediction for Graph Neural Networks","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"janqsong/SNAPS","path":"ogbn_products.py","file_url":"https://github.com/janqsong/SNAPS/blob/HEAD/ogbn_products.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, janqsong/SNAPS when it was checked","code_sha256":"82f54a95d4951b19","code_sha256_prefix":"82f54a95d4951b19","mcp_get_code":{"code_sha256":"82f54a95d4951b19"}},{"arxiv_id":"2405.14303","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-navigated-conformal-prediction-for","title":"Similarity-Navigated Conformal Prediction for Graph Neural Networks","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"janqsong/SNAPS","path":"ogbn-arxiv.py","file_url":"https://github.com/janqsong/SNAPS/blob/HEAD/ogbn-arxiv.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, janqsong/SNAPS when it was checked","code_sha256":"6eec0f8d58591cd8","code_sha256_prefix":"6eec0f8d58591cd8","mcp_get_code":{"code_sha256":"6eec0f8d58591cd8"}},{"arxiv_id":"2405.06116","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-efficient-and-effective-point","title":"Rethinking Efficient and Effective Point-based Networks for Event Camera Classification and Regression: EventMamba","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhwxmx/eventmamba","path":"train_odometry.py","file_url":"https://github.com/rhwxmx/eventmamba/blob/HEAD/train_odometry.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8258eb088be7a4b9","code_sha256_prefix":"8258eb088be7a4b9","mcp_get_code":{"code_sha256":"8258eb088be7a4b9"}},{"arxiv_id":"2405.06116","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-efficient-and-effective-point","title":"Rethinking Efficient and Effective Point-based Networks for Event Camera Classification and Regression: EventMamba","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhwxmx/eventmamba","path":"train_classification.py","file_url":"https://github.com/rhwxmx/eventmamba/blob/HEAD/train_classification.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":"ab7bba51098087da","code_sha256_prefix":"ab7bba51098087da","mcp_get_code":{"code_sha256":"ab7bba51098087da"}},{"arxiv_id":"2405.06116","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-efficient-and-effective-point","title":"Rethinking Efficient and Effective Point-based Networks for Event Camera Classification and Regression: EventMamba","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhwxmx/eventmamba","path":"train_eye_tracking.py","file_url":"https://github.com/rhwxmx/eventmamba/blob/HEAD/train_eye_tracking.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":"fbacca83bf132d97","code_sha256_prefix":"fbacca83bf132d97","mcp_get_code":{"code_sha256":"fbacca83bf132d97"}},{"arxiv_id":"2405.04342","arxiv_id_is_arxiv":true,"paper":"/paper/the-curse-of-diversity-in-ensemble-based","title":"The Curse of Diversity in Ensemble-Based Exploration","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/ensemble-rl-discrete","path":"ensemble_rl/agents/boot_quantile_agent.py","file_url":"https://github.com/zhixuan-lin/ensemble-rl-discrete/blob/HEAD/ensemble_rl/agents/boot_quantile_agent.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":"fed787981f691a19","code_sha256_prefix":"fed787981f691a19","mcp_get_code":{"code_sha256":"fed787981f691a19"}},{"arxiv_id":"2404.19124","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-production-llms-with-combined","title":"Accelerating Production LLMs with Combined Token/Embedding Speculators","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foundation-model-stack/fms-fsdp","path":"fms_fsdp/utils/train_utils.py","file_url":"https://github.com/foundation-model-stack/fms-fsdp/blob/HEAD/fms_fsdp/utils/train_utils.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":"aa7f3b5c0155bc7c","code_sha256_prefix":"aa7f3b5c0155bc7c","mcp_get_code":{"code_sha256":"aa7f3b5c0155bc7c"}},{"arxiv_id":"2404.16551","arxiv_id_is_arxiv":true,"paper":"/paper/surprisingly-strong-performance-prediction","title":"Surprisingly Strong Performance Prediction with Neural Graph Features","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabikadlecova/zc_combine","path":"zc_combine/predictors/gnn.py","file_url":"https://github.com/gabikadlecova/zc_combine/blob/HEAD/zc_combine/predictors/gnn.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":"21314b00e73896ce","code_sha256_prefix":"21314b00e73896ce","mcp_get_code":{"code_sha256":"21314b00e73896ce"}},{"arxiv_id":"2404.11003","arxiv_id_is_arxiv":true,"paper":"/paper/infomatch-entropy-neural-estimation-for-semi","title":"InfoMatch: Entropy Neural Estimation for Semi-Supervised Image Classification","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kunzhan/InfoMatch","path":"infoMatch_STL.py","file_url":"https://github.com/kunzhan/InfoMatch/blob/HEAD/infoMatch_STL.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, kunzhan/InfoMatch when it was checked","code_sha256":"6b7b164a79c03fc5","code_sha256_prefix":"6b7b164a79c03fc5","mcp_get_code":{"code_sha256":"6b7b164a79c03fc5"}},{"arxiv_id":"2404.07713","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-semantic-guided-vision","title":"Progressive Semantic-Guided Vision Transformer for Zero-Shot Learning","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shiming-chen/zslvit","path":"train_function.py","file_url":"https://github.com/shiming-chen/zslvit/blob/HEAD/train_function.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, shiming-chen/zslvit when it was checked","code_sha256":"39d973f1e925c9a4","code_sha256_prefix":"39d973f1e925c9a4","mcp_get_code":{"code_sha256":"39d973f1e925c9a4"}},{"arxiv_id":"2404.04682","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-conservatism-a-transductive","title":"Compositional Conservatism: A Transductive Approach in Offline Reinforcement Learning","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runamu/compositional-conservatism","path":"run_example/run_anchor_seeker.py","file_url":"https://github.com/runamu/compositional-conservatism/blob/HEAD/run_example/run_anchor_seeker.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":"2d4b279bdac1d9df","code_sha256_prefix":"2d4b279bdac1d9df","mcp_get_code":{"code_sha256":"2d4b279bdac1d9df"}},{"arxiv_id":"2404.03988","arxiv_id_is_arxiv":true,"paper":"/paper/model-selection-with-model-zoo-via-graph","title":"Model Selection with Model Zoo via Graph Learning","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"transfergraph/transfergraph","path":"src/transfergraph/transferability_estimation/graph/train_with_GNN.py","file_url":"https://github.com/transfergraph/transfergraph/blob/HEAD/src/transfergraph/transferability_estimation/graph/train_with_GNN.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, transfergraph/transfergraph when it was checked","code_sha256":"e3a565532c4ff777","code_sha256_prefix":"e3a565532c4ff777","mcp_get_code":{"code_sha256":"e3a565532c4ff777"}},{"arxiv_id":"2404.03539","arxiv_id_is_arxiv":true,"paper":"/paper/is-clip-the-main-roadblock-for-fine-grained","title":"Is CLIP the main roadblock for fine-grained open-world perception?","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/fg-clip","path":"src/train_util.py","file_url":"https://github.com/lorebianchi98/fg-clip/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, lorebianchi98/fg-clip when it was checked","code_sha256":"cbeb45030a21b392","code_sha256_prefix":"cbeb45030a21b392","mcp_get_code":{"code_sha256":"cbeb45030a21b392"}},{"arxiv_id":"2403.19762","arxiv_id_is_arxiv":true,"paper":"/paper/idp-bert-predicting-properties-of","title":"IDP-Bert: Predicting Properties of Intrinsically Disordered Proteins (IDP) Using Large Language Models","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chakradharg/idp-bert","path":"model/utils.py","file_url":"https://github.com/chakradharg/idp-bert/blob/HEAD/model/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":"eba5a83f13fb636a","code_sha256_prefix":"eba5a83f13fb636a","mcp_get_code":{"code_sha256":"eba5a83f13fb636a"}},{"arxiv_id":"2403.17647","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-subgraph-generation-for","title":"Intrinsic Subgraph Generation for Interpretable Graph based Visual Question Answering","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"digitalphonetics/intrinsic-subgraph-generation-for-vqa","path":"ISubGVQA/training/train_loop.py","file_url":"https://github.com/digitalphonetics/intrinsic-subgraph-generation-for-vqa/blob/HEAD/ISubGVQA/training/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":"a41b39537aaa75e8","code_sha256_prefix":"a41b39537aaa75e8","mcp_get_code":{"code_sha256":"a41b39537aaa75e8"}},{"arxiv_id":"2403.16182","arxiv_id_is_arxiv":true,"paper":"/paper/egoexolearn-a-dataset-for-bridging","title":"EgoExoLearn: A Dataset for Bridging Asynchronous Ego- and Exo-centric View of Procedural Activities in Real World","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenGVLab/EgoExoLearn","path":"action_anticipation_planning_benchmark/anticipation_main.py","file_url":"https://github.com/OpenGVLab/EgoExoLearn/blob/HEAD/action_anticipation_planning_benchmark/anticipation_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":"215d8bffab54d8ff","code_sha256_prefix":"215d8bffab54d8ff","mcp_get_code":{"code_sha256":"215d8bffab54d8ff"}},{"arxiv_id":"2403.14198","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-unlabeled-data-a-paradigm-for","title":"Unleashing Unlabeled Data: A Paradigm for Cross-View Geo-Localization","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liguopeng0923/UCVGL","path":"train_crossview_sat.py","file_url":"https://github.com/liguopeng0923/UCVGL/blob/HEAD/train_crossview_sat.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, liguopeng0923/UCVGL when it was checked","code_sha256":"c0c65397d45181aa","code_sha256_prefix":"c0c65397d45181aa","mcp_get_code":{"code_sha256":"c0c65397d45181aa"}},{"arxiv_id":"2403.12984","arxiv_id_is_arxiv":true,"paper":"/paper/when-smiles-have-language-drug-classification","title":"When SMILES have Language: Drug Classification using Text Classification Methods on Drug SMILES Strings","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azminewasi/Drug-Classification-NLP","path":"Model/train-ngram.py","file_url":"https://github.com/azminewasi/Drug-Classification-NLP/blob/HEAD/Model/train-ngram.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":"ed294c3995b58c42","code_sha256_prefix":"ed294c3995b58c42","mcp_get_code":{"code_sha256":"ed294c3995b58c42"}},{"arxiv_id":"2403.09809","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-time-series-1","title":"Self-Supervised Learning for Time Series: Contrastive or Generative?","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dl4mhealth/ssl_comparison","path":"Contrastive/SimCLR/SimCLR_pretrain.py","file_url":"https://github.com/dl4mhealth/ssl_comparison/blob/HEAD/Contrastive/SimCLR/SimCLR_pretrain.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":"1aca3035cb52ef72","code_sha256_prefix":"1aca3035cb52ef72","mcp_get_code":{"code_sha256":"1aca3035cb52ef72"}},{"arxiv_id":"2403.07636","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-disease-descriptions-for-enhanced","title":"Decomposing Disease Descriptions for Enhanced Pathology Detection: A Multi-Aspect Vision-Language Pre-training Framework","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hieuphan33/mavl","path":"Pretrain/train_MAVL.py","file_url":"https://github.com/hieuphan33/mavl/blob/HEAD/Pretrain/train_MAVL.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, hieuphan33/mavl when it was checked","code_sha256":"0f711eef730b6b3d","code_sha256_prefix":"0f711eef730b6b3d","mcp_get_code":{"code_sha256":"0f711eef730b6b3d"}},{"arxiv_id":"2403.04082","arxiv_id_is_arxiv":true,"paper":"/paper/inference-via-interpolation-contrastive","title":"Inference via Interpolation: Contrastive Representations Provably Enable Planning and Inference","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vivekmyers/contrastive_planning","path":"utils/training.py","file_url":"https://github.com/vivekmyers/contrastive_planning/blob/HEAD/utils/training.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, vivekmyers/contrastive_planning when it was checked","code_sha256":"9fa7d7576408f3bd","code_sha256_prefix":"9fa7d7576408f3bd","mcp_get_code":{"code_sha256":"9fa7d7576408f3bd"}},{"arxiv_id":"2403.03421","arxiv_id_is_arxiv":true,"paper":"/paper/lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/glc","path":"train_source.py","file_url":"https://github.com/ispc-lab/glc/blob/HEAD/train_source.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, ispc-lab/glc when it was checked","code_sha256":"e4b2648a312cebb6","code_sha256_prefix":"e4b2648a312cebb6","mcp_get_code":{"code_sha256":"e4b2648a312cebb6"}},{"arxiv_id":"2403.01942","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-label-noise-on-graph-via","title":"Mitigating Label Noise on Graph via Topological Sample Selection","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2024_ICML_TSS","path":"train_eval.py","file_url":"https://github.com/tmllab/2024_ICML_TSS/blob/HEAD/train_eval.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, tmllab/2024_ICML_TSS when it was checked","code_sha256":"106b95ab43885bd3","code_sha256_prefix":"106b95ab43885bd3","mcp_get_code":{"code_sha256":"106b95ab43885bd3"}},{"arxiv_id":"2403.01400","arxiv_id_is_arxiv":true,"paper":"/paper/decoupling-weighing-and-selecting-for","title":"Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianyuFan0504/WAS","path":"graph-level/prepare/src/molecule_finetune.py","file_url":"https://github.com/TianyuFan0504/WAS/blob/HEAD/graph-level/prepare/src/molecule_finetune.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, TianyuFan0504/WAS when it was checked","code_sha256":"bc93d3d773304c56","code_sha256_prefix":"bc93d3d773304c56","mcp_get_code":{"code_sha256":"bc93d3d773304c56"}},{"arxiv_id":"2403.01165","arxiv_id_is_arxiv":true,"paper":"/paper/star-constraint-lora-with-dynamic-active","title":"STAR: Constraint LoRA with Dynamic Active Learning for Data-Efficient Fine-Tuning of Large Language Models","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"callanwu/star","path":"src/finetuning.py","file_url":"https://github.com/callanwu/star/blob/HEAD/src/finetuning.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, callanwu/star when it was checked","code_sha256":"81d3d03f399b9a53","code_sha256_prefix":"81d3d03f399b9a53","mcp_get_code":{"code_sha256":"81d3d03f399b9a53"}},{"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":"network_train.py","file_url":"https://github.com/zoilsen/flor/blob/HEAD/network_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, zoilsen/flor when it was checked","code_sha256":"acf1008d411fbae3","code_sha256_prefix":"acf1008d411fbae3","mcp_get_code":{"code_sha256":"acf1008d411fbae3"}},{"arxiv_id":"2402.16061","arxiv_id_is_arxiv":true,"paper":"/paper/how-large-language-models-encode-context","title":"How Large Language Models Encode Context Knowledge? A Layer-Wise Probing Study","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jometeorie/probing_llama","path":"code/probing_model.py","file_url":"https://github.com/jometeorie/probing_llama/blob/HEAD/code/probing_model.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, jometeorie/probing_llama when it was checked","code_sha256":"86fe730f11e67507","code_sha256_prefix":"86fe730f11e67507","mcp_get_code":{"code_sha256":"86fe730f11e67507"}},{"arxiv_id":"2402.11760","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-as-a-parsimonious","title":"Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scailab/paser","path":"src/pretrain_rl.py","file_url":"https://github.com/scailab/paser/blob/HEAD/src/pretrain_rl.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, scailab/paser when it was checked","code_sha256":"7847c6ca798a2149","code_sha256_prefix":"7847c6ca798a2149","mcp_get_code":{"code_sha256":"7847c6ca798a2149"}},{"arxiv_id":"2402.11518","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-driven-meta-structure","title":"Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linchen-65/restruct","path":"llm_explanation.py","file_url":"https://github.com/linchen-65/restruct/blob/HEAD/llm_explanation.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":"d51fc24587a2e7ad","code_sha256_prefix":"d51fc24587a2e7ad","mcp_get_code":{"code_sha256":"d51fc24587a2e7ad"}},{"arxiv_id":"2402.11518","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-driven-meta-structure","title":"Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linchen-65/restruct","path":"main_node_classification.py","file_url":"https://github.com/linchen-65/restruct/blob/HEAD/main_node_classification.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":"d38f5abbcff90e3f","code_sha256_prefix":"d38f5abbcff90e3f","mcp_get_code":{"code_sha256":"d38f5abbcff90e3f"}},{"arxiv_id":"2402.11518","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-driven-meta-structure","title":"Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linchen-65/restruct","path":"main_recommendation.py","file_url":"https://github.com/linchen-65/restruct/blob/HEAD/main_recommendation.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":"c9fb469d7cae0cc7","code_sha256_prefix":"c9fb469d7cae0cc7","mcp_get_code":{"code_sha256":"c9fb469d7cae0cc7"}},{"arxiv_id":"2402.11518","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-driven-meta-structure","title":"Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linchen-65/restruct","path":"train_node_classification.py","file_url":"https://github.com/linchen-65/restruct/blob/HEAD/train_node_classification.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":"af4a97546a274d98","code_sha256_prefix":"af4a97546a274d98","mcp_get_code":{"code_sha256":"af4a97546a274d98"}},{"arxiv_id":"2402.11175","arxiv_id_is_arxiv":true,"paper":"/paper/m4gt-bench-evaluation-benchmark-for-black-box","title":"M4GT-Bench: Evaluation Benchmark for Black-Box Machine-Generated Text Detection","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/m4gt-bench","path":"src/gltr_lr.py","file_url":"https://github.com/mbzuai-nlp/m4gt-bench/blob/HEAD/src/gltr_lr.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, mbzuai-nlp/m4gt-bench when it was checked","code_sha256":"53711ba356067419","code_sha256_prefix":"53711ba356067419","mcp_get_code":{"code_sha256":"53711ba356067419"}},{"arxiv_id":"2402.11175","arxiv_id_is_arxiv":true,"paper":"/paper/m4gt-bench-evaluation-benchmark-for-black-box","title":"M4GT-Bench: Evaluation Benchmark for Black-Box Machine-Generated Text Detection","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/m4gt-bench","path":"src/gltr_svm.py","file_url":"https://github.com/mbzuai-nlp/m4gt-bench/blob/HEAD/src/gltr_svm.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, mbzuai-nlp/m4gt-bench when it was checked","code_sha256":"cb4ff66520d69188","code_sha256_prefix":"cb4ff66520d69188","mcp_get_code":{"code_sha256":"cb4ff66520d69188"}},{"arxiv_id":"2402.11025","arxiv_id_is_arxiv":true,"paper":"/paper/training-bayesian-neural-networks-with-sparse","title":"Training Bayesian Neural Networks with Sparse Subspace Variational Inference","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljb121002/ssvi","path":"train_cifar.py","file_url":"https://github.com/ljb121002/ssvi/blob/HEAD/train_cifar.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, ljb121002/ssvi when it was checked","code_sha256":"e85cd5fbef35f1a4","code_sha256_prefix":"e85cd5fbef35f1a4","mcp_get_code":{"code_sha256":"e85cd5fbef35f1a4"}},{"arxiv_id":"2402.08907","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"main_multi.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/main_multi.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, zehong-wang/subgraph-pooling when it was checked","code_sha256":"e7dafa34c4dede31","code_sha256_prefix":"e7dafa34c4dede31","mcp_get_code":{"code_sha256":"e7dafa34c4dede31"}},{"arxiv_id":"2402.08907","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"main_elliptic.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/main_elliptic.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, zehong-wang/subgraph-pooling when it was checked","code_sha256":"585e4181a8ac620f","code_sha256_prefix":"585e4181a8ac620f","mcp_get_code":{"code_sha256":"585e4181a8ac620f"}},{"arxiv_id":"2402.08595","arxiv_id_is_arxiv":true,"paper":"/paper/homomorphism-counts-for-graph-neural-networks","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejin700/hombasis-gnn","path":"hombasis-bench/run-collab.py","file_url":"https://github.com/ejin700/hombasis-gnn/blob/HEAD/hombasis-bench/run-collab.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":"b10c2f48c45238a5","code_sha256_prefix":"b10c2f48c45238a5","mcp_get_code":{"code_sha256":"b10c2f48c45238a5"}},{"arxiv_id":"2402.08595","arxiv_id_is_arxiv":true,"paper":"/paper/homomorphism-counts-for-graph-neural-networks","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icml2024357/hombasis-gnn","path":"hombasis-bench/zinc_utils.py","file_url":"https://github.com/icml2024357/hombasis-gnn/blob/HEAD/hombasis-bench/zinc_utils.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":"b367358dc74e5496","code_sha256_prefix":"b367358dc74e5496","mcp_get_code":{"code_sha256":"b367358dc74e5496"}},{"arxiv_id":"2402.08595","arxiv_id_is_arxiv":true,"paper":"/paper/homomorphism-counts-for-graph-neural-networks","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejin700/hombasis-gnn","path":"qm9/src/experiments/run_gc.py","file_url":"https://github.com/ejin700/hombasis-gnn/blob/HEAD/qm9/src/experiments/run_gc.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":"d1a3f22e2fe768ac","code_sha256_prefix":"d1a3f22e2fe768ac","mcp_get_code":{"code_sha256":"d1a3f22e2fe768ac"}},{"arxiv_id":"2402.02054","arxiv_id_is_arxiv":true,"paper":"/paper/neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liu-jingzhe/graph-scaling-laws","path":"main_node.py","file_url":"https://github.com/liu-jingzhe/graph-scaling-laws/blob/HEAD/main_node.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82f54a95d4951b19","code_sha256_prefix":"82f54a95d4951b19","mcp_get_code":{"code_sha256":"82f54a95d4951b19"}},{"arxiv_id":"2402.02054","arxiv_id_is_arxiv":true,"paper":"/paper/neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liu-jingzhe/graph-scaling-laws","path":"main_graph.py","file_url":"https://github.com/liu-jingzhe/graph-scaling-laws/blob/HEAD/main_graph.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":"4c7246bc9ee8803d","code_sha256_prefix":"4c7246bc9ee8803d","mcp_get_code":{"code_sha256":"4c7246bc9ee8803d"}},{"arxiv_id":"2401.17752","arxiv_id_is_arxiv":true,"paper":"/paper/pf-gnn-differentiable-particle-filtering-1","title":"PF-GNN: Differentiable particle filtering based approximation of universal graph representations","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfgnn/pf-gnn","path":"worker.py","file_url":"https://github.com/pfgnn/pf-gnn/blob/HEAD/worker.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, pfgnn/pf-gnn when it was checked","code_sha256":"85b2ff9c271190cf","code_sha256_prefix":"85b2ff9c271190cf","mcp_get_code":{"code_sha256":"85b2ff9c271190cf"}},{"arxiv_id":"2401.12233","arxiv_id_is_arxiv":true,"paper":"/paper/memorization-in-self-supervised-learning","title":"Memorization in Self-Supervised Learning Improves Downstream Generalization","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sprintml/memorizationssl","path":"SimClr_train.py","file_url":"https://github.com/sprintml/memorizationssl/blob/HEAD/SimClr_train.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":"a0a63b0e2f702d7c","code_sha256_prefix":"a0a63b0e2f702d7c","mcp_get_code":{"code_sha256":"a0a63b0e2f702d7c"}},{"arxiv_id":"2401.08898","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-state-and-history-representations","title":"Bridging State and History Representations: Understanding Self-Predictive RL","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twni2016/self-predictive-rl","path":"linear_code/replearn/learn.py","file_url":"https://github.com/twni2016/self-predictive-rl/blob/HEAD/linear_code/replearn/learn.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, twni2016/self-predictive-rl when it was checked","code_sha256":"db5b40218f291550","code_sha256_prefix":"db5b40218f291550","mcp_get_code":{"code_sha256":"db5b40218f291550"}},{"arxiv_id":"2401.00611","arxiv_id_is_arxiv":true,"paper":"/paper/a-compact-representation-for-bayesian-neural","title":"A Compact Representation for Bayesian Neural Networks By Removing Permutation Symmetry","date":"2023-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timxzz/abi_with_rebasin","path":"MNIST_net_matching.py","file_url":"https://github.com/timxzz/abi_with_rebasin/blob/HEAD/MNIST_net_matching.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, timxzz/abi_with_rebasin when it was checked","code_sha256":"ec9c68eaf082f7f3","code_sha256_prefix":"ec9c68eaf082f7f3","mcp_get_code":{"code_sha256":"ec9c68eaf082f7f3"}},{"arxiv_id":"2312.10401","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-dimensional-rationale-in-graph","title":"Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronji/drgcl","path":"TransferLearning/chem/pretrain_drgcl.py","file_url":"https://github.com/byronji/drgcl/blob/HEAD/TransferLearning/chem/pretrain_drgcl.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, byronji/drgcl when it was checked","code_sha256":"1a09a794a09f3231","code_sha256_prefix":"1a09a794a09f3231","mcp_get_code":{"code_sha256":"1a09a794a09f3231"}},{"arxiv_id":"2312.10401","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-dimensional-rationale-in-graph","title":"Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronji/drgcl","path":"TransferLearning/bio/pretrain_drgcl.py","file_url":"https://github.com/byronji/drgcl/blob/HEAD/TransferLearning/bio/pretrain_drgcl.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, byronji/drgcl when it was checked","code_sha256":"3be1181cc4193845","code_sha256_prefix":"3be1181cc4193845","mcp_get_code":{"code_sha256":"3be1181cc4193845"}},{"arxiv_id":"2312.06221","arxiv_id_is_arxiv":true,"paper":"/paper/csot-curriculum-and-structure-aware-optimal-1","title":"CSOT: Curriculum and Structure-Aware Optimal Transport for Learning with Noisy Labels","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijichang/LNL-NCE","path":"cifar/utils.py","file_url":"https://github.com/lijichang/LNL-NCE/blob/HEAD/cifar/utils.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, lijichang/LNL-NCE when it was checked","code_sha256":"9a1ea56d8b41b7b2","code_sha256_prefix":"9a1ea56d8b41b7b2","mcp_get_code":{"code_sha256":"9a1ea56d8b41b7b2"}},{"arxiv_id":"2312.02708","arxiv_id_is_arxiv":true,"paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobustGraph/RoboGraph","path":"robograph/model/gnn.py","file_url":"https://github.com/RobustGraph/RoboGraph/blob/HEAD/robograph/model/gnn.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":"3df5b2fc12d5a4ec","code_sha256_prefix":"3df5b2fc12d5a4ec","mcp_get_code":{"code_sha256":"3df5b2fc12d5a4ec"}},{"arxiv_id":"2312.02428","arxiv_id_is_arxiv":true,"paper":"/paper/freestyleret-retrieving-images-from-style","title":"FreestyleRet: Retrieving Images from Style-Diversified Queries","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"curisejia/freestyleret","path":"comparison_test/model_tune.py","file_url":"https://github.com/curisejia/freestyleret/blob/HEAD/comparison_test/model_tune.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":"eec17adf13c5b911","code_sha256_prefix":"eec17adf13c5b911","mcp_get_code":{"code_sha256":"eec17adf13c5b911"}},{"arxiv_id":"2312.00935","arxiv_id_is_arxiv":true,"paper":"/paper/a-theory-of-unimodal-bias-in-multimodal","title":"Understanding Unimodal Bias in Multimodal Deep Linear Networks","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedizhang/unimodal-bias","path":"MNIST/mnist.py","file_url":"https://github.com/yedizhang/unimodal-bias/blob/HEAD/MNIST/mnist.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, yedizhang/unimodal-bias when it was checked","code_sha256":"ddb4f2f6ba9ecceb","code_sha256_prefix":"ddb4f2f6ba9ecceb","mcp_get_code":{"code_sha256":"ddb4f2f6ba9ecceb"}},{"arxiv_id":"2312.00761","arxiv_id_is_arxiv":true,"paper":"/paper/deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangamesh-kodge/class_forgetting","path":"analysis/shadow_train.py","file_url":"https://github.com/sangamesh-kodge/class_forgetting/blob/HEAD/analysis/shadow_train.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, sangamesh-kodge/class_forgetting when it was checked","code_sha256":"38d8b2e3aa6d1cc5","code_sha256_prefix":"38d8b2e3aa6d1cc5","mcp_get_code":{"code_sha256":"38d8b2e3aa6d1cc5"}},{"arxiv_id":"2311.17327","arxiv_id_is_arxiv":true,"paper":"/paper/improving-self-supervised-molecular-1","title":"Improving Self-supervised Molecular Representation Learning using Persistent Homology","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/Molecular-homology","path":"finetune/finetune_PI.py","file_url":"https://github.com/LUOyk1999/Molecular-homology/blob/HEAD/finetune/finetune_PI.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":"a5d7dc316a22678a","code_sha256_prefix":"a5d7dc316a22678a","mcp_get_code":{"code_sha256":"a5d7dc316a22678a"}},{"arxiv_id":"2311.10572","arxiv_id_is_arxiv":true,"paper":"/paper/ssb-simple-but-strong-baseline-for-boosting-1","title":"SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learning","date":"2023-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YUE-FAN/SSB","path":"trainer_sim_ssb.py","file_url":"https://github.com/YUE-FAN/SSB/blob/HEAD/trainer_sim_ssb.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, YUE-FAN/SSB when it was checked","code_sha256":"af5974bbbe60d361","code_sha256_prefix":"af5974bbbe60d361","mcp_get_code":{"code_sha256":"af5974bbbe60d361"}},{"arxiv_id":"2311.04760","arxiv_id_is_arxiv":true,"paper":"/paper/towards-open-world-cross-domain-sequential","title":"Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/macd","path":"train_our.py","file_url":"https://github.com/wujiangxu/macd/blob/HEAD/train_our.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, wujiangxu/macd when it was checked","code_sha256":"d2a650a2d0fe7c6b","code_sha256_prefix":"d2a650a2d0fe7c6b","mcp_get_code":{"code_sha256":"d2a650a2d0fe7c6b"}},{"arxiv_id":"2311.04635","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deeper-lighter-and-interpretable-1","title":"Towards Deeper, Lighter and Interpretable Cross Network for CTR Prediction","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonctr/GDCN","path":"train_base.py","file_url":"https://github.com/anonctr/GDCN/blob/HEAD/train_base.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, anonctr/GDCN when it was checked","code_sha256":"a768a9a70154da5b","code_sha256_prefix":"a768a9a70154da5b","mcp_get_code":{"code_sha256":"a768a9a70154da5b"}},{"arxiv_id":"2311.04590","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-cross-domain-sequential","title":"Rethinking Cross-Domain Sequential Recommendation under Open-World Assumptions","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/amid","path":"train_sr.py","file_url":"https://github.com/wujiangxu/amid/blob/HEAD/train_sr.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, wujiangxu/amid when it was checked","code_sha256":"28606bc19e431a80","code_sha256_prefix":"28606bc19e431a80","mcp_get_code":{"code_sha256":"28606bc19e431a80"}},{"arxiv_id":"2311.04590","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-cross-domain-sequential","title":"Rethinking Cross-Domain Sequential Recommendation under Open-World Assumptions","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/amid","path":"train_sr_dr.py","file_url":"https://github.com/wujiangxu/amid/blob/HEAD/train_sr_dr.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, wujiangxu/amid when it was checked","code_sha256":"c47c0782a25b87d3","code_sha256_prefix":"c47c0782a25b87d3","mcp_get_code":{"code_sha256":"c47c0782a25b87d3"}},{"arxiv_id":"2311.03714","arxiv_id_is_arxiv":true,"paper":"/paper/loss-balancing-for-fair-supervised-learning","title":"Loss Balancing for Fair Supervised Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khalilimahdi/loss_balancing_icml2023","path":"Algorithms/Algorithm2WithPytorch.py","file_url":"https://github.com/khalilimahdi/loss_balancing_icml2023/blob/HEAD/Algorithms/Algorithm2WithPytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, khalilimahdi/loss_balancing_icml2023 when it was checked","code_sha256":"438754b981389797","code_sha256_prefix":"438754b981389797","mcp_get_code":{"code_sha256":"438754b981389797"}},{"arxiv_id":"2311.03714","arxiv_id_is_arxiv":true,"paper":"/paper/loss-balancing-for-fair-supervised-learning","title":"Loss Balancing for Fair Supervised Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhaliliMahdi/Loss_Balancing_ICML2023","path":"Algorithms/Non_linear.py","file_url":"https://github.com/KhaliliMahdi/Loss_Balancing_ICML2023/blob/HEAD/Algorithms/Non_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, KhaliliMahdi/Loss_Balancing_ICML2023 when it was checked","code_sha256":"9f1eb0ac97d570e7","code_sha256_prefix":"9f1eb0ac97d570e7","mcp_get_code":{"code_sha256":"9f1eb0ac97d570e7"}},{"arxiv_id":"2311.12850","arxiv_id_is_arxiv":true,"paper":"/paper/meticulously-selecting-1-of-the-dataset-for","title":"PrivImage: Differentially Private Synthetic Image Generation using Diffusion Models with Semantic-Aware Pretraining","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnierlee/dp-imagen","path":"src/SemanticQuery/train_imagenet_classifier.py","file_url":"https://github.com/sunnierlee/dp-imagen/blob/HEAD/src/SemanticQuery/train_imagenet_classifier.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":"50bb3cdd5b38cb14","code_sha256_prefix":"50bb3cdd5b38cb14","mcp_get_code":{"code_sha256":"50bb3cdd5b38cb14"}},{"arxiv_id":"2310.18716","arxiv_id_is_arxiv":true,"paper":"/paper/laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeMLP/basis-invariance-synthetic-experiment","path":"synthetic.py","file_url":"https://github.com/GeorgeMLP/basis-invariance-synthetic-experiment/blob/HEAD/synthetic.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":"6b32104b7d171641","code_sha256_prefix":"6b32104b7d171641","mcp_get_code":{"code_sha256":"6b32104b7d171641"}},{"arxiv_id":"2310.17137","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-gaussian-processes-via","title":"Large-Scale Gaussian Processes via Alternating Projection","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kayween/alternating-projection-for-gp","path":"utils.py","file_url":"https://github.com/kayween/alternating-projection-for-gp/blob/HEAD/utils.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, kayween/alternating-projection-for-gp when it was checked","code_sha256":"3fd73c5ac27e0c52","code_sha256_prefix":"3fd73c5ac27e0c52","mcp_get_code":{"code_sha256":"3fd73c5ac27e0c52"}},{"arxiv_id":"2310.14029","arxiv_id_is_arxiv":true,"paper":"/paper/llm-prop-predicting-physical-and-electronic","title":"LLM-Prop: Predicting Physical And Electronic Properties Of Crystalline Solids From Their Text Descriptions","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vertaix/llm-prop","path":"llmprop_train.py","file_url":"https://github.com/vertaix/llm-prop/blob/HEAD/llmprop_train.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":"47bdc24545f8cb6e","code_sha256_prefix":"47bdc24545f8cb6e","mcp_get_code":{"code_sha256":"47bdc24545f8cb6e"}},{"arxiv_id":"2310.14017","arxiv_id_is_arxiv":true,"paper":"/paper/contrast-everything-a-hierarchical","title":"Contrast Everything: A Hierarchical Contrastive Framework for Medical Time-Series","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wickstrom/mixupcontrastivelearning","path":"src/mcl/trainer.py","file_url":"https://github.com/wickstrom/mixupcontrastivelearning/blob/HEAD/src/mcl/trainer.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":"f5c0c05f7535c06b","code_sha256_prefix":"f5c0c05f7535c06b","mcp_get_code":{"code_sha256":"f5c0c05f7535c06b"}},{"arxiv_id":"2310.13671","arxiv_id_is_arxiv":true,"paper":"/paper/let-s-synthesize-step-by-step-iterative","title":"Let's Synthesize Step by Step: Iterative Dataset Synthesis with Large Language Models by Extrapolating Errors from Small Models","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyskywalker/synthesis_step-by-step_official","path":"ModelTraining/trainHelperQA.py","file_url":"https://github.com/rickyskywalker/synthesis_step-by-step_official/blob/HEAD/ModelTraining/trainHelperQA.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, rickyskywalker/synthesis_step-by-step_official when it was checked","code_sha256":"559ca9a7878d00a3","code_sha256_prefix":"559ca9a7878d00a3","mcp_get_code":{"code_sha256":"559ca9a7878d00a3"}},{"arxiv_id":"2310.13671","arxiv_id_is_arxiv":true,"paper":"/paper/let-s-synthesize-step-by-step-iterative","title":"Let's Synthesize Step by Step: Iterative Dataset Synthesis with Large Language Models by Extrapolating Errors from Small Models","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyskywalker/synthesis_step-by-step_official","path":"ModelTraining/trainHelper.py","file_url":"https://github.com/rickyskywalker/synthesis_step-by-step_official/blob/HEAD/ModelTraining/trainHelper.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, rickyskywalker/synthesis_step-by-step_official when it was checked","code_sha256":"76b0eddf34a9bdb2","code_sha256_prefix":"76b0eddf34a9bdb2","mcp_get_code":{"code_sha256":"76b0eddf34a9bdb2"}},{"arxiv_id":"2310.12457","arxiv_id_is_arxiv":true,"paper":"/paper/musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haitian-jiang/MuseGNN","path":"batch.py","file_url":"https://github.com/haitian-jiang/MuseGNN/blob/HEAD/batch.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":"3723770e898ccc30","code_sha256_prefix":"3723770e898ccc30","mcp_get_code":{"code_sha256":"3723770e898ccc30"}},{"arxiv_id":"2310.10362","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-tuning-for-multi-view-graph","title":"Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gongchenghua/self-pro","path":"Self-Pro/hete/ds.py","file_url":"https://github.com/gongchenghua/self-pro/blob/HEAD/Self-Pro/hete/ds.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, gongchenghua/self-pro when it was checked","code_sha256":"f39fcc758d981393","code_sha256_prefix":"f39fcc758d981393","mcp_get_code":{"code_sha256":"f39fcc758d981393"}},{"arxiv_id":"2310.09336","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-abilities-emerge","title":"Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phys-ai/concept_graphs","path":"linear_classifier_3classes.py","file_url":"https://github.com/phys-ai/concept_graphs/blob/HEAD/linear_classifier_3classes.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, phys-ai/concept_graphs when it was checked","code_sha256":"8948aee3b43279fe","code_sha256_prefix":"8948aee3b43279fe","mcp_get_code":{"code_sha256":"8948aee3b43279fe"}},{"arxiv_id":"2310.08012","arxiv_id_is_arxiv":true,"paper":"/paper/autofhe-automated-adaption-of-cnns-for","title":"AutoFHE: Automated Adaption of CNNs for Efficient Evaluation over FHE","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human-analysis/AutoFHE","path":"search/helper.py","file_url":"https://github.com/human-analysis/AutoFHE/blob/HEAD/search/helper.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":"36eaee98c81df5c9","code_sha256_prefix":"36eaee98c81df5c9","mcp_get_code":{"code_sha256":"36eaee98c81df5c9"}},{"arxiv_id":"2310.06396","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zknus/NeurIPS-2023-HANG-Robustness","path":"gnn_misg.py","file_url":"https://github.com/zknus/NeurIPS-2023-HANG-Robustness/blob/HEAD/gnn_misg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zknus/NeurIPS-2023-HANG-Robustness when it was checked","code_sha256":"15cbb9f3adf7eca7","code_sha256_prefix":"15cbb9f3adf7eca7","mcp_get_code":{"code_sha256":"15cbb9f3adf7eca7"}},{"arxiv_id":"2310.06179","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-integration-for-spatiotemporal-1","title":"Automatic Integration for Spatiotemporal Neural Point Processes","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/autostpp","path":"src/demo/AutoInt.py","file_url":"https://github.com/rose-stl-lab/autostpp/blob/HEAD/src/demo/AutoInt.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":"2a2010f87eabbc94","code_sha256_prefix":"2a2010f87eabbc94","mcp_get_code":{"code_sha256":"2a2010f87eabbc94"}},{"arxiv_id":"2310.06077","arxiv_id_is_arxiv":true,"paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_covid.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_covid.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, adityalab/pets when it was checked","code_sha256":"3e9289dc0e95e57a","code_sha256_prefix":"3e9289dc0e95e57a","mcp_get_code":{"code_sha256":"3e9289dc0e95e57a"}},{"arxiv_id":"2310.06077","arxiv_id_is_arxiv":true,"paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_metrla.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_metrla.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, adityalab/pets when it was checked","code_sha256":"a4f1529d8b00020a","code_sha256_prefix":"a4f1529d8b00020a","mcp_get_code":{"code_sha256":"a4f1529d8b00020a"}},{"arxiv_id":"2310.06077","arxiv_id_is_arxiv":true,"paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_metrla_ood.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_metrla_ood.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, adityalab/pets when it was checked","code_sha256":"63b08c7acc11bdbc","code_sha256_prefix":"63b08c7acc11bdbc","mcp_get_code":{"code_sha256":"63b08c7acc11bdbc"}},{"arxiv_id":"2310.04780","arxiv_id_is_arxiv":true,"paper":"/paper/ipmix-label-preserving-data-augmentation-1","title":"IPMix: Label-Preserving Data Augmentation Method for Training Robust Classifiers","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzlsaber/ipmix","path":"imagenet.py","file_url":"https://github.com/hzlsaber/ipmix/blob/HEAD/imagenet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7914dbaf0adf4d57","code_sha256_prefix":"7914dbaf0adf4d57","mcp_get_code":{"code_sha256":"7914dbaf0adf4d57"}},{"arxiv_id":"2310.02401","arxiv_id_is_arxiv":true,"paper":"/paper/ft-shield-a-watermark-against-unauthorized","title":"FT-Shield: A Watermark Against Unauthorized Fine-tuning in Text-to-Image Diffusion Models","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yingqiancui/FT-Shield","path":"train_classifier.py","file_url":"https://github.com/Yingqiancui/FT-Shield/blob/HEAD/train_classifier.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":"f31f85f026c44aae","code_sha256_prefix":"f31f85f026c44aae","mcp_get_code":{"code_sha256":"f31f85f026c44aae"}},{"arxiv_id":"2310.02396","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-regularization-of-multi-task","title":"Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuse","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sflippl/multi-task","path":"experiments/diagonal/diagonal_network_pretrain.py","file_url":"https://github.com/sflippl/multi-task/blob/HEAD/experiments/diagonal/diagonal_network_pretrain.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, sflippl/multi-task when it was checked","code_sha256":"6ee72f8c332d57be","code_sha256_prefix":"6ee72f8c332d57be","mcp_get_code":{"code_sha256":"6ee72f8c332d57be"}},{"arxiv_id":"2310.01875","arxiv_id_is_arxiv":true,"paper":"/paper/towards-stable-backdoor-purification-through-1","title":"Towards Stable Backdoor Purification through Feature Shift Tuning","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"1042d89ceda24cdb","code_sha256_prefix":"1042d89ceda24cdb","mcp_get_code":{"code_sha256":"1042d89ceda24cdb"}},{"arxiv_id":"2310.01680","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.01680","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"zshyang/kaf","path":"pretrain1.py","file_url":"https://github.com/zshyang/kaf/blob/HEAD/pretrain1.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, zshyang/kaf when it was checked","code_sha256":"c5b4e5ecb5e47caa","code_sha256_prefix":"c5b4e5ecb5e47caa","mcp_get_code":{"code_sha256":"c5b4e5ecb5e47caa"}},{"arxiv_id":"2310.01180","arxiv_id_is_arxiv":true,"paper":"/paper/evolutionary-neural-architecture-search-for-1","title":"Evolutionary Neural Architecture Search for Transformer in Knowledge Tracing","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DevilYangS/ENAS-KT","path":"training_script.py","file_url":"https://github.com/DevilYangS/ENAS-KT/blob/HEAD/training_script.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, DevilYangS/ENAS-KT when it was checked","code_sha256":"4b91e5408023e9ff","code_sha256_prefix":"4b91e5408023e9ff","mcp_get_code":{"code_sha256":"4b91e5408023e9ff"}},{"arxiv_id":"2310.00697","arxiv_id_is_arxiv":true,"paper":"/paper/learning-how-to-propagate-messages-in-graph","title":"Learning How to Propagate Messages in Graph Neural Networks","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/l2p","path":"full/L2Q.py","file_url":"https://github.com/tengxiao1/l2p/blob/HEAD/full/L2Q.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, tengxiao1/l2p when it was checked","code_sha256":"97610413fe4dddab","code_sha256_prefix":"97610413fe4dddab","mcp_get_code":{"code_sha256":"97610413fe4dddab"}},{"arxiv_id":"2310.00429","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-stability-of-iterative-retraining-of","title":"On the Stability of Iterative Retraining of Generative Models on their own Data","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qb3/gen_models_dont_go_mad","path":"iterative_retraining.py","file_url":"https://github.com/qb3/gen_models_dont_go_mad/blob/HEAD/iterative_retraining.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, qb3/gen_models_dont_go_mad when it was checked","code_sha256":"7b2ae902263515a1","code_sha256_prefix":"7b2ae902263515a1","mcp_get_code":{"code_sha256":"7b2ae902263515a1"}},{"arxiv_id":"2310.00115","arxiv_id_is_arxiv":true,"paper":"/paper/learning-over-molecular-conformer-ensembles","title":"Learning Over Molecular Conformer Ensembles: Datasets and Benchmarks","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SXKDZ/MARCEL","path":"benchmarks/train_2d.py","file_url":"https://github.com/SXKDZ/MARCEL/blob/HEAD/benchmarks/train_2d.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, SXKDZ/MARCEL when it was checked","code_sha256":"6ee6c12b351775e6","code_sha256_prefix":"6ee6c12b351775e6","mcp_get_code":{"code_sha256":"6ee6c12b351775e6"}},{"arxiv_id":"2309.16316","arxiv_id_is_arxiv":true,"paper":"/paper/astroconformer-the-prospects-of-analyzing","title":"Astroconformer: The Prospects of Analyzing Stellar Light Curves with Transformer-Based Deep Learning Models","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panjiashu/astroconformer","path":"Astroconformer/Train/train_tookit_dev.py","file_url":"https://github.com/panjiashu/astroconformer/blob/HEAD/Astroconformer/Train/train_tookit_dev.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, panjiashu/astroconformer when it was checked","code_sha256":"190b45142753f65f","code_sha256_prefix":"190b45142753f65f","mcp_get_code":{"code_sha256":"190b45142753f65f"}},{"arxiv_id":"2309.14949","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-world-test-time-adaptation-tri","title":"Towards Real-World Test-Time Adaptation: Tri-Net Self-Training with Balanced Normalization","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorilla-lab-scut/tribe","path":"train_mnist.py","file_url":"https://github.com/gorilla-lab-scut/tribe/blob/HEAD/train_mnist.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, gorilla-lab-scut/tribe when it was checked","code_sha256":"bfba965ef40453f9","code_sha256_prefix":"bfba965ef40453f9","mcp_get_code":{"code_sha256":"bfba965ef40453f9"}},{"arxiv_id":"2309.04919","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-chunking-with-hierarchical-rnn","title":"Unsupervised Chunking with Hierarchical RNN","date":"2023-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/uchrnn","path":"baseline/Unsupervised-Chunking/model4_hrnn.py","file_url":"https://github.com/manga-uofa/uchrnn/blob/HEAD/baseline/Unsupervised-Chunking/model4_hrnn.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":"f69f589778408167","code_sha256_prefix":"f69f589778408167","mcp_get_code":{"code_sha256":"f69f589778408167"}},{"arxiv_id":"2309.04367","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-for-classifying-2d-grid-based","title":"Active Learning for Classifying 2D Grid-Based Level Completability","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahsabazzaz/level-completabilty-x-active-learning","path":"passive_train.py","file_url":"https://github.com/mahsabazzaz/level-completabilty-x-active-learning/blob/HEAD/passive_train.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, mahsabazzaz/level-completabilty-x-active-learning when it was checked","code_sha256":"e543ef6b8ca69ff4","code_sha256_prefix":"e543ef6b8ca69ff4","mcp_get_code":{"code_sha256":"e543ef6b8ca69ff4"}},{"arxiv_id":"2309.01788","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-grammar-induced-geometry-for","title":"Hierarchical Grammar-Induced Geometry for Data-Efficient Molecular Property Prediction","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmh14/Geo-DEG","path":"GCN/pretrain_contextpred.py","file_url":"https://github.com/gmh14/Geo-DEG/blob/HEAD/GCN/pretrain_contextpred.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":"fa82f5b97a3162ed","code_sha256_prefix":"fa82f5b97a3162ed","mcp_get_code":{"code_sha256":"fa82f5b97a3162ed"}},{"arxiv_id":"2309.01788","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-grammar-induced-geometry-for","title":"Hierarchical Grammar-Induced Geometry for Data-Efficient Molecular Property Prediction","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmh14/Geo-DEG","path":"GCN/pretrain_deepgraphinfomax.py","file_url":"https://github.com/gmh14/Geo-DEG/blob/HEAD/GCN/pretrain_deepgraphinfomax.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":"26bd6db6fc4f8df4","code_sha256_prefix":"26bd6db6fc4f8df4","mcp_get_code":{"code_sha256":"26bd6db6fc4f8df4"}},{"arxiv_id":"2308.11073","arxiv_id_is_arxiv":true,"paper":"/paper/audio-visual-class-incremental-learning","title":"Audio-Visual Class-Incremental Learning","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiguopian/av-cil_iccv2023","path":"ours/train_incremental_ours.py","file_url":"https://github.com/weiguopian/av-cil_iccv2023/blob/HEAD/ours/train_incremental_ours.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, weiguopian/av-cil_iccv2023 when it was checked","code_sha256":"211bcfcce2e3dfcc","code_sha256_prefix":"211bcfcce2e3dfcc","mcp_get_code":{"code_sha256":"211bcfcce2e3dfcc"}},{"arxiv_id":"2308.08942","arxiv_id_is_arxiv":true,"paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_3dpw.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_3dpw.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, mediabrain-sjtu/auxformer when it was checked","code_sha256":"77377e7ece06c283","code_sha256_prefix":"77377e7ece06c283","mcp_get_code":{"code_sha256":"77377e7ece06c283"}},{"arxiv_id":"2308.08942","arxiv_id_is_arxiv":true,"paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_cmu.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_cmu.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, mediabrain-sjtu/auxformer when it was checked","code_sha256":"2b8d99de10074ebc","code_sha256_prefix":"2b8d99de10074ebc","mcp_get_code":{"code_sha256":"2b8d99de10074ebc"}},{"arxiv_id":"2308.04406","arxiv_id_is_arxiv":true,"paper":"/paper/xgbd-explanation-guided-graph-backdoor","title":"XGBD: Explanation-Guided Graph Backdoor Detection","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanzihan/gnn_backdoor_detection","path":"src/attack.py","file_url":"https://github.com/guanzihan/gnn_backdoor_detection/blob/HEAD/src/attack.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":"8d7efef8db476835","code_sha256_prefix":"8d7efef8db476835","mcp_get_code":{"code_sha256":"8d7efef8db476835"}},{"arxiv_id":"2308.03306","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/dignn","path":"nodeclassification/main_ppi.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/nodeclassification/main_ppi.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":"bddc79fec76e9fec","code_sha256_prefix":"bddc79fec76e9fec","mcp_get_code":{"code_sha256":"bddc79fec76e9fec"}},{"arxiv_id":"2308.02117","arxiv_id_is_arxiv":true,"paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLing0818/VQGraph","path":"train_and_eval.py","file_url":"https://github.com/YangLing0818/VQGraph/blob/HEAD/train_and_eval.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, YangLing0818/VQGraph when it was checked","code_sha256":"be348e82ea1b9cc3","code_sha256_prefix":"be348e82ea1b9cc3","mcp_get_code":{"code_sha256":"be348e82ea1b9cc3"}},{"arxiv_id":"2307.15934","arxiv_id_is_arxiv":true,"paper":"/paper/a-noisy-label-learning-formulation-for-immune","title":"A Noisy-Label-Learning Formulation for Immune Repertoire Classification and Disease-Associated Immune Receptor Sequence Identification","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TencentAILabHealthcare/NLL-IRC","path":"train_CMV.py","file_url":"https://github.com/TencentAILabHealthcare/NLL-IRC/blob/HEAD/train_CMV.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, TencentAILabHealthcare/NLL-IRC when it was checked","code_sha256":"172f5d9f0535841a","code_sha256_prefix":"172f5d9f0535841a","mcp_get_code":{"code_sha256":"172f5d9f0535841a"}},{"arxiv_id":"2307.15539","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"pseudo_label_vd.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/pseudo_label_vd.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, minliu01/non-adversarial_backdoor when it was checked","code_sha256":"d5941b8a7c50c3ca","code_sha256_prefix":"d5941b8a7c50c3ca","mcp_get_code":{"code_sha256":"d5941b8a7c50c3ca"}},{"arxiv_id":"2307.15539","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"train_nab.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/train_nab.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, minliu01/non-adversarial_backdoor when it was checked","code_sha256":"e2eb7479b4c550f3","code_sha256_prefix":"e2eb7479b4c550f3","mcp_get_code":{"code_sha256":"e2eb7479b4c550f3"}},{"arxiv_id":"2307.15539","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-defense-with-non-adversarial","title":"Beating Backdoor Attack at Its Own Game","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minliu01/non-adversarial_backdoor","path":"backdoor_detection_lga.py","file_url":"https://github.com/minliu01/non-adversarial_backdoor/blob/HEAD/backdoor_detection_lga.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, minliu01/non-adversarial_backdoor when it was checked","code_sha256":"935ebb95d885640f","code_sha256_prefix":"935ebb95d885640f","mcp_get_code":{"code_sha256":"935ebb95d885640f"}},{"arxiv_id":"2307.15411","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-the-learning-behaviour-of-in","title":"Investigating the Learning Behaviour of In-context Learning: A Comparison with Supervised Learning","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xdwang0726/icl_ll","path":"fine-tuning.py","file_url":"https://github.com/xdwang0726/icl_ll/blob/HEAD/fine-tuning.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":"034db66c946c995d","code_sha256_prefix":"034db66c946c995d","mcp_get_code":{"code_sha256":"034db66c946c995d"}},{"arxiv_id":"2307.07250","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-adversarial-vulnerability-through","title":"Mitigating Adversarial Vulnerability through Causal Parameter Estimation by Adversarial Double Machine Learning","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByungKwanLee/Double-Debiased-Adversary","path":"adml/fast_train_adml_adv.py","file_url":"https://github.com/ByungKwanLee/Double-Debiased-Adversary/blob/HEAD/adml/fast_train_adml_adv.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":"1cf31ad91806def5","code_sha256_prefix":"1cf31ad91806def5","mcp_get_code":{"code_sha256":"1cf31ad91806def5"}},{"arxiv_id":"2307.04052","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-group-auxiliary-datasets-for","title":"Learning to Group Auxiliary Datasets for Molecule","date":"2023-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-and-Geometric-Learning/MolGroup","path":"molgroup/app/train_molgroup.py","file_url":"https://github.com/Graph-and-Geometric-Learning/MolGroup/blob/HEAD/molgroup/app/train_molgroup.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, Graph-and-Geometric-Learning/MolGroup when it was checked","code_sha256":"276b930464659a52","code_sha256_prefix":"276b930464659a52","mcp_get_code":{"code_sha256":"276b930464659a52"}},{"arxiv_id":"2307.00755","arxiv_id_is_arxiv":true,"paper":"/paper/graph-level-anomaly-detection-via","title":"Graph-level Anomaly Detection via Hierarchical Memory Networks","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niuchx/himnet","path":"train_herg.py","file_url":"https://github.com/niuchx/himnet/blob/HEAD/train_herg.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":"9fe42ed549cc3b5b","code_sha256_prefix":"9fe42ed549cc3b5b","mcp_get_code":{"code_sha256":"9fe42ed549cc3b5b"}},{"arxiv_id":"2307.00755","arxiv_id_is_arxiv":true,"paper":"/paper/graph-level-anomaly-detection-via","title":"Graph-level Anomaly Detection via Hierarchical Memory Networks","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niuchx/himnet","path":"train_tox.py","file_url":"https://github.com/niuchx/himnet/blob/HEAD/train_tox.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":"9c0b9d8409441cb6","code_sha256_prefix":"9c0b9d8409441cb6","mcp_get_code":{"code_sha256":"9c0b9d8409441cb6"}},{"arxiv_id":"2306.15902","arxiv_id_is_arxiv":true,"paper":"/paper/individual-and-structural-graph-information","title":"Individual and Structural Graph Information Bottlenecks for Out-of-Distribution Generalization","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/graphood","path":"run_train.py","file_url":"https://github.com/yangling0818/graphood/blob/HEAD/run_train.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, yangling0818/graphood when it was checked","code_sha256":"56e4ce91cbfb24e3","code_sha256_prefix":"56e4ce91cbfb24e3","mcp_get_code":{"code_sha256":"56e4ce91cbfb24e3"}},{"arxiv_id":"2306.10759","arxiv_id_is_arxiv":true,"paper":"/paper/simplifying-and-empowering-transformers-for-1","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/SGFormer","path":"100M/nb-sample.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/100M/nb-sample.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":"31388e2d020da353","code_sha256_prefix":"31388e2d020da353","mcp_get_code":{"code_sha256":"31388e2d020da353"}},{"arxiv_id":"2306.09623","arxiv_id_is_arxiv":true,"paper":"/paper/from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/HyperGCN","path":"model/model.py","file_url":"https://github.com/malllabiisc/HyperGCN/blob/HEAD/model/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":"9d023c0bc945b2bb","code_sha256_prefix":"9d023c0bc945b2bb","mcp_get_code":{"code_sha256":"9d023c0bc945b2bb"}},{"arxiv_id":"2306.09424","arxiv_id_is_arxiv":true,"paper":"/paper/ssl4eo-l-datasets-and-foundation-models-for-1","title":"SSL4EO-L: Datasets and Foundation Models for Landsat Imagery","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhu-xlab/ssl4eo-s12","path":"src/benchmark/pretrain_ssl/pretrain_moco_v2_s2c.py","file_url":"https://github.com/zhu-xlab/ssl4eo-s12/blob/HEAD/src/benchmark/pretrain_ssl/pretrain_moco_v2_s2c.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":"22e63e9ba09c6b88","code_sha256_prefix":"22e63e9ba09c6b88","mcp_get_code":{"code_sha256":"22e63e9ba09c6b88"}},{"arxiv_id":"2306.09424","arxiv_id_is_arxiv":true,"paper":"/paper/ssl4eo-l-datasets-and-foundation-models-for-1","title":"SSL4EO-L: Datasets and Foundation Models for Landsat Imagery","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhu-xlab/ssl4eo-s12","path":"src/benchmark/pretrain_ssl/pretrain_moco_v2_seco_ms.py","file_url":"https://github.com/zhu-xlab/ssl4eo-s12/blob/HEAD/src/benchmark/pretrain_ssl/pretrain_moco_v2_seco_ms.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":"d65aefdf2f95c196","code_sha256_prefix":"d65aefdf2f95c196","mcp_get_code":{"code_sha256":"d65aefdf2f95c196"}},{"arxiv_id":"2306.09264","arxiv_id_is_arxiv":true,"paper":"/paper/harvard-glaucoma-fairness-a-retinal-nerve","title":"Harvard Glaucoma Fairness: A Retinal Nerve Disease Dataset for Fairness Learning and Fair Identity Normalization","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luoyan407/harvard-gf","path":"train_glaucoma_fair.py","file_url":"https://github.com/luoyan407/harvard-gf/blob/HEAD/train_glaucoma_fair.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":"3052faa8b749b3be","code_sha256_prefix":"3052faa8b749b3be","mcp_get_code":{"code_sha256":"3052faa8b749b3be"}},{"arxiv_id":"2306.07758","arxiv_id_is_arxiv":true,"paper":"/paper/generated-graph-detection","title":"Generated Graph Detection","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yvonnemamama/ggd","path":"GraphCL.py","file_url":"https://github.com/yvonnemamama/ggd/blob/HEAD/GraphCL.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":"17d49558f559cb3d","code_sha256_prefix":"17d49558f559cb3d","mcp_get_code":{"code_sha256":"17d49558f559cb3d"}},{"arxiv_id":"2306.07483","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pietroastolfi/suave-daino","path":"suave/main_suave.py","file_url":"https://github.com/pietroastolfi/suave-daino/blob/HEAD/suave/main_suave.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, pietroastolfi/suave-daino (NOASSERTION)","code_sha256":"a15e23a392763e66","code_sha256_prefix":"a15e23a392763e66","mcp_get_code":{"code_sha256":"a15e23a392763e66"}},{"arxiv_id":"2306.06202","arxiv_id_is_arxiv":true,"paper":"/paper/neurograph-benchmarks-for-graph-machine","title":"NeuroGraph: Benchmarks for Graph Machine Learning in Brain Connectomics","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anwar-said/neurograph","path":"Dynamic/main-dynamic.py","file_url":"https://github.com/anwar-said/neurograph/blob/HEAD/Dynamic/main-dynamic.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":"6d750595d0ddf031","code_sha256_prefix":"6d750595d0ddf031","mcp_get_code":{"code_sha256":"6d750595d0ddf031"}},{"arxiv_id":"2306.05955","arxiv_id_is_arxiv":true,"paper":"/paper/path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gasmichel/pathnns_expressive","path":"TUDatasets/main_splits.py","file_url":"https://github.com/gasmichel/pathnns_expressive/blob/HEAD/TUDatasets/main_splits.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":"5b169d0b0c8ccb51","code_sha256_prefix":"5b169d0b0c8ccb51","mcp_get_code":{"code_sha256":"5b169d0b0c8ccb51"}},{"arxiv_id":"2306.05838","arxiv_id_is_arxiv":true,"paper":"/paper/expectation-complete-graph-representations","title":"Expectation-Complete Graph Representations with Homomorphisms","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ocatias/homcountgnns","path":"Exp/training_loop_functions.py","file_url":"https://github.com/ocatias/homcountgnns/blob/HEAD/Exp/training_loop_functions.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":"0bf4c377291fbef4","code_sha256_prefix":"0bf4c377291fbef4","mcp_get_code":{"code_sha256":"0bf4c377291fbef4"}},{"arxiv_id":"2306.05651","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-sharpness-aware","title":"Differentially Private Sharpness-Aware Training","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheSunWillRise/DPNAS","path":"dp_evaluate/train_utils.py","file_url":"https://github.com/TheSunWillRise/DPNAS/blob/HEAD/dp_evaluate/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":"d655d781dc686594","code_sha256_prefix":"d655d781dc686594","mcp_get_code":{"code_sha256":"d655d781dc686594"}},{"arxiv_id":"2306.05628","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-the-knowledge-in-gnns-for","title":"Quantifying the Knowledge in GNNs for Reliable Distillation into MLPs","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/rkd","path":"src/train_and_eval.py","file_url":"https://github.com/lirongwu/rkd/blob/HEAD/src/train_and_eval.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":"29faf1d5e00e0643","code_sha256_prefix":"29faf1d5e00e0643","mcp_get_code":{"code_sha256":"29faf1d5e00e0643"}},{"arxiv_id":"2305.19254","arxiv_id_is_arxiv":true,"paper":"/paper/what-can-we-learn-from-unlearnable-datasets-1","title":"What Can We Learn from Unlearnable Datasets?","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psandovalsegura/learn-from-unlearnable","path":"orthogonal_projection_step_2.py","file_url":"https://github.com/psandovalsegura/learn-from-unlearnable/blob/HEAD/orthogonal_projection_step_2.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, psandovalsegura/learn-from-unlearnable when it was checked","code_sha256":"e8cfe7fab2a6b0da","code_sha256_prefix":"e8cfe7fab2a6b0da","mcp_get_code":{"code_sha256":"e8cfe7fab2a6b0da"}},{"arxiv_id":"2305.18454","arxiv_id_is_arxiv":true,"paper":"/paper/pubchemqc-b3lyp-6-31g-pm6-dataset-the","title":"PubChemQC B3LYP/6-31G*//PM6 dataset: the Electronic Structures of 86 Million Molecules using B3LYP/6-31G* calculations","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prescient-design/nebula","path":"nebula/train_latent.py","file_url":"https://github.com/prescient-design/nebula/blob/HEAD/nebula/train_latent.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":"cad4f9234b43ce3b","code_sha256_prefix":"cad4f9234b43ce3b","mcp_get_code":{"code_sha256":"cad4f9234b43ce3b"}},{"arxiv_id":"2305.18454","arxiv_id_is_arxiv":true,"paper":"/paper/pubchemqc-b3lyp-6-31g-pm6-dataset-the","title":"PubChemQC B3LYP/6-31G*//PM6 dataset: the Electronic Structures of 86 Million Molecules using B3LYP/6-31G* calculations","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prescient-design/nebula","path":"nebula/train_vqvae.py","file_url":"https://github.com/prescient-design/nebula/blob/HEAD/nebula/train_vqvae.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":"e16f4e9e73e18001","code_sha256_prefix":"e16f4e9e73e18001","mcp_get_code":{"code_sha256":"e16f4e9e73e18001"}},{"arxiv_id":"2305.17007","arxiv_id_is_arxiv":true,"paper":"/paper/improving-knowledge-distillation-via-1","title":"Improving Knowledge Distillation via Regularizing Feature Norm and Direction","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangyz1608/knowledge-distillation-via-nd","path":"ImageNet/train_dkd.py","file_url":"https://github.com/wangyz1608/knowledge-distillation-via-nd/blob/HEAD/ImageNet/train_dkd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wangyz1608/knowledge-distillation-via-nd when it was checked","code_sha256":"15fc62159d2fc40a","code_sha256_prefix":"15fc62159d2fc40a","mcp_get_code":{"code_sha256":"15fc62159d2fc40a"}},{"arxiv_id":"2305.16618","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daehoum1/pcfi","path":"utils_link.py","file_url":"https://github.com/daehoum1/pcfi/blob/HEAD/utils_link.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":"40895c9e127bcae7","code_sha256_prefix":"40895c9e127bcae7","mcp_get_code":{"code_sha256":"40895c9e127bcae7"}},{"arxiv_id":"2305.15591","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-learner-for-shared-knowledge","title":"Lightweight Learner for Shared Knowledge Lifelong Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyhandy/shared-knowledge-lifelong-learning","path":"utils.py","file_url":"https://github.com/gyhandy/shared-knowledge-lifelong-learning/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e3826ed60e1594a","code_sha256_prefix":"7e3826ed60e1594a","mcp_get_code":{"code_sha256":"7e3826ed60e1594a"}},{"arxiv_id":"2305.15092","arxiv_id_is_arxiv":true,"paper":"/paper/fedzero-leveraging-renewable-excess-energy-in","title":"FedZero: Leveraging Renewable Excess Energy in Federated Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dos-group/fedzero","path":"fedzero/fl_client.py","file_url":"https://github.com/dos-group/fedzero/blob/HEAD/fedzero/fl_client.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":"f18aca6e44a4c590","code_sha256_prefix":"f18aca6e44a4c590","mcp_get_code":{"code_sha256":"f18aca6e44a4c590"}},{"arxiv_id":"2305.14947","arxiv_id_is_arxiv":true,"paper":"/paper/how-predictable-are-large-language-model","title":"How Predictable Are Large Language Model Capabilities? A Case Study on BIG-bench","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/predicting-big-bench","path":"code/models/mlp_models.py","file_url":"https://github.com/ink-usc/predicting-big-bench/blob/HEAD/code/models/mlp_models.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":"314ea4df358695cc","code_sha256_prefix":"314ea4df358695cc","mcp_get_code":{"code_sha256":"314ea4df358695cc"}},{"arxiv_id":"2305.11068","arxiv_id_is_arxiv":true,"paper":"/paper/orkg-leaderboards-a-systematic-workflow-for","title":"ORKG-Leaderboards: A Systematic Workflow for Mining Leaderboards as a Knowledge Graph","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kabongosalomon/task-dataset-metric-nli-extraction","path":"utils/helpers.py","file_url":"https://github.com/kabongosalomon/task-dataset-metric-nli-extraction/blob/HEAD/utils/helpers.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":"96b822af4f39d289","code_sha256_prefix":"96b822af4f39d289","mcp_get_code":{"code_sha256":"96b822af4f39d289"}},{"arxiv_id":"2305.10758","arxiv_id_is_arxiv":true,"paper":"/paper/extracting-low-high-frequency-knowledge-from","title":"Extracting Low-/High- Frequency Knowledge from Graph Neural Networks and Injecting it into MLPs: An Effective GNN-to-MLP Distillation Framework","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/ff-g2m","path":"src/train_and_eval.py","file_url":"https://github.com/lirongwu/ff-g2m/blob/HEAD/src/train_and_eval.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":"7b193dc76b1dbf3f","code_sha256_prefix":"7b193dc76b1dbf3f","mcp_get_code":{"code_sha256":"7b193dc76b1dbf3f"}},{"arxiv_id":"2305.09137","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-to-learn-in-context","title":"Pre-Training to Learn in Context","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/picl","path":"retriever.py","file_url":"https://github.com/thu-coai/picl/blob/HEAD/retriever.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":"175056e6e7c4fe4a","code_sha256_prefix":"175056e6e7c4fe4a","mcp_get_code":{"code_sha256":"175056e6e7c4fe4a"}},{"arxiv_id":"2305.07766","arxiv_id_is_arxiv":true,"paper":"/paper/nl2tl-transforming-natural-languages-to","title":"NL2TL: Transforming Natural Languages to Temporal Logics using Large Language Models","date":"2023-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongchao98/nl2tl","path":"Seq2seq_lifted_all.py","file_url":"https://github.com/yongchao98/nl2tl/blob/HEAD/Seq2seq_lifted_all.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, yongchao98/nl2tl when it was checked","code_sha256":"9387acc0db57213e","code_sha256_prefix":"9387acc0db57213e","mcp_get_code":{"code_sha256":"9387acc0db57213e"}},{"arxiv_id":"2305.04963","arxiv_id_is_arxiv":true,"paper":"/paper/from-relational-pooling-to-subgraph-gnns-a","title":"From Relational Pooling to Subgraph GNNs: A Universal Framework for More Expressive Graph Neural Networks","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/KLGNN","path":"OGB/molhiv.py","file_url":"https://github.com/zhouc20/KLGNN/blob/HEAD/OGB/molhiv.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":"bc15613c664952e7","code_sha256_prefix":"bc15613c664952e7","mcp_get_code":{"code_sha256":"bc15613c664952e7"}},{"arxiv_id":"2305.04792","arxiv_id_is_arxiv":true,"paper":"/paper/global-update-tracking-a-decentralized-1","title":"Global Update Tracking: A Decentralized Learning Algorithm for Heterogeneous Data","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aparna-aketi/global_update_tracking","path":"trainer.py","file_url":"https://github.com/aparna-aketi/global_update_tracking/blob/HEAD/trainer.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, aparna-aketi/global_update_tracking when it was checked","code_sha256":"bfb904fa5af57448","code_sha256_prefix":"bfb904fa5af57448","mcp_get_code":{"code_sha256":"bfb904fa5af57448"}},{"arxiv_id":"2305.01638","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-modeling-with-multiresolution","title":"Sequence Modeling with Multiresolution Convolutional Memory","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thjashin/multires-conv","path":"classification.py","file_url":"https://github.com/thjashin/multires-conv/blob/HEAD/classification.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":"6bde61fec84781de","code_sha256_prefix":"6bde61fec84781de","mcp_get_code":{"code_sha256":"6bde61fec84781de"}},{"arxiv_id":"2305.01638","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-modeling-with-multiresolution","title":"Sequence Modeling with Multiresolution Convolutional Memory","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thjashin/multires-conv","path":"autoregressive.py","file_url":"https://github.com/thjashin/multires-conv/blob/HEAD/autoregressive.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":"ad628a83df7e160a","code_sha256_prefix":"ad628a83df7e160a","mcp_get_code":{"code_sha256":"ad628a83df7e160a"}},{"arxiv_id":"2304.13098","arxiv_id_is_arxiv":true,"paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"main_ann.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/main_ann.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":"a25ba18da07f26f4","code_sha256_prefix":"a25ba18da07f26f4","mcp_get_code":{"code_sha256":"a25ba18da07f26f4"}},{"arxiv_id":"2304.09172","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-image-text-representations","title":"Hyperbolic Image-Text Representations","date":"2023-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/slip","path":"main_linear.py","file_url":"https://github.com/facebookresearch/slip/blob/HEAD/main_linear.py","status":"ran","verification_level":1,"contract_check":null,"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, facebookresearch/slip, 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":"9c147228c1764edd","code_sha256_prefix":"9c147228c1764edd","mcp_get_code":{"code_sha256":"9c147228c1764edd"}},{"arxiv_id":"2304.05206","arxiv_id_is_arxiv":true,"paper":"/paper/the-capacity-and-robustness-trade-off","title":"The Capacity and Robustness Trade-off: Revisiting the Channel Independent Strategy for Multivariate Time Series Forecasting","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanlu-nju/channel_independent_mtsf","path":"layers/utils.py","file_url":"https://github.com/hanlu-nju/channel_independent_mtsf/blob/HEAD/layers/utils.py","status":"unverified","verification_level":0,"contract_check":null,"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, hanlu-nju/channel_independent_mtsf, 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":"6a37a43acaf3b4b1","code_sha256_prefix":"6a37a43acaf3b4b1","mcp_get_code":{"code_sha256":"6a37a43acaf3b4b1"}},{"arxiv_id":"2304.02806","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2304.02806","date":null,"month_inferred_from_arxiv_id":"2023-04","title_source":null,"repo":"VITA-Group/Graph-Mixture-of-Experts","path":"linkproppred/ddi/mf.py","file_url":"https://github.com/VITA-Group/Graph-Mixture-of-Experts/blob/HEAD/linkproppred/ddi/mf.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":"f16657ebb44f3006","code_sha256_prefix":"f16657ebb44f3006","mcp_get_code":{"code_sha256":"f16657ebb44f3006"}},{"arxiv_id":"2304.02806","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2304.02806","date":null,"month_inferred_from_arxiv_id":"2023-04","title_source":null,"repo":"VITA-Group/Graph-Mixture-of-Experts","path":"linkproppred/ddi/gnn.py","file_url":"https://github.com/VITA-Group/Graph-Mixture-of-Experts/blob/HEAD/linkproppred/ddi/gnn.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":"498a3c27be62098b","code_sha256_prefix":"498a3c27be62098b","mcp_get_code":{"code_sha256":"498a3c27be62098b"}},{"arxiv_id":"2304.00216","arxiv_id_is_arxiv":true,"paper":"/paper/cross-scale-multi-instance-learning-for","title":"Cross-scale Multi-instance Learning for Pathological Image Diagnosis","date":"2023-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrlblab/cs-mil","path":"Train_Test_Code/MIL_global_Stage1_Training.py","file_url":"https://github.com/hrlblab/cs-mil/blob/HEAD/Train_Test_Code/MIL_global_Stage1_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":"2f5afa2e94406318","code_sha256_prefix":"2f5afa2e94406318","mcp_get_code":{"code_sha256":"2f5afa2e94406318"}},{"arxiv_id":"2303.15180","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-backdoors-in-pre-trained-encoders","title":"Detecting Backdoors in Pre-trained Encoders","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7c0b8c4203703d28","code_sha256_prefix":"7c0b8c4203703d28","mcp_get_code":{"code_sha256":"7c0b8c4203703d28"}},{"arxiv_id":"2303.14666","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-matters-loss-minima-flattening","title":"Generalization Matters: Loss Minima Flattening via Parameter Hybridization for Efficient Online Knowledge Distillation","date":"2023-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianlizhang/OKDPH","path":"src/OKDPH.py","file_url":"https://github.com/tianlizhang/OKDPH/blob/HEAD/src/OKDPH.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, tianlizhang/OKDPH when it was checked","code_sha256":"0958a4ac84d6a974","code_sha256_prefix":"0958a4ac84d6a974","mcp_get_code":{"code_sha256":"0958a4ac84d6a974"}},{"arxiv_id":"2303.13664","arxiv_id_is_arxiv":true,"paper":"/paper/temperature-schedules-for-self-supervised","title":"Temperature Schedules for Self-Supervised Contrastive Methods on Long-Tail Data","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"annusha/temperature_schedules","path":"train_simCLR.py","file_url":"https://github.com/annusha/temperature_schedules/blob/HEAD/train_simCLR.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, annusha/temperature_schedules when it was checked","code_sha256":"8a259e4e753158d7","code_sha256_prefix":"8a259e4e753158d7","mcp_get_code":{"code_sha256":"8a259e4e753158d7"}},{"arxiv_id":"2303.10455","arxiv_id_is_arxiv":true,"paper":"/paper/learn-unlearn-and-relearn-an-online-learning","title":"Learn, Unlearn and Relearn: An Online Learning Paradigm for Deep Neural Networks","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/lure","path":"ALMA.py","file_url":"https://github.com/neurai-lab/lure/blob/HEAD/ALMA.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":"c101adc56d97d818","code_sha256_prefix":"c101adc56d97d818","mcp_get_code":{"code_sha256":"c101adc56d97d818"}},{"arxiv_id":"2303.09778","arxiv_id_is_arxiv":true,"paper":"/paper/se-gsl-a-general-and-effective-graph","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/se-gsl","path":"src/appnp_main.py","file_url":"https://github.com/ringbdstack/se-gsl/blob/HEAD/src/appnp_main.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, ringbdstack/se-gsl when it was checked","code_sha256":"c41dbdf5cf9e65ed","code_sha256_prefix":"c41dbdf5cf9e65ed","mcp_get_code":{"code_sha256":"c41dbdf5cf9e65ed"}},{"arxiv_id":"2303.09165","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-benchmark-on-the-utility-of-synthetic","title":"A New Benchmark: On the Utility of Synthetic Data with Blender for Bare Supervised Learning and Downstream Domain Adaptation","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huitangtang/on_the_utility_of_synthetic_data","path":"domain_adaptation/DANN/trainer.py","file_url":"https://github.com/huitangtang/on_the_utility_of_synthetic_data/blob/HEAD/domain_adaptation/DANN/trainer.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":"a63b80aa6e20d75f","code_sha256_prefix":"a63b80aa6e20d75f","mcp_get_code":{"code_sha256":"a63b80aa6e20d75f"}},{"arxiv_id":"2303.01289","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-effect-of-data-augmentation-in","title":"Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learning","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-ml/dynacl","path":"train_DynACL.py","file_url":"https://github.com/pku-ml/dynacl/blob/HEAD/train_DynACL.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, pku-ml/dynacl when it was checked","code_sha256":"71d7a5fe7208bd5b","code_sha256_prefix":"71d7a5fe7208bd5b","mcp_get_code":{"code_sha256":"71d7a5fe7208bd5b"}},{"arxiv_id":"2303.01289","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-effect-of-data-augmentation-in","title":"Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learning","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-ml/dynacl","path":"LPAFT.py","file_url":"https://github.com/pku-ml/dynacl/blob/HEAD/LPAFT.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, pku-ml/dynacl when it was checked","code_sha256":"21ded214fa0c58f4","code_sha256_prefix":"21ded214fa0c58f4","mcp_get_code":{"code_sha256":"21ded214fa0c58f4"}},{"arxiv_id":"2303.01289","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-effect-of-data-augmentation-in","title":"Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learning","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-ml/dynacl","path":"LPAFT_AFF.py","file_url":"https://github.com/pku-ml/dynacl/blob/HEAD/LPAFT_AFF.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, pku-ml/dynacl when it was checked","code_sha256":"adfc6498df48c365","code_sha256_prefix":"adfc6498df48c365","mcp_get_code":{"code_sha256":"adfc6498df48c365"}},{"arxiv_id":"2303.01289","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-effect-of-data-augmentation-in","title":"Rethinking the Effect of Data Augmentation in Adversarial Contrastive Learning","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-ml/dynacl","path":"train_DynACL.py","file_url":"https://github.com/pku-ml/dynacl/blob/HEAD/train_DynACL.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, pku-ml/dynacl when it was checked","code_sha256":"86a8813c1ea89045","code_sha256_prefix":"86a8813c1ea89045","mcp_get_code":{"code_sha256":"86a8813c1ea89045"}},{"arxiv_id":"2302.10906","arxiv_id_is_arxiv":true,"paper":"/paper/deep-neural-networks-for-encrypted-inference","title":"Deep Neural Networks for Encrypted Inference with TFHE","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zama-ai/concrete-ml","path":"use_case_examples/cifar/cifar_brevitas_finetuning/cifar_utils.py","file_url":"https://github.com/zama-ai/concrete-ml/blob/HEAD/use_case_examples/cifar/cifar_brevitas_finetuning/cifar_utils.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, zama-ai/concrete-ml (NOASSERTION)","code_sha256":"292cfbcfee9ee087","code_sha256_prefix":"292cfbcfee9ee087","mcp_get_code":{"code_sha256":"292cfbcfee9ee087"}},{"arxiv_id":"2302.08466","arxiv_id_is_arxiv":true,"paper":"/paper/marich-a-query-efficient-distributionally","title":"Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debabrota-basu/marich","path":"lr_cnn_res_marich/utils.py","file_url":"https://github.com/debabrota-basu/marich/blob/HEAD/lr_cnn_res_marich/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":"9454ce73b63ebd3e","code_sha256_prefix":"9454ce73b63ebd3e","mcp_get_code":{"code_sha256":"9454ce73b63ebd3e"}},{"arxiv_id":"2302.08048","arxiv_id_is_arxiv":true,"paper":"/paper/robust-mid-pass-filtering-graph-convolutional","title":"Robust Mid-Pass Filtering Graph Convolutional Networks","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangJC0429/Mid-GCN","path":"mid_pass_GCN/main_meta.py","file_url":"https://github.com/huangJC0429/Mid-GCN/blob/HEAD/mid_pass_GCN/main_meta.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, huangJC0429/Mid-GCN when it was checked","code_sha256":"2f596f081eb639c4","code_sha256_prefix":"2f596f081eb639c4","mcp_get_code":{"code_sha256":"2f596f081eb639c4"}},{"arxiv_id":"2302.05783","arxiv_id_is_arxiv":true,"paper":"/paper/concernet-a-contrastive-learning-based","title":"ConCerNet: A Contrastive Learning Based Framework for Automated Conservation Law Discovery and Trustworthy Dynamical System Prediction","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wz16/concernet","path":"train_dynamics.py","file_url":"https://github.com/wz16/concernet/blob/HEAD/train_dynamics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27532e4f2baa8924","code_sha256_prefix":"27532e4f2baa8924","mcp_get_code":{"code_sha256":"27532e4f2baa8924"}},{"arxiv_id":"2302.02503","arxiv_id_is_arxiv":true,"paper":"/paper/leaving-reality-to-imagination-robust","title":"Leaving Reality to Imagination: Robust Classification via Generated Datasets","date":"2023-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hritikbansal/generative-robustness","path":"generation/DeepAugment/train_noise2net.py","file_url":"https://github.com/hritikbansal/generative-robustness/blob/HEAD/generation/DeepAugment/train_noise2net.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":"7734eabc3b7c8b24","code_sha256_prefix":"7734eabc3b7c8b24","mcp_get_code":{"code_sha256":"7734eabc3b7c8b24"}},{"arxiv_id":"2302.00873","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-the-silent-majority-on-graphs","title":"Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wendongbi/KT-GNN","path":"KT-GNN/main_twitter.py","file_url":"https://github.com/wendongbi/KT-GNN/blob/HEAD/KT-GNN/main_twitter.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"106bd1b3345b702a","code_sha256_prefix":"106bd1b3345b702a","mcp_get_code":{"code_sha256":"106bd1b3345b702a"}},{"arxiv_id":"2301.13616","arxiv_id_is_arxiv":true,"paper":"/paper/anti-exploration-by-random-network","title":"Anti-Exploration by Random Network Distillation","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shidilrzf/anti-exploration-rl","path":"examples/train_ae.py","file_url":"https://github.com/shidilrzf/anti-exploration-rl/blob/HEAD/examples/train_ae.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":"226a9594f55e107f","code_sha256_prefix":"226a9594f55e107f","mcp_get_code":{"code_sha256":"226a9594f55e107f"}},{"arxiv_id":"2301.12314","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-prompts-continual-learning-for","title":"Progressive Prompts: Continual Learning for Language Models","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arazd/ProgressivePrompts","path":"T5_codebase/train_prompt.py","file_url":"https://github.com/arazd/ProgressivePrompts/blob/HEAD/T5_codebase/train_prompt.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":"b8920b9ed536a3c7","code_sha256_prefix":"b8920b9ed536a3c7","mcp_get_code":{"code_sha256":"b8920b9ed536a3c7"}},{"arxiv_id":"2212.09840","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-sparse-network-for-time-series","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QiaoXiao7282/DSN","path":"trainer_DSN.py","file_url":"https://github.com/QiaoXiao7282/DSN/blob/HEAD/trainer_DSN.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, QiaoXiao7282/DSN when it was checked","code_sha256":"0092f316e0222026","code_sha256_prefix":"0092f316e0222026","mcp_get_code":{"code_sha256":"0092f316e0222026"}},{"arxiv_id":"2212.04461","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-unlabeled-data-to-track","title":"Leveraging Unlabeled Data to Track Memorization","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahf93/tracking-memorization","path":"experiments.py","file_url":"https://github.com/mahf93/tracking-memorization/blob/HEAD/experiments.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, mahf93/tracking-memorization when it was checked","code_sha256":"350f87402300b96d","code_sha256_prefix":"350f87402300b96d","mcp_get_code":{"code_sha256":"350f87402300b96d"}},{"arxiv_id":"2211.12979","arxiv_id_is_arxiv":true,"paper":"/paper/flair-1-semantic-segmentation-and-domain","title":"FLAIR #1: semantic segmentation and domain adaptation dataset","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IGNF/FLAIR-1-AI-Challenge","path":"src/flair/tasks.py","file_url":"https://github.com/IGNF/FLAIR-1-AI-Challenge/blob/HEAD/src/flair/tasks.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":"a583fc74263240ea","code_sha256_prefix":"a583fc74263240ea","mcp_get_code":{"code_sha256":"a583fc74263240ea"}},{"arxiv_id":"2211.09912","arxiv_id_is_arxiv":true,"paper":"/paper/do-graph-neural-networks-learn-traditional","title":"Do graph neural networks learn traditional jet substructure?","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"farakiko/xai4hep","path":"xai4hep/particlenet/run_training.py","file_url":"https://github.com/farakiko/xai4hep/blob/HEAD/xai4hep/particlenet/run_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":"cf3c8bc0d441f955","code_sha256_prefix":"cf3c8bc0d441f955","mcp_get_code":{"code_sha256":"cf3c8bc0d441f955"}},{"arxiv_id":"2211.04774","arxiv_id_is_arxiv":true,"paper":"/paper/arnet-automatic-refinement-network-for-noisy","title":"IRNet: Iterative Refinement Network for Noisy Partial Label Learning","date":"2022-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeroqiaoba/irnet","path":"irnet/train_merge.py","file_url":"https://github.com/zeroqiaoba/irnet/blob/HEAD/irnet/train_merge.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, zeroqiaoba/irnet when it was checked","code_sha256":"2b6e6a84361d801e","code_sha256_prefix":"2b6e6a84361d801e","mcp_get_code":{"code_sha256":"2b6e6a84361d801e"}},{"arxiv_id":"2211.03231","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-community-detection","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","date":"2022-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/gnn_community_detection","path":"sparsify.py","file_url":"https://github.com/nhuang37/gnn_community_detection/blob/HEAD/sparsify.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nhuang37/gnn_community_detection when it was checked","code_sha256":"195b693cc6804e22","code_sha256_prefix":"195b693cc6804e22","mcp_get_code":{"code_sha256":"195b693cc6804e22"}},{"arxiv_id":"2210.14650","arxiv_id_is_arxiv":true,"paper":"/paper/mocha-a-multi-task-training-approach-for","title":"MOCHA: A Multi-Task Training Approach for Coherent Text Generation from Cognitive Perspective","date":"2022-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Derekkk/Mocha-EMNLP22","path":"finetune_generation_pipeline.py","file_url":"https://github.com/Derekkk/Mocha-EMNLP22/blob/HEAD/finetune_generation_pipeline.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, Derekkk/Mocha-EMNLP22 when it was checked","code_sha256":"25484709c7713e13","code_sha256_prefix":"25484709c7713e13","mcp_get_code":{"code_sha256":"25484709c7713e13"}},{"arxiv_id":"2210.12651","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-non-transferable-text","title":"Unsupervised Non-transferable Text Classification","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoscodes/untl","path":"UNTL.py","file_url":"https://github.com/chaoscodes/untl/blob/HEAD/UNTL.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":"f28f4ceb41868d8b","code_sha256_prefix":"f28f4ceb41868d8b","mcp_get_code":{"code_sha256":"f28f4ceb41868d8b"}},{"arxiv_id":"2210.09521","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-progressively-expressive-gnn","title":"A Practical, Progressively-Expressive GNN","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LingxiaoShawn/KCSetGNN","path":"train/zinc.py","file_url":"https://github.com/LingxiaoShawn/KCSetGNN/blob/HEAD/train/zinc.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":"c0fb1d8b5fa83a91","code_sha256_prefix":"c0fb1d8b5fa83a91","mcp_get_code":{"code_sha256":"c0fb1d8b5fa83a91"}},{"arxiv_id":"2210.06464","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-querying-for-autoregressive-neural","title":"Predictive Querying for Autoregressive Neural Sequence Models","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajboyd2/prob_seq_queries","path":"scripts/train/amazon.py","file_url":"https://github.com/ajboyd2/prob_seq_queries/blob/HEAD/scripts/train/amazon.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":"d5586c4a77b49699","code_sha256_prefix":"d5586c4a77b49699","mcp_get_code":{"code_sha256":"d5586c4a77b49699"}},{"arxiv_id":"2210.05782","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-guided-importance-sampling-for-1","title":"Gradient-Guided Importance Sampling for Learning Binary Energy-Based Models","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/rmwggis","path":"RMwGGIS/main_ggis_synthetic.py","file_url":"https://github.com/divelab/rmwggis/blob/HEAD/RMwGGIS/main_ggis_synthetic.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, divelab/rmwggis when it was checked","code_sha256":"98ad0f4bdf9cfea3","code_sha256_prefix":"98ad0f4bdf9cfea3","mcp_get_code":{"code_sha256":"98ad0f4bdf9cfea3"}},{"arxiv_id":"2210.04092","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-model-pruning-via-bi-level","title":"Advancing Model Pruning via Bi-level Optimization","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/bip","path":"trainer/bilevel.py","file_url":"https://github.com/optml-group/bip/blob/HEAD/trainer/bilevel.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, optml-group/bip when it was checked","code_sha256":"9e1301e5ca5aa8c5","code_sha256_prefix":"9e1301e5ca5aa8c5","mcp_get_code":{"code_sha256":"9e1301e5ca5aa8c5"}},{"arxiv_id":"2209.11628","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-model-for-regular-grammar-induction","title":"A Neural Model for Regular Grammar Induction","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbelcak/neregrain","path":"curriculum.py","file_url":"https://github.com/pbelcak/neregrain/blob/HEAD/curriculum.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":"6d9192f2b828c7f6","code_sha256_prefix":"6d9192f2b828c7f6","mcp_get_code":{"code_sha256":"6d9192f2b828c7f6"}},{"arxiv_id":"2209.04882","arxiv_id_is_arxiv":true,"paper":"/paper/statistical-mechanics-of-deep-learning-beyond","title":"A statistical mechanics framework for Bayesian deep neural networks beyond the infinite-width limit","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"rpacelli/fc_deep_bayesian_networks","path":"utils.py","file_url":"https://github.com/rpacelli/fc_deep_bayesian_networks/blob/HEAD/utils.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":"3a5c5b3ec170bafa","code_sha256_prefix":"3a5c5b3ec170bafa","mcp_get_code":{"code_sha256":"3a5c5b3ec170bafa"}},{"arxiv_id":"2209.03473","arxiv_id_is_arxiv":true,"paper":"/paper/higher-order-clustering-and-pooling-for-graph","title":"Higher-order Clustering and Pooling for Graph Neural Networks","date":"2022-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexduvalinho/hoscpool","path":"example.py","file_url":"https://github.com/alexduvalinho/hoscpool/blob/HEAD/example.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":"526947f58a277cda","code_sha256_prefix":"526947f58a277cda","mcp_get_code":{"code_sha256":"526947f58a277cda"}},{"arxiv_id":"2209.01307","arxiv_id_is_arxiv":true,"paper":"/paper/transpolymer-a-transformer-based-language","title":"TransPolymer: a Transformer-based language model for polymer property predictions","date":"2022-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChangwenXu98/TransPolymer","path":"Downstream.py","file_url":"https://github.com/ChangwenXu98/TransPolymer/blob/HEAD/Downstream.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":"df54a10db04a98c0","code_sha256_prefix":"df54a10db04a98c0","mcp_get_code":{"code_sha256":"df54a10db04a98c0"}},{"arxiv_id":"2209.06015","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-ownership-verification-for-dataset","title":"Black-box Dataset Ownership Verification via Backdoor Watermarking","date":"2022-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuyimingli/dvbw","path":"Sub-ImageNet/train_watermarked.py","file_url":"https://github.com/thuyimingli/dvbw/blob/HEAD/Sub-ImageNet/train_watermarked.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":"b86caea9f9c07f90","code_sha256_prefix":"b86caea9f9c07f90","mcp_get_code":{"code_sha256":"b86caea9f9c07f90"}},{"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/pretrain.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/pretrain.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":"70dfd49412a04d63","code_sha256_prefix":"70dfd49412a04d63","mcp_get_code":{"code_sha256":"70dfd49412a04d63"}},{"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/train_baseline.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/train_baseline.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":"13a767c65a8c43dc","code_sha256_prefix":"13a767c65a8c43dc","mcp_get_code":{"code_sha256":"13a767c65a8c43dc"}},{"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/train_baseline_distill_gen_1_single.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/train_baseline_distill_gen_1_single.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":"3f5fdeef3bc69b20","code_sha256_prefix":"3f5fdeef3bc69b20","mcp_get_code":{"code_sha256":"3f5fdeef3bc69b20"}},{"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/train_backbone_multi_head.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/train_backbone_multi_head.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":"5e9c3538626f0f95","code_sha256_prefix":"5e9c3538626f0f95","mcp_get_code":{"code_sha256":"5e9c3538626f0f95"}},{"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/train_baseline_distill_gen_1_multi.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/train_baseline_distill_gen_1_multi.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":"6122e3f1a549c175","code_sha256_prefix":"6122e3f1a549c175","mcp_get_code":{"code_sha256":"6122e3f1a549c175"}},{"arxiv_id":"2208.04609","arxiv_id_is_arxiv":true,"paper":"/paper/e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuanh23/e2eg","path":"baseline_models/gnn.py","file_url":"https://github.com/tuanh23/e2eg/blob/HEAD/baseline_models/gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82f54a95d4951b19","code_sha256_prefix":"82f54a95d4951b19","mcp_get_code":{"code_sha256":"82f54a95d4951b19"}},{"arxiv_id":"2208.04609","arxiv_id_is_arxiv":true,"paper":"/paper/e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuanh23/e2eg","path":"baseline_models/mlp.py","file_url":"https://github.com/tuanh23/e2eg/blob/HEAD/baseline_models/mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CUAI/CorrectAndSmooth, and GitHub detected no licence in that repository when it was checked","code_sha256":"fac9425843013f50","code_sha256_prefix":"fac9425843013f50","mcp_get_code":{"code_sha256":"fac9425843013f50"}},{"arxiv_id":"2208.03873","arxiv_id_is_arxiv":true,"paper":"/paper/chexrelnet-an-anatomy-aware-model-for","title":"CheXRelNet: An Anatomy-Aware Model for Tracking Longitudinal Relationships between Chest X-Rays","date":"2022-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plan-lab/chexrelnet","path":"src/train_baselines.py","file_url":"https://github.com/plan-lab/chexrelnet/blob/HEAD/src/train_baselines.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":"b6355468d3b9b3be","code_sha256_prefix":"b6355468d3b9b3be","mcp_get_code":{"code_sha256":"b6355468d3b9b3be"}},{"arxiv_id":"2208.01462","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-deep-super-resolution-for","title":"Physics-informed Deep Super-resolution for Spatiotemporal Data","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulpuren/physr","path":"Ablation/2DGS[no_phy_loss].py","file_url":"https://github.com/paulpuren/physr/blob/HEAD/Ablation/2DGS%5Bno_phy_loss%5D.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":"ce8717d8e0064f87","code_sha256_prefix":"ce8717d8e0064f87","mcp_get_code":{"code_sha256":"ce8717d8e0064f87"}},{"arxiv_id":"2208.01462","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-deep-super-resolution-for","title":"Physics-informed Deep Super-resolution for Spatiotemporal Data","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulpuren/physr","path":"Ablation/2DGS[no_convlstm].py","file_url":"https://github.com/paulpuren/physr/blob/HEAD/Ablation/2DGS%5Bno_convlstm%5D.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":"16c1dc634664a934","code_sha256_prefix":"16c1dc634664a934","mcp_get_code":{"code_sha256":"16c1dc634664a934"}},{"arxiv_id":"2208.01462","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-deep-super-resolution-for","title":"Physics-informed Deep Super-resolution for Spatiotemporal Data","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulpuren/physr","path":"Code/2DGS.py","file_url":"https://github.com/paulpuren/physr/blob/HEAD/Code/2DGS.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":"706163c796a494dd","code_sha256_prefix":"706163c796a494dd","mcp_get_code":{"code_sha256":"706163c796a494dd"}},{"arxiv_id":"2208.01462","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-deep-super-resolution-for","title":"Physics-informed Deep Super-resolution for Spatiotemporal Data","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulpuren/physr","path":"Code/2DRB.py","file_url":"https://github.com/paulpuren/physr/blob/HEAD/Code/2DRB.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":"7f6cc40fc108a234","code_sha256_prefix":"7f6cc40fc108a234","mcp_get_code":{"code_sha256":"7f6cc40fc108a234"}},{"arxiv_id":"2208.01230","arxiv_id_is_arxiv":true,"paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"data_generation/uw/dpgan.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/data_generation/uw/dpgan.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":"adeb9d566a32b488","code_sha256_prefix":"adeb9d566a32b488","mcp_get_code":{"code_sha256":"adeb9d566a32b488"}},{"arxiv_id":"2208.01230","arxiv_id_is_arxiv":true,"paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"data_generation/uw/emrwgan.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/data_generation/uw/emrwgan.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":"501819ee8cd9f4a4","code_sha256_prefix":"501819ee8cd9f4a4","mcp_get_code":{"code_sha256":"501819ee8cd9f4a4"}},{"arxiv_id":"2207.13880","arxiv_id_is_arxiv":true,"paper":"/paper/towards-overcoming-data-scarcity-in-materials","title":"Towards overcoming data scarcity in materials science: unifying models and datasets with a mixture of experts framework","date":null,"month_inferred_from_arxiv_id":"2022-07","title_source":"archive","repo":"rees-c/moe","path":"main_singletask.py","file_url":"https://github.com/rees-c/moe/blob/HEAD/main_singletask.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":"fbcee255151efc7d","code_sha256_prefix":"fbcee255151efc7d","mcp_get_code":{"code_sha256":"fbcee255151efc7d"}},{"arxiv_id":"2207.10888","arxiv_id_is_arxiv":true,"paper":"/paper/fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bernardo1998/FairGRAPE","path":"train_and_val.py","file_url":"https://github.com/Bernardo1998/FairGRAPE/blob/HEAD/train_and_val.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":"f119042034963ae6","code_sha256_prefix":"f119042034963ae6","mcp_get_code":{"code_sha256":"f119042034963ae6"}},{"arxiv_id":"2207.10023","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-self-supervision-for-supervised","title":"Tailoring Self-Supervision for Supervised Learning","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjun0830/Localizable-Rotation","path":"Imbalanced/cifar_train_lorot-E.py","file_url":"https://github.com/wjun0830/Localizable-Rotation/blob/HEAD/Imbalanced/cifar_train_lorot-E.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":"ec34cd8d4a422a45","code_sha256_prefix":"ec34cd8d4a422a45","mcp_get_code":{"code_sha256":"ec34cd8d4a422a45"}},{"arxiv_id":"2207.09510","arxiv_id_is_arxiv":true,"paper":"/paper/contributions-of-shape-texture-and-color-in","title":"Contributions of Shape, Texture, and Color in Visual Recognition","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyhandy/humanoid-vision-engine","path":"Zero_shot/cross_modality_two_latents.py","file_url":"https://github.com/gyhandy/humanoid-vision-engine/blob/HEAD/Zero_shot/cross_modality_two_latents.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":"e6fe8a84c5113f3c","code_sha256_prefix":"e6fe8a84c5113f3c","mcp_get_code":{"code_sha256":"e6fe8a84c5113f3c"}},{"arxiv_id":"2207.07972","arxiv_id_is_arxiv":true,"paper":"/paper/certified-neural-network-watermarks-with","title":"Certified Neural Network Watermarks with Randomized Smoothing","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arpitbansal297/certified_watermarks","path":"cifar10.py","file_url":"https://github.com/arpitbansal297/certified_watermarks/blob/HEAD/cifar10.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, arpitbansal297/certified_watermarks when it was checked","code_sha256":"c941e2cba771fba3","code_sha256_prefix":"c941e2cba771fba3","mcp_get_code":{"code_sha256":"c941e2cba771fba3"}},{"arxiv_id":"2207.04606","arxiv_id_is_arxiv":true,"paper":"/paper/sparsetir-composable-abstractions-for-sparse","title":"SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning","date":"2022-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uwsampl/sparsetir-artifact","path":"e2e/sage_dgl.py","file_url":"https://github.com/uwsampl/sparsetir-artifact/blob/HEAD/e2e/sage_dgl.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":"a63b4fca51872597","code_sha256_prefix":"a63b4fca51872597","mcp_get_code":{"code_sha256":"a63b4fca51872597"}},{"arxiv_id":"2207.03574","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-the-adversarial-robustness-of-1","title":"Demystifying the Adversarial Robustness of Random Transformation Defenses","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wagner-group/demystify-random-transform","path":"train_bpda.py","file_url":"https://github.com/wagner-group/demystify-random-transform/blob/HEAD/train_bpda.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":"95155e6a7662dd5b","code_sha256_prefix":"95155e6a7662dd5b","mcp_get_code":{"code_sha256":"95155e6a7662dd5b"}},{"arxiv_id":"2206.14607","arxiv_id_is_arxiv":true,"paper":"/paper/nerda-con-extending-ner-models-for-continual","title":"NERDA-Con: Extending NER models for Continual Learning -- Integrating Distinct Tasks and Updating Distribution Shifts","date":"2022-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"supritivijay/nerda-con","path":"src/NERDA_Con/training.py","file_url":"https://github.com/supritivijay/nerda-con/blob/HEAD/src/NERDA_Con/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":"882483945b529f0b","code_sha256_prefix":"882483945b529f0b","mcp_get_code":{"code_sha256":"882483945b529f0b"}},{"arxiv_id":"2206.14532","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-label-smoothing-and-knowledge","title":"Revisiting Label Smoothing and Knowledge Distillation Compatibility: What was Missing?","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sutd-visual-computing-group/LS-KD-compatibility","path":"src/image_classification/cub/train_student.py","file_url":"https://github.com/sutd-visual-computing-group/LS-KD-compatibility/blob/HEAD/src/image_classification/cub/train_student.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":"2a0d7e917240db2a","code_sha256_prefix":"2a0d7e917240db2a","mcp_get_code":{"code_sha256":"2a0d7e917240db2a"}},{"arxiv_id":"2206.12088","arxiv_id_is_arxiv":true,"paper":"/paper/classifying-unstructured-clinical-notes-via","title":"Classifying Unstructured Clinical Notes via Automatic Weak Supervision","date":"2022-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonlab/KeyClass","path":"keyclass/train_classifier.py","file_url":"https://github.com/autonlab/KeyClass/blob/HEAD/keyclass/train_classifier.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":"e5a3acc3722b593e","code_sha256_prefix":"e5a3acc3722b593e","mcp_get_code":{"code_sha256":"e5a3acc3722b593e"}},{"arxiv_id":"2206.11053","arxiv_id_is_arxiv":true,"paper":"/paper/surgical-vqa-visual-question-answering-in","title":"Surgical-VQA: Visual Question Answering in Surgical Scenes using Transformer","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lalithjets/surgical_vqa","path":"train_classification.py","file_url":"https://github.com/lalithjets/surgical_vqa/blob/HEAD/train_classification.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, lalithjets/surgical_vqa when it was checked","code_sha256":"946e5283527c275f","code_sha256_prefix":"946e5283527c275f","mcp_get_code":{"code_sha256":"946e5283527c275f"}},{"arxiv_id":"2206.11010","arxiv_id_is_arxiv":true,"paper":"/paper/agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nokpil/AgentNet","path":"train/AOUP_train.py","file_url":"https://github.com/nokpil/AgentNet/blob/HEAD/train/AOUP_train.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":"82d777283362729c","code_sha256_prefix":"82d777283362729c","mcp_get_code":{"code_sha256":"82d777283362729c"}},{"arxiv_id":"2206.07387","arxiv_id_is_arxiv":true,"paper":"/paper/the-manifold-hypothesis-for-gradient-based-1","title":"The Manifold Hypothesis for Gradient-Based Explanations","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tml-tuebingen/explanations-manifold","path":"replicate-paper/mnist/util.py","file_url":"https://github.com/tml-tuebingen/explanations-manifold/blob/HEAD/replicate-paper/mnist/util.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":"1e7c4e327e3bd486","code_sha256_prefix":"1e7c4e327e3bd486","mcp_get_code":{"code_sha256":"1e7c4e327e3bd486"}},{"arxiv_id":"2206.07259","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-of-image-scale-and","title":"Self-Supervised Learning of Image Scale and Orientation","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bluedream1121/self-sca-ori","path":"utils/train_utils.py","file_url":"https://github.com/bluedream1121/self-sca-ori/blob/HEAD/utils/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":"b2c877f2f6fc170a","code_sha256_prefix":"b2c877f2f6fc170a","mcp_get_code":{"code_sha256":"b2c877f2f6fc170a"}},{"arxiv_id":"2206.01816","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-unifies-t-sne-and-umap","title":"From $t$-SNE to UMAP with contrastive learning","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berenslab/contrastive-ne","path":"src/cne/cne.py","file_url":"https://github.com/berenslab/contrastive-ne/blob/HEAD/src/cne/cne.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":"86079601d15d218a","code_sha256_prefix":"86079601d15d218a","mcp_get_code":{"code_sha256":"86079601d15d218a"}},{"arxiv_id":"2206.01646","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-positive-sampling-for-contrastive","title":"Integrating Prior Knowledge in Contrastive Learning with Kernel","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duplums/contrastive-decoupled-uniformity","path":"main_lincls.py","file_url":"https://github.com/duplums/contrastive-decoupled-uniformity/blob/HEAD/main_lincls.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cec655a124623d68","code_sha256_prefix":"cec655a124623d68","mcp_get_code":{"code_sha256":"cec655a124623d68"}},{"arxiv_id":"2205.15117","arxiv_id_is_arxiv":true,"paper":"/paper/ood-link-prediction-generalization","title":"OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzez/ood-link-prediction-generalization-mpnn","path":"link_prediction_new.py","file_url":"https://github.com/yangzez/ood-link-prediction-generalization-mpnn/blob/HEAD/link_prediction_new.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":"ede9af5ea21e6847","code_sha256_prefix":"ede9af5ea21e6847","mcp_get_code":{"code_sha256":"ede9af5ea21e6847"}},{"arxiv_id":"2205.15117","arxiv_id_is_arxiv":true,"paper":"/paper/ood-link-prediction-generalization","title":"OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzez/ood-link-prediction-generalization-mpnn","path":"link_prediction_new_ddi.py","file_url":"https://github.com/yangzez/ood-link-prediction-generalization-mpnn/blob/HEAD/link_prediction_new_ddi.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":"12ff34677ab9312e","code_sha256_prefix":"12ff34677ab9312e","mcp_get_code":{"code_sha256":"12ff34677ab9312e"}},{"arxiv_id":"2205.14368","arxiv_id_is_arxiv":true,"paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_tu.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_tu.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":"f7d60c6f40ddeb9d","code_sha256_prefix":"f7d60c6f40ddeb9d","mcp_get_code":{"code_sha256":"f7d60c6f40ddeb9d"}},{"arxiv_id":"2205.14368","arxiv_id_is_arxiv":true,"paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_benchmark.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_benchmark.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":"bfb9980d1fbf755d","code_sha256_prefix":"bfb9980d1fbf755d","mcp_get_code":{"code_sha256":"bfb9980d1fbf755d"}},{"arxiv_id":"2205.14368","arxiv_id_is_arxiv":true,"paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_synthetic.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_synthetic.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":"4b30cac230232396","code_sha256_prefix":"4b30cac230232396","mcp_get_code":{"code_sha256":"4b30cac230232396"}},{"arxiv_id":"2205.13328","arxiv_id_is_arxiv":true,"paper":"/paper/how-powerful-are-k-hop-message-passing-graph","title":"How Powerful are K-hop Message Passing Graph Neural Networks","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiaruiFeng/KP-GNN","path":"train_CSL.py","file_url":"https://github.com/JiaruiFeng/KP-GNN/blob/HEAD/train_CSL.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":"410059ae24fcef3a","code_sha256_prefix":"410059ae24fcef3a","mcp_get_code":{"code_sha256":"410059ae24fcef3a"}},{"arxiv_id":"2205.13104","arxiv_id_is_arxiv":true,"paper":"/paper/trainable-weight-averaging-for-fast","title":"Trainable Weight Averaging: A General Approach for Subspace Training","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nblt/twa","path":"train_twa.py","file_url":"https://github.com/nblt/twa/blob/HEAD/train_twa.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":"4a023162808ea147","code_sha256_prefix":"4a023162808ea147","mcp_get_code":{"code_sha256":"4a023162808ea147"}},{"arxiv_id":"2205.10927","arxiv_id_is_arxiv":true,"paper":"/paper/fast-abc-boost-a-unified-framework-for","title":"Fast ABC-Boost: A Unified Framework for Selecting the Base Class in Multi-Class Classification","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pltrees/abcboost","path":"src/abcboost.py","file_url":"https://github.com/pltrees/abcboost/blob/HEAD/src/abcboost.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":"af0168416cc75d77","code_sha256_prefix":"af0168416cc75d77","mcp_get_code":{"code_sha256":"af0168416cc75d77"}},{"arxiv_id":"2205.10660","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformers-in-2022-an-update-on-tiny","title":"Vision Transformers in 2022: An Update on Tiny ImageNet","date":"2022-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ehuynh1106/TinyImageNet-Transformers","path":"engine.py","file_url":"https://github.com/ehuynh1106/TinyImageNet-Transformers/blob/HEAD/engine.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":"967e7e8faa414955","code_sha256_prefix":"967e7e8faa414955","mcp_get_code":{"code_sha256":"967e7e8faa414955"}},{"arxiv_id":"2205.01059","arxiv_id_is_arxiv":true,"paper":"/paper/al-pinns-augmented-lagrangian-relaxation","title":"Enhanced Physics-Informed Neural Networks with Augmented Lagrangian Relaxation Method (AL-PINNs)","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwijaeson/al-pinns","path":"Viscous_Burgers/Viscous_Burgers_AL-PINNs.py","file_url":"https://github.com/hwijaeson/al-pinns/blob/HEAD/Viscous_Burgers/Viscous_Burgers_AL-PINNs.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, hwijaeson/al-pinns when it was checked","code_sha256":"11cdefe64d123b83","code_sha256_prefix":"11cdefe64d123b83","mcp_get_code":{"code_sha256":"11cdefe64d123b83"}},{"arxiv_id":"2204.13713","arxiv_id_is_arxiv":true,"paper":"/paper/learning-cosmology-and-clustering-with-cosmic","title":"Learning cosmology and clustering with cosmic graphs","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PabloVD/CosmoGraphNet","path":"Source/training.py","file_url":"https://github.com/PabloVD/CosmoGraphNet/blob/HEAD/Source/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":"eee4e6c08031e113","code_sha256_prefix":"eee4e6c08031e113","mcp_get_code":{"code_sha256":"eee4e6c08031e113"}},{"arxiv_id":"2204.08758","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-ctr-prediction-with-context-aware","title":"Enhancing CTR Prediction with Context-Aware Feature Representation Learning","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frnetnetwork/frnet","path":"main_ml_base.py","file_url":"https://github.com/frnetnetwork/frnet/blob/HEAD/main_ml_base.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, frnetnetwork/frnet when it was checked","code_sha256":"c753d1536c7ac391","code_sha256_prefix":"c753d1536c7ac391","mcp_get_code":{"code_sha256":"c753d1536c7ac391"}},{"arxiv_id":"2204.07937","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-cross-task-generalization-via","title":"Unsupervised Cross-Task Generalization via Retrieval Augmentation","date":"2022-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"INK-USC/ReCross","path":"metax/models/run_bart.py","file_url":"https://github.com/INK-USC/ReCross/blob/HEAD/metax/models/run_bart.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":"6afb875d7936f908","code_sha256_prefix":"6afb875d7936f908","mcp_get_code":{"code_sha256":"6afb875d7936f908"}},{"arxiv_id":"2204.03304","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-only-unlabeled-data","title":"Federated Learning from Only Unlabeled Data with Class-Conditional-Sharing Clients","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lunanbit/FedUL","path":"federated/fedul_mnist.py","file_url":"https://github.com/lunanbit/FedUL/blob/HEAD/federated/fedul_mnist.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, lunanbit/FedUL when it was checked","code_sha256":"1785cd10cae84f11","code_sha256_prefix":"1785cd10cae84f11","mcp_get_code":{"code_sha256":"1785cd10cae84f11"}},{"arxiv_id":"2204.03304","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-only-unlabeled-data","title":"Federated Learning from Only Unlabeled Data with Class-Conditional-Sharing Clients","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lunanbit/FedUL","path":"federated/fedul_cifar.py","file_url":"https://github.com/lunanbit/FedUL/blob/HEAD/federated/fedul_cifar.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, lunanbit/FedUL when it was checked","code_sha256":"6332381796625d6d","code_sha256_prefix":"6332381796625d6d","mcp_get_code":{"code_sha256":"6332381796625d6d"}},{"arxiv_id":"2204.02152","arxiv_id_is_arxiv":true,"paper":"/paper/utmos-utokyo-sarulab-system-for-voicemos","title":"UTMOS: UTokyo-SaruLab System for VoiceMOS Challenge 2022","date":null,"month_inferred_from_arxiv_id":"2022-04","title_source":"archive","repo":"sarulab-speech/utmos22","path":"strong/param_tuning.py","file_url":"https://github.com/sarulab-speech/utmos22/blob/HEAD/strong/param_tuning.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":"b6c0ff40845aeb01","code_sha256_prefix":"b6c0ff40845aeb01","mcp_get_code":{"code_sha256":"b6c0ff40845aeb01"}},{"arxiv_id":"2203.16427","arxiv_id_is_arxiv":true,"paper":"/paper/balanced-mse-for-imbalanced-visual-regression","title":"Balanced MSE for Imbalanced Visual Regression","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiawei-ren/BalancedMSE","path":"synthetic_benchmark/main_1d.py","file_url":"https://github.com/jiawei-ren/BalancedMSE/blob/HEAD/synthetic_benchmark/main_1d.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":"3059bd5e0c0a4f8b","code_sha256_prefix":"3059bd5e0c0a4f8b","mcp_get_code":{"code_sha256":"3059bd5e0c0a4f8b"}},{"arxiv_id":"2203.04738","arxiv_id_is_arxiv":true,"paper":"/paper/parallel-training-of-gru-networks-with-a-1","title":"Parallel Training of GRU Networks with a Multi-Grid Solver for Long Sequences","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multilevel-nn/torchbraid","path":"examples/UCI_HAR_Recurrent/UCI_HAR_GRU_script.py","file_url":"https://github.com/multilevel-nn/torchbraid/blob/HEAD/examples/UCI_HAR_Recurrent/UCI_HAR_GRU_script.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, multilevel-nn/torchbraid (NOASSERTION)","code_sha256":"7ba32c48be99b4d3","code_sha256_prefix":"7ba32c48be99b4d3","mcp_get_code":{"code_sha256":"7ba32c48be99b4d3"}},{"arxiv_id":"2203.02048","arxiv_id_is_arxiv":true,"paper":"/paper/anomaly-detection-inspired-few-shot-medical","title":"Anomaly Detection-Inspired Few-Shot Medical Image Segmentation Through Self-Supervision With Supervoxels","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sha168/ADNet","path":"main_train.py","file_url":"https://github.com/sha168/ADNet/blob/HEAD/main_train.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":"50c0186d0234aef4","code_sha256_prefix":"50c0186d0234aef4","mcp_get_code":{"code_sha256":"50c0186d0234aef4"}},{"arxiv_id":"2202.12373","arxiv_id_is_arxiv":true,"paper":"/paper/learning-pod-of-complex-dynamics-using-heavy","title":"Learning POD of Complex Dynamics Using Heavy-ball Neural ODEs","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinbakermath/pod_hbnode","path":"pod_hbnode/dmd_model.py","file_url":"https://github.com/justinbakermath/pod_hbnode/blob/HEAD/pod_hbnode/dmd_model.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":"95abbedc21d8e2ce","code_sha256_prefix":"95abbedc21d8e2ce","mcp_get_code":{"code_sha256":"95abbedc21d8e2ce"}},{"arxiv_id":"2202.12002","arxiv_id_is_arxiv":true,"paper":"/paper/rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ksreenivasan/pruning_is_enough","path":"imagenet/imagenet_main.py","file_url":"https://github.com/ksreenivasan/pruning_is_enough/blob/HEAD/imagenet/imagenet_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":"fdaf8b4fcf382ea3","code_sha256_prefix":"fdaf8b4fcf382ea3","mcp_get_code":{"code_sha256":"fdaf8b4fcf382ea3"}},{"arxiv_id":"2202.06768","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-embeddings-revisited","title":"Probabilistic Embeddings Revisited","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinkoff-ai/probabilistic-embeddings","path":"src/probabilistic_embeddings/commands/basic.py","file_url":"https://github.com/tinkoff-ai/probabilistic-embeddings/blob/HEAD/src/probabilistic_embeddings/commands/basic.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":"9a88ed29503e0c8e","code_sha256_prefix":"9a88ed29503e0c8e","mcp_get_code":{"code_sha256":"9a88ed29503e0c8e"}},{"arxiv_id":"2202.05834","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-out-of-distribution-error-with-the","title":"Predicting Out-of-Distribution Error with the Projection Norm","date":"2022-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaodongyu/projnorm","path":"init_ref_model.py","file_url":"https://github.com/yaodongyu/projnorm/blob/HEAD/init_ref_model.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":"35f8154aa103e181","code_sha256_prefix":"35f8154aa103e181","mcp_get_code":{"code_sha256":"35f8154aa103e181"}},{"arxiv_id":"2202.05167","arxiv_id_is_arxiv":true,"paper":"/paper/class-distance-weighted-cross-entropy-loss","title":"Class Distance Weighted Cross-Entropy Loss for Ulcerative Colitis Severity Estimation","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GorkemP/labeled-images-for-ulcerative-colitis","path":"train_classification_model_CV.py","file_url":"https://github.com/GorkemP/labeled-images-for-ulcerative-colitis/blob/HEAD/train_classification_model_CV.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":"b28c83cab897ab43","code_sha256_prefix":"b28c83cab897ab43","mcp_get_code":{"code_sha256":"b28c83cab897ab43"}},{"arxiv_id":"2202.04736","arxiv_id_is_arxiv":true,"paper":"/paper/coarsening-the-granularity-towards","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/structure-lth","path":"main_imp.py","file_url":"https://github.com/vita-group/structure-lth/blob/HEAD/main_imp.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":"1e3f9a051b5a9b47","code_sha256_prefix":"1e3f9a051b5a9b47","mcp_get_code":{"code_sha256":"1e3f9a051b5a9b47"}},{"arxiv_id":"2202.02989","arxiv_id_is_arxiv":true,"paper":"/paper/graph-self-supervised-learning-with-accurate","title":"Graph Self-supervised Learning with Accurate Discrepancy Learning","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DongkiKim95/D-SLA","path":"linkPrediction_TU/pretrain_DSLA.py","file_url":"https://github.com/DongkiKim95/D-SLA/blob/HEAD/linkPrediction_TU/pretrain_DSLA.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, DongkiKim95/D-SLA when it was checked","code_sha256":"944d6bd632975f5b","code_sha256_prefix":"944d6bd632975f5b","mcp_get_code":{"code_sha256":"944d6bd632975f5b"}},{"arxiv_id":"2202.02989","arxiv_id_is_arxiv":true,"paper":"/paper/graph-self-supervised-learning-with-accurate","title":"Graph Self-supervised Learning with Accurate Discrepancy Learning","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DongkiKim95/D-SLA","path":"transferLearning_MoleculeNet_PPI/chem/pretrain_DSLA.py","file_url":"https://github.com/DongkiKim95/D-SLA/blob/HEAD/transferLearning_MoleculeNet_PPI/chem/pretrain_DSLA.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, DongkiKim95/D-SLA when it was checked","code_sha256":"6929fdd668e120ca","code_sha256_prefix":"6929fdd668e120ca","mcp_get_code":{"code_sha256":"6929fdd668e120ca"}},{"arxiv_id":"2202.02981","arxiv_id_is_arxiv":true,"paper":"/paper/neural-tangent-kernel-analysis-of-deep-narrow","title":"Neural Tangent Kernel Analysis of Deep Narrow Neural Networks","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lthilnklover/deep-narrow-ntk","path":"ntk_convergence.py","file_url":"https://github.com/lthilnklover/deep-narrow-ntk/blob/HEAD/ntk_convergence.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lthilnklover/deep-narrow-ntk when it was checked","code_sha256":"7da9a68717bea000","code_sha256_prefix":"7da9a68717bea000","mcp_get_code":{"code_sha256":"7da9a68717bea000"}},{"arxiv_id":"2202.02981","arxiv_id_is_arxiv":true,"paper":"/paper/neural-tangent-kernel-analysis-of-deep-narrow","title":"Neural Tangent Kernel Analysis of Deep Narrow Neural Networks","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lthilnklover/deep-narrow-ntk","path":"train_mnist.py","file_url":"https://github.com/lthilnklover/deep-narrow-ntk/blob/HEAD/train_mnist.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, lthilnklover/deep-narrow-ntk when it was checked","code_sha256":"6a5141c9fa48b03a","code_sha256_prefix":"6a5141c9fa48b03a","mcp_get_code":{"code_sha256":"6a5141c9fa48b03a"}},{"arxiv_id":"2202.00185","arxiv_id_is_arxiv":true,"paper":"/paper/atek-augmenting-transformers-with-expert","title":"LayoutEnhancer: Generating Good Indoor Layouts from Imperfect Data","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kleimertu/humancentriclayouts","path":"src/network.py","file_url":"https://github.com/kleimertu/humancentriclayouts/blob/HEAD/src/network.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":"f19bd55602778439","code_sha256_prefix":"f19bd55602778439","mcp_get_code":{"code_sha256":"f19bd55602778439"}},{"arxiv_id":"2201.12787","arxiv_id_is_arxiv":true,"paper":"/paper/graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lenscloth/grpe","path":"zinc.py","file_url":"https://github.com/lenscloth/grpe/blob/HEAD/zinc.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":"9ec5aa5e7b77d9b7","code_sha256_prefix":"9ec5aa5e7b77d9b7","mcp_get_code":{"code_sha256":"9ec5aa5e7b77d9b7"}},{"arxiv_id":"2201.12787","arxiv_id_is_arxiv":true,"paper":"/paper/graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lenscloth/grpe","path":"gpp.py","file_url":"https://github.com/lenscloth/grpe/blob/HEAD/gpp.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":"79c9fa759ce09d31","code_sha256_prefix":"79c9fa759ce09d31","mcp_get_code":{"code_sha256":"79c9fa759ce09d31"}},{"arxiv_id":"2201.12433","arxiv_id_is_arxiv":true,"paper":"/paper/fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yh-yao/FedGCN","path":"src/train_func.py","file_url":"https://github.com/yh-yao/FedGCN/blob/HEAD/src/train_func.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":"8f8a4abab99a52e6","code_sha256_prefix":"8f8a4abab99a52e6","mcp_get_code":{"code_sha256":"8f8a4abab99a52e6"}},{"arxiv_id":"2201.12328","arxiv_id_is_arxiv":true,"paper":"/paper/toward-training-at-imagenet-scale-with","title":"Toward Training at ImageNet Scale with Differential Privacy","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dp-imagenet","path":"benchmark/cifar10_objax.py","file_url":"https://github.com/google-research/dp-imagenet/blob/HEAD/benchmark/cifar10_objax.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":"e856757b66bf0168","code_sha256_prefix":"e856757b66bf0168","mcp_get_code":{"code_sha256":"e856757b66bf0168"}},{"arxiv_id":"2201.12328","arxiv_id_is_arxiv":true,"paper":"/paper/toward-training-at-imagenet-scale-with","title":"Toward Training at ImageNet Scale with Differential Privacy","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dp-imagenet","path":"benchmark/mnist_opacus.py","file_url":"https://github.com/google-research/dp-imagenet/blob/HEAD/benchmark/mnist_opacus.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":"605992b94d3a3108","code_sha256_prefix":"605992b94d3a3108","mcp_get_code":{"code_sha256":"605992b94d3a3108"}},{"arxiv_id":"2201.12328","arxiv_id_is_arxiv":true,"paper":"/paper/toward-training-at-imagenet-scale-with","title":"Toward Training at ImageNet Scale with Differential Privacy","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dp-imagenet","path":"benchmark/cifar10_opacus.py","file_url":"https://github.com/google-research/dp-imagenet/blob/HEAD/benchmark/cifar10_opacus.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":"ff2ef7a99e4a92ac","code_sha256_prefix":"ff2ef7a99e4a92ac","mcp_get_code":{"code_sha256":"ff2ef7a99e4a92ac"}},{"arxiv_id":"2201.09785","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-and-boosting-gradient-based-training","title":"Unifying and Boosting Gradient-Based Training-Free Neural Architecture Search","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuyao95/HNAS","path":"darts_space/search.py","file_url":"https://github.com/shuyao95/HNAS/blob/HEAD/darts_space/search.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, shuyao95/HNAS when it was checked","code_sha256":"41cb77ab2448be4f","code_sha256_prefix":"41cb77ab2448be4f","mcp_get_code":{"code_sha256":"41cb77ab2448be4f"}},{"arxiv_id":"2201.09191","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sds-lab/rot-pooling","path":"backbones/ddi_gin.py","file_url":"https://github.com/sds-lab/rot-pooling/blob/HEAD/backbones/ddi_gin.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":"954a0c90bea1cc24","code_sha256_prefix":"954a0c90bea1cc24","mcp_get_code":{"code_sha256":"954a0c90bea1cc24"}},{"arxiv_id":"2201.09191","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sds-lab/rot-pooling","path":"backbones/attention_mil.py","file_url":"https://github.com/sds-lab/rot-pooling/blob/HEAD/backbones/attention_mil.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":"3ce20c8e0eb7e9c5","code_sha256_prefix":"3ce20c8e0eb7e9c5","mcp_get_code":{"code_sha256":"3ce20c8e0eb7e9c5"}},{"arxiv_id":"2201.06239","arxiv_id_is_arxiv":true,"paper":"/paper/mt-gbm-a-multi-task-gradient-boosting-machine-1","title":"MT-GBM: A Multi-Task Gradient Boosting Machine with Shared Decision Trees","date":"2022-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antmachineintelligence/mtgbmcode","path":"python-package/lightgbmmt/engine.py","file_url":"https://github.com/antmachineintelligence/mtgbmcode/blob/HEAD/python-package/lightgbmmt/engine.py","status":"unverified","verification_level":0,"contract_check":null,"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, antmachineintelligence/mtgbmcode, 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":"a925669c260a1c9a","code_sha256_prefix":"a925669c260a1c9a","mcp_get_code":{"code_sha256":"a925669c260a1c9a"}},{"arxiv_id":"2112.14531","arxiv_id_is_arxiv":true,"paper":"/paper/designing-the-topology-of-graph-neural","title":"Designing the Topology of Graph Neural Networks: A Novel Feature Fusion Perspective","date":"2021-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lars-research/f2gnn","path":"train_search.py","file_url":"https://github.com/lars-research/f2gnn/blob/HEAD/train_search.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, lars-research/f2gnn when it was checked","code_sha256":"ca64b337a2d5442f","code_sha256_prefix":"ca64b337a2d5442f","mcp_get_code":{"code_sha256":"ca64b337a2d5442f"}},{"arxiv_id":"2112.05135","arxiv_id_is_arxiv":true,"paper":"/paper/pixmix-dreamlike-pictures-comprehensively","title":"PixMix: Dreamlike Pictures Comprehensively Improve Safety Measures","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe1chief/windownormalizaion","path":"cifar.py","file_url":"https://github.com/joe1chief/windownormalizaion/blob/HEAD/cifar.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":"eab93068178559cc","code_sha256_prefix":"eab93068178559cc","mcp_get_code":{"code_sha256":"eab93068178559cc"}},{"arxiv_id":"2112.03939","arxiv_id_is_arxiv":true,"paper":"/paper/photometric-redshifts-from-sdss-images-with","title":"Photometric Redshifts from SDSS Images with an Interpretable Deep Capsule Network","date":null,"month_inferred_from_arxiv_id":"2021-12","title_source":"archive","repo":"biprateep/encapZulate-1","path":"src/encapzulate/base/run_model.py","file_url":"https://github.com/biprateep/encapZulate-1/blob/HEAD/src/encapzulate/base/run_model.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":"79a4779ca17d1af8","code_sha256_prefix":"79a4779ca17d1af8","mcp_get_code":{"code_sha256":"79a4779ca17d1af8"}},{"arxiv_id":"2112.00038","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-provably-monotonic-networks","title":"Robust and Provably Monotonic Networks","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niklasnolte/MonotoneNorm","path":"monotonicnetworks/tests.py","file_url":"https://github.com/niklasnolte/MonotoneNorm/blob/HEAD/monotonicnetworks/tests.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":"cc9786ab2e19cf12","code_sha256_prefix":"cc9786ab2e19cf12","mcp_get_code":{"code_sha256":"cc9786ab2e19cf12"}},{"arxiv_id":"2111.14522","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jctops/understanding-oversquashing","path":"gdl/src/gdl/experiment/node_classification.py","file_url":"https://github.com/jctops/understanding-oversquashing/blob/HEAD/gdl/src/gdl/experiment/node_classification.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":"9d0aa5bc590c31b7","code_sha256_prefix":"9d0aa5bc590c31b7","mcp_get_code":{"code_sha256":"9d0aa5bc590c31b7"}},{"arxiv_id":"2111.12273","arxiv_id_is_arxiv":true,"paper":"/paper/sharpness-aware-quantization-for-deep-neural","title":"Sharpness-aware Quantization for Deep Neural Networks","date":"2021-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuang-group/saq","path":"core/engine.py","file_url":"https://github.com/zhuang-group/saq/blob/HEAD/core/engine.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":"f924bc6970c6a9da","code_sha256_prefix":"f924bc6970c6a9da","mcp_get_code":{"code_sha256":"f924bc6970c6a9da"}},{"arxiv_id":"2111.06537","arxiv_id_is_arxiv":true,"paper":"/paper/multi-step-budgeted-bayesian-optimization","title":"Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raulastudillo06/budgetedbo","path":"experiments/make_rfboston_surrogate.py","file_url":"https://github.com/raulastudillo06/budgetedbo/blob/HEAD/experiments/make_rfboston_surrogate.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":"5a776e9377fb04dc","code_sha256_prefix":"5a776e9377fb04dc","mcp_get_code":{"code_sha256":"5a776e9377fb04dc"}},{"arxiv_id":"2111.04964","arxiv_id_is_arxiv":true,"paper":"/paper/on-representation-knowledge-distillation-for","title":"On Representation Knowledge Distillation for Graph Neural Networks","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaitjo/efficient-gnns","path":"arxiv_pyg/gnn_kd_and_aux.py","file_url":"https://github.com/chaitjo/efficient-gnns/blob/HEAD/arxiv_pyg/gnn_kd_and_aux.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chaitjo/efficient-gnns when it was checked","code_sha256":"326f676717b770a2","code_sha256_prefix":"326f676717b770a2","mcp_get_code":{"code_sha256":"326f676717b770a2"}},{"arxiv_id":"2111.00162","arxiv_id_is_arxiv":true,"paper":"/paper/you-are-caught-stealing-my-winning-lottery","title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","date":"2021-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"1e3f9a051b5a9b47","code_sha256_prefix":"1e3f9a051b5a9b47","mcp_get_code":{"code_sha256":"1e3f9a051b5a9b47"}},{"arxiv_id":"2111.00064","arxiv_id_is_arxiv":true,"paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/pecos","path":"examples/giant-xrt/OGB_baselines/ogbn-arxiv/gnn.py","file_url":"https://github.com/amzn/pecos/blob/HEAD/examples/giant-xrt/OGB_baselines/ogbn-arxiv/gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82f54a95d4951b19","code_sha256_prefix":"82f54a95d4951b19","mcp_get_code":{"code_sha256":"82f54a95d4951b19"}},{"arxiv_id":"2111.00064","arxiv_id_is_arxiv":true,"paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/pecos","path":"examples/giant-xrt/OGB_baselines/ogbn-papers100M/mlp_xrt.py","file_url":"https://github.com/amzn/pecos/blob/HEAD/examples/giant-xrt/OGB_baselines/ogbn-papers100M/mlp_xrt.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":"17c5046a153ae409","code_sha256_prefix":"17c5046a153ae409","mcp_get_code":{"code_sha256":"17c5046a153ae409"}},{"arxiv_id":"2110.14446","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Non-Homophily-Benchmarks","path":"gcn-ogbn-proteins.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/gcn-ogbn-proteins.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":"fcac6adae654a353","code_sha256_prefix":"fcac6adae654a353","mcp_get_code":{"code_sha256":"fcac6adae654a353"}},{"arxiv_id":"2110.14430","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-neuron-pruning-purifies","title":"Adversarial Neuron Pruning Purifies Backdoored Deep Models","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csdongxian/ANP_backdoor","path":"train_backdoor_cifar.py","file_url":"https://github.com/csdongxian/ANP_backdoor/blob/HEAD/train_backdoor_cifar.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, csdongxian/ANP_backdoor when it was checked","code_sha256":"1042d89ceda24cdb","code_sha256_prefix":"1042d89ceda24cdb","mcp_get_code":{"code_sha256":"1042d89ceda24cdb"}},{"arxiv_id":"2110.14038","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"models/BGRL.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/models/BGRL.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":"09cbcddd5413d6be","code_sha256_prefix":"09cbcddd5413d6be","mcp_get_code":{"code_sha256":"09cbcddd5413d6be"}},{"arxiv_id":"2110.14038","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"models/BGRL_G2L.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/models/BGRL_G2L.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":"c310eff3a8517be9","code_sha256_prefix":"c310eff3a8517be9","mcp_get_code":{"code_sha256":"c310eff3a8517be9"}},{"arxiv_id":"2110.13412","arxiv_id_is_arxiv":true,"paper":"/paper/tribert-full-body-human-centric-audio-visual","title":"TriBERT: Full-body Human-centric Audio-visual Representation Learning for Visual Sound Separation","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-vision/tribert","path":"retrieval/train_retrieval_networks.py","file_url":"https://github.com/ubc-vision/tribert/blob/HEAD/retrieval/train_retrieval_networks.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, ubc-vision/tribert when it was checked","code_sha256":"1b398607b54568df","code_sha256_prefix":"1b398607b54568df","mcp_get_code":{"code_sha256":"1b398607b54568df"}},{"arxiv_id":"2110.13197","arxiv_id_is_arxiv":true,"paper":"/paper/nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/nestedgnn","path":"run_ogb_mol.py","file_url":"https://github.com/muhanzhang/nestedgnn/blob/HEAD/run_ogb_mol.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":"ec256b2c1848c0c8","code_sha256_prefix":"ec256b2c1848c0c8","mcp_get_code":{"code_sha256":"ec256b2c1848c0c8"}},{"arxiv_id":"2110.11571","arxiv_id_is_arxiv":true,"paper":"/paper/anti-backdoor-learning-training-clean-models","title":"Anti-Backdoor Learning: Training Clean Models on Poisoned Data","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bboylyg/ABL","path":"backdoor_isolation.py","file_url":"https://github.com/bboylyg/ABL/blob/HEAD/backdoor_isolation.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/ABL when it was checked","code_sha256":"9f1d099a331c24ab","code_sha256_prefix":"9f1d099a331c24ab","mcp_get_code":{"code_sha256":"9f1d099a331c24ab"}},{"arxiv_id":"2110.08727","arxiv_id_is_arxiv":true,"paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/graphless-neural-networks","path":"train_and_eval.py","file_url":"https://github.com/snap-research/graphless-neural-networks/blob/HEAD/train_and_eval.py","status":"ran","verification_level":1,"contract_check":null,"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, snap-research/graphless-neural-networks, 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":"2b547c0185564a58","code_sha256_prefix":"2b547c0185564a58","mcp_get_code":{"code_sha256":"2b547c0185564a58"}},{"arxiv_id":"2110.05025","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-is-more-robust-to-1","title":"Self-supervised Learning is More Robust to Dataset Imbalance","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liuhong99/Imbalanced-SSL","path":"cifar/main_sam_exp.py","file_url":"https://github.com/Liuhong99/Imbalanced-SSL/blob/HEAD/cifar/main_sam_exp.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":"ee45897c218040d1","code_sha256_prefix":"ee45897c218040d1","mcp_get_code":{"code_sha256":"ee45897c218040d1"}},{"arxiv_id":"2109.14509","arxiv_id_is_arxiv":true,"paper":"/paper/pac-bayes-information-bottleneck","title":"PAC-Bayes Information Bottleneck","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanwangzf/pac-bayes-ib","path":"src/pib_utils.py","file_url":"https://github.com/ryanwangzf/pac-bayes-ib/blob/HEAD/src/pib_utils.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, ryanwangzf/pac-bayes-ib when it was checked","code_sha256":"18184c74464685b3","code_sha256_prefix":"18184c74464685b3","mcp_get_code":{"code_sha256":"18184c74464685b3"}},{"arxiv_id":"2109.07263","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-learning-of-flowchart-grounded","title":"End-to-End Learning of Flowchart Grounded Task-Oriented Dialogs","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dair-iitd/flonet","path":"code/flonet.py","file_url":"https://github.com/dair-iitd/flonet/blob/HEAD/code/flonet.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, dair-iitd/flonet when it was checked","code_sha256":"308e60d9f6d6475a","code_sha256_prefix":"308e60d9f6d6475a","mcp_get_code":{"code_sha256":"308e60d9f6d6475a"}},{"arxiv_id":"2109.06024","arxiv_id_is_arxiv":true,"paper":"/paper/formalizing-and-estimating-distribution","title":"Formalizing and Estimating Distribution Inference Risks","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamgroot42/form_est_dist_risks","path":"arxiv/model_utils.py","file_url":"https://github.com/iamgroot42/form_est_dist_risks/blob/HEAD/arxiv/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e91ee8bb1615456","code_sha256_prefix":"5e91ee8bb1615456","mcp_get_code":{"code_sha256":"5e91ee8bb1615456"}},{"arxiv_id":"2109.01116","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-graph-contrastive","title":"An Empirical Study of Graph Contrastive Learning","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pygcl/pygcl","path":"examples/GraphCL.py","file_url":"https://github.com/pygcl/pygcl/blob/HEAD/examples/GraphCL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f30b73fd238832a0","code_sha256_prefix":"f30b73fd238832a0","mcp_get_code":{"code_sha256":"f30b73fd238832a0"}},{"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":"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":"9cbb9737a804d9ab","code_sha256_prefix":"9cbb9737a804d9ab","mcp_get_code":{"code_sha256":"9cbb9737a804d9ab"}},{"arxiv_id":"2108.10587","arxiv_id_is_arxiv":true,"paper":"/paper/pooling-architecture-search-for-graph","title":"Pooling Architecture Search for Graph Classification","date":"2021-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lars-research/pas-ogb","path":"finetune.py","file_url":"https://github.com/lars-research/pas-ogb/blob/HEAD/finetune.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, lars-research/pas-ogb when it was checked","code_sha256":"0aeadca47da6b340","code_sha256_prefix":"0aeadca47da6b340","mcp_get_code":{"code_sha256":"0aeadca47da6b340"}},{"arxiv_id":"2108.09976","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-distributional-vulnerability-of","title":"Revealing the Distributional Vulnerability of Discriminators by Implicit Generators","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lawliet-zzl/fig","path":"code_FIG/main_FIG.py","file_url":"https://github.com/lawliet-zzl/fig/blob/HEAD/code_FIG/main_FIG.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":"4f97b300b8ea7ef8","code_sha256_prefix":"4f97b300b8ea7ef8","mcp_get_code":{"code_sha256":"4f97b300b8ea7ef8"}},{"arxiv_id":"2108.09645","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-mini-batch-method-via-partial","title":"Improving Mini-batch Optimal Transport via Partial Transportation","date":"2021-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khainb/BoMb-OT","path":"PartialDA/run_mOT.py","file_url":"https://github.com/khainb/BoMb-OT/blob/HEAD/PartialDA/run_mOT.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":"4ecaced2e83b4ff1","code_sha256_prefix":"4ecaced2e83b4ff1","mcp_get_code":{"code_sha256":"4ecaced2e83b4ff1"}},{"arxiv_id":"2108.03656","arxiv_id_is_arxiv":true,"paper":"/paper/skeleton-contrastive-3d-action-representation","title":"Skeleton-Contrastive 3D Action Representation Learning","date":"2021-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmthoker/skeleton-contrast","path":"main_moco_inter_skeleton.py","file_url":"https://github.com/fmthoker/skeleton-contrast/blob/HEAD/main_moco_inter_skeleton.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, fmthoker/skeleton-contrast when it was checked","code_sha256":"69ac6b95af8fc709","code_sha256_prefix":"69ac6b95af8fc709","mcp_get_code":{"code_sha256":"69ac6b95af8fc709"}},{"arxiv_id":"2108.00352","arxiv_id_is_arxiv":true,"paper":"/paper/badencoder-backdoor-attacks-to-pre-trained","title":"BadEncoder: Backdoor Attacks to Pre-trained Encoders in Self-Supervised Learning","date":"2021-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinyuan-jia/badencoder","path":"badencoder.py","file_url":"https://github.com/jinyuan-jia/badencoder/blob/HEAD/badencoder.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, jinyuan-jia/badencoder when it was checked","code_sha256":"f932268000bef667","code_sha256_prefix":"f932268000bef667","mcp_get_code":{"code_sha256":"f932268000bef667"}},{"arxiv_id":"2108.00352","arxiv_id_is_arxiv":true,"paper":"/paper/badencoder-backdoor-attacks-to-pre-trained","title":"BadEncoder: Backdoor Attacks to Pre-trained Encoders in Self-Supervised Learning","date":"2021-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giantseaweed/decree","path":"attack_encoder.py","file_url":"https://github.com/giantseaweed/decree/blob/HEAD/attack_encoder.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, giantseaweed/decree when it was checked","code_sha256":"7c0b8c4203703d28","code_sha256_prefix":"7c0b8c4203703d28","mcp_get_code":{"code_sha256":"7c0b8c4203703d28"}},{"arxiv_id":"2107.10834","arxiv_id_is_arxiv":true,"paper":"/paper/query2label-a-simple-transformer-way-to-multi","title":"Query2Label: A Simple Transformer Way to Multi-Label Classification","date":"2021-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SlongLiu/query2labels","path":"main_mlc.py","file_url":"https://github.com/SlongLiu/query2labels/blob/HEAD/main_mlc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aa56052c6f9f021","code_sha256_prefix":"5aa56052c6f9f021","mcp_get_code":{"code_sha256":"5aa56052c6f9f021"}},{"arxiv_id":"2107.06665","arxiv_id_is_arxiv":true,"paper":"/paper/disparity-between-batches-as-a-signal-for","title":"Disparity Between Batches as a Signal for Early Stopping","date":"2021-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahf93/disparity_early_stopping","path":"experiments.py","file_url":"https://github.com/mahf93/disparity_early_stopping/blob/HEAD/experiments.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, mahf93/disparity_early_stopping when it was checked","code_sha256":"c69667b381947b5c","code_sha256_prefix":"c69667b381947b5c","mcp_get_code":{"code_sha256":"c69667b381947b5c"}},{"arxiv_id":"2106.14103","arxiv_id_is_arxiv":true,"paper":"/paper/phycrnet-physics-informed-convolutional","title":"PhyCRNet: Physics-informed Convolutional-Recurrent Network for Solving Spatiotemporal PDEs","date":"2021-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isds-neu/PhyCRNet","path":"Codes/PhyCRNet_burgers.py","file_url":"https://github.com/isds-neu/PhyCRNet/blob/HEAD/Codes/PhyCRNet_burgers.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":"4832c001982b9eaf","code_sha256_prefix":"4832c001982b9eaf","mcp_get_code":{"code_sha256":"4832c001982b9eaf"}},{"arxiv_id":"2106.12931","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-temporal-graph-ode-networks-for","title":"Spatial-Temporal Graph ODE Networks for Traffic Flow Forecasting","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"square-coder/STGODE","path":"run_stode.py","file_url":"https://github.com/square-coder/STGODE/blob/HEAD/run_stode.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":"4998ab382425190c","code_sha256_prefix":"4998ab382425190c","mcp_get_code":{"code_sha256":"4998ab382425190c"}},{"arxiv_id":"2106.09157","arxiv_id_is_arxiv":true,"paper":"/paper/positional-contrastive-learning-for","title":"Positional Contrastive Learning for Volumetric Medical Image Segmentation","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dewenzeng/positional_cl","path":"train_contrast.py","file_url":"https://github.com/dewenzeng/positional_cl/blob/HEAD/train_contrast.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, dewenzeng/positional_cl when it was checked","code_sha256":"e8435fc361e3362d","code_sha256_prefix":"e8435fc361e3362d","mcp_get_code":{"code_sha256":"e8435fc361e3362d"}},{"arxiv_id":"2106.08703","arxiv_id_is_arxiv":true,"paper":"/paper/source-separation-based-data-augmentation-for","title":"Source Separation-based Data Augmentation for Improved Joint Beat and Downbeat Tracking","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SunnyCYC/aug4beat","path":"train_2combABSM.py","file_url":"https://github.com/SunnyCYC/aug4beat/blob/HEAD/train_2combABSM.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":"0000a8ec3c78583f","code_sha256_prefix":"0000a8ec3c78583f","mcp_get_code":{"code_sha256":"0000a8ec3c78583f"}},{"arxiv_id":"2106.07802","arxiv_id_is_arxiv":true,"paper":"/paper/geomol-torsional-geometric-generation-of","title":"GeoMol: Torsional Geometric Generation of Molecular 3D Conformer Ensembles","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PattanaikL/GeoMol","path":"model/training.py","file_url":"https://github.com/PattanaikL/GeoMol/blob/HEAD/model/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":"2297b4a1ae504ecf","code_sha256_prefix":"2297b4a1ae504ecf","mcp_get_code":{"code_sha256":"2297b4a1ae504ecf"}},{"arxiv_id":"2106.07594","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-automated","title":"Graph Contrastive Learning Automated","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shen-lab/graphcl_automated","path":"semisupervised_OGB/code/main_pretrain_graphcl_joao.py","file_url":"https://github.com/shen-lab/graphcl_automated/blob/HEAD/semisupervised_OGB/code/main_pretrain_graphcl_joao.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, shen-lab/graphcl_automated when it was checked","code_sha256":"169c3379d3f0bda6","code_sha256_prefix":"169c3379d3f0bda6","mcp_get_code":{"code_sha256":"169c3379d3f0bda6"}},{"arxiv_id":"2106.07594","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-automated","title":"Graph Contrastive Learning Automated","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shen-lab/graphcl_automated","path":"transferLearning_MoleculeNet_PPI/bio/pretrain_joao.py","file_url":"https://github.com/shen-lab/graphcl_automated/blob/HEAD/transferLearning_MoleculeNet_PPI/bio/pretrain_joao.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, shen-lab/graphcl_automated when it was checked","code_sha256":"4a1d1036ace0997f","code_sha256_prefix":"4a1d1036ace0997f","mcp_get_code":{"code_sha256":"4a1d1036ace0997f"}},{"arxiv_id":"2106.06916","arxiv_id_is_arxiv":true,"paper":"/paper/non-transferable-learning-a-new-approach-for","title":"Non-Transferable Learning: A New Approach for Model Ownership Verification and Applicability Authorization","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conditionWang/NTL","path":"src/ntl/ntl_cifar_stl.py","file_url":"https://github.com/conditionWang/NTL/blob/HEAD/src/ntl/ntl_cifar_stl.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, conditionWang/NTL when it was checked","code_sha256":"ae491ef6e405c0c4","code_sha256_prefix":"ae491ef6e405c0c4","mcp_get_code":{"code_sha256":"ae491ef6e405c0c4"}},{"arxiv_id":"2106.06695","arxiv_id_is_arxiv":true,"paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_keops.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_keops.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":"6314d25229de28ca","code_sha256_prefix":"6314d25229de28ca","mcp_get_code":{"code_sha256":"6314d25229de28ca"}},{"arxiv_id":"2106.06695","arxiv_id_is_arxiv":true,"paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_simplexgp.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_simplexgp.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":"a7ef504140137c14","code_sha256_prefix":"a7ef504140137c14","mcp_get_code":{"code_sha256":"a7ef504140137c14"}},{"arxiv_id":"2106.06695","arxiv_id_is_arxiv":true,"paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/train_skip.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/train_skip.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":"4d9c7f512a00d0e1","code_sha256_prefix":"4d9c7f512a00d0e1","mcp_get_code":{"code_sha256":"4d9c7f512a00d0e1"}},{"arxiv_id":"2106.04781","arxiv_id_is_arxiv":true,"paper":"/paper/embedding-physics-to-learn-spatiotemporal","title":"Encoding physics to learn reaction-diffusion processes","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isds-neu/percnn","path":"DataDrivenModeling/2d_gs_rd/train_2drd.py","file_url":"https://github.com/isds-neu/percnn/blob/HEAD/DataDrivenModeling/2d_gs_rd/train_2drd.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":"73b89bd6c0156e4e","code_sha256_prefix":"73b89bd6c0156e4e","mcp_get_code":{"code_sha256":"73b89bd6c0156e4e"}},{"arxiv_id":"2106.03699","arxiv_id_is_arxiv":true,"paper":"/paper/formalizing-distribution-inference-risks","title":"Formalizing Distribution Inference Risks","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamgroot42/distribution_inference","path":"arxiv/model_utils.py","file_url":"https://github.com/iamgroot42/distribution_inference/blob/HEAD/arxiv/model_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":"5e91ee8bb1615456","code_sha256_prefix":"5e91ee8bb1615456","mcp_get_code":{"code_sha256":"5e91ee8bb1615456"}},{"arxiv_id":"2106.03408","arxiv_id_is_arxiv":true,"paper":"/paper/antipodes-of-label-differential-privacy-pate","title":"Antipodes of Label Differential Privacy: PATE and ALIBI","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/label_dp_antipodes","path":"train_cifar_alibi.py","file_url":"https://github.com/facebookresearch/label_dp_antipodes/blob/HEAD/train_cifar_alibi.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, facebookresearch/label_dp_antipodes (NOASSERTION)","code_sha256":"fba6228bff78a52b","code_sha256_prefix":"fba6228bff78a52b","mcp_get_code":{"code_sha256":"fba6228bff78a52b"}},{"arxiv_id":"2106.03225","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/PrAC-LTH","path":"main_imp.py","file_url":"https://github.com/VITA-Group/PrAC-LTH/blob/HEAD/main_imp.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":"1e3f9a051b5a9b47","code_sha256_prefix":"1e3f9a051b5a9b47","mcp_get_code":{"code_sha256":"1e3f9a051b5a9b47"}},{"arxiv_id":"2106.03225","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/PrAC-LTH","path":"main_PrAC_imp.py","file_url":"https://github.com/VITA-Group/PrAC-LTH/blob/HEAD/main_PrAC_imp.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":"9e433381278f45b4","code_sha256_prefix":"9e433381278f45b4","mcp_get_code":{"code_sha256":"9e433381278f45b4"}},{"arxiv_id":"2106.01216","arxiv_id_is_arxiv":true,"paper":"/paper/evidential-turing-processes","title":"Evidential Turing Processes","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ituvisionlab/EvidentialCalibration","path":"script.py","file_url":"https://github.com/ituvisionlab/EvidentialCalibration/blob/HEAD/script.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":"d25a34aea14dc1bd","code_sha256_prefix":"d25a34aea14dc1bd","mcp_get_code":{"code_sha256":"d25a34aea14dc1bd"}},{"arxiv_id":"2106.00967","arxiv_id_is_arxiv":true,"paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bachnguyente/temporal-mgn","path":"covid/code/experiments.py","file_url":"https://github.com/bachnguyente/temporal-mgn/blob/HEAD/covid/code/experiments.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":"a65ee9aa33f86221","code_sha256_prefix":"a65ee9aa33f86221","mcp_get_code":{"code_sha256":"a65ee9aa33f86221"}},{"arxiv_id":"2106.00967","arxiv_id_is_arxiv":true,"paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bachnguyente/temporal-mgn","path":"covid/code/metalearn.py","file_url":"https://github.com/bachnguyente/temporal-mgn/blob/HEAD/covid/code/metalearn.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":"61c34f488910d4c6","code_sha256_prefix":"61c34f488910d4c6","mcp_get_code":{"code_sha256":"61c34f488910d4c6"}},{"arxiv_id":"2106.00750","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-for-time-1","title":"Unsupervised Representation Learning for Time Series with Temporal Neighborhood Coding","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanatonek/TNC_representation_learning","path":"evaluations/classification_test.py","file_url":"https://github.com/sanatonek/TNC_representation_learning/blob/HEAD/evaluations/classification_test.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, sanatonek/TNC_representation_learning when it was checked","code_sha256":"9df5dcf82ee3b90c","code_sha256_prefix":"9df5dcf82ee3b90c","mcp_get_code":{"code_sha256":"9df5dcf82ee3b90c"}},{"arxiv_id":"2105.14141","arxiv_id_is_arxiv":true,"paper":"/paper/arms-antithetic-reinforce-multi-sample","title":"ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variables","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alekdimi/arms","path":"toy_problem.py","file_url":"https://github.com/alekdimi/arms/blob/HEAD/toy_problem.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1debb17e331217b","code_sha256_prefix":"a1debb17e331217b","mcp_get_code":{"code_sha256":"a1debb17e331217b"}},{"arxiv_id":"2105.01736","arxiv_id_is_arxiv":true,"paper":"/paper/retrieving-complex-tables-with-multi-granular","title":"Retrieving Complex Tables with Multi-Granular Graph Representation Learning","date":"2021-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FeiWang96/GTR","path":"src/train/run_cross_validation.py","file_url":"https://github.com/FeiWang96/GTR/blob/HEAD/src/train/run_cross_validation.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":"e8f11851ef9e975c","code_sha256_prefix":"e8f11851ef9e975c","mcp_get_code":{"code_sha256":"e8f11851ef9e975c"}},{"arxiv_id":"2105.01029","arxiv_id_is_arxiv":true,"paper":"/paper/initialization-and-regularization-of-1","title":"Initialization and Regularization of Factorized Neural Layers","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/fnl_paper","path":"pytorch_resnet_cifar10/trainer.py","file_url":"https://github.com/microsoft/fnl_paper/blob/HEAD/pytorch_resnet_cifar10/trainer.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":"d3cf977044db121a","code_sha256_prefix":"d3cf977044db121a","mcp_get_code":{"code_sha256":"d3cf977044db121a"}},{"arxiv_id":"2104.09841","arxiv_id_is_arxiv":true,"paper":"/paper/selfreg-self-supervised-contrastive","title":"SelfReg: Self-supervised Contrastive Regularization for Domain Generalization","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dnap512/SelfReg","path":"codes/utils.py","file_url":"https://github.com/dnap512/SelfReg/blob/HEAD/codes/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":"7da8bd516ea288eb","code_sha256_prefix":"7da8bd516ea288eb","mcp_get_code":{"code_sha256":"7da8bd516ea288eb"}},{"arxiv_id":"2104.08313","arxiv_id_is_arxiv":true,"paper":"/paper/does-language-help-generalization-in-vision","title":"Does language help generalization in vision models?","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdvllrs/generalization-vision","path":"tasks/transfer_learning.py","file_url":"https://github.com/bdvllrs/generalization-vision/blob/HEAD/tasks/transfer_learning.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a59d584793b07994","code_sha256_prefix":"a59d584793b07994","mcp_get_code":{"code_sha256":"a59d584793b07994"}},{"arxiv_id":"2104.07916","arxiv_id_is_arxiv":true,"paper":"/paper/polynomial-networks-in-deep-classifiers","title":"Augmenting Deep Classifiers with Polynomial Neural Networks","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grigorisg9gr/polynomials-for-augmenting-nns","path":"train_main.py","file_url":"https://github.com/grigorisg9gr/polynomials-for-augmenting-nns/blob/HEAD/train_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, grigorisg9gr/polynomials-for-augmenting-nns (NOASSERTION)","code_sha256":"d34749988dc5e61f","code_sha256_prefix":"d34749988dc5e61f","mcp_get_code":{"code_sha256":"d34749988dc5e61f"}},{"arxiv_id":"2104.04017","arxiv_id_is_arxiv":true,"paper":"/paper/improving-solar-cell-metallization-designs","title":"Improving Solar Cell Metallization Designs using Convolutional Neural Networks","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lqycrystal/SolarNet_plus","path":"dlcode/trainsolarnet.py","file_url":"https://github.com/lqycrystal/SolarNet_plus/blob/HEAD/dlcode/trainsolarnet.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, lqycrystal/SolarNet_plus when it was checked","code_sha256":"12fd385268987f5c","code_sha256_prefix":"12fd385268987f5c","mcp_get_code":{"code_sha256":"12fd385268987f5c"}},{"arxiv_id":"2104.01396","arxiv_id_is_arxiv":true,"paper":"/paper/property-driven-training-all-you-n-ever","title":"Neural Network Robustness as a Verification Property: A Principled Case Study","date":"2021-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aisec-private/training-with-constraints","path":"src/mainPGD.py","file_url":"https://github.com/aisec-private/training-with-constraints/blob/HEAD/src/mainPGD.py","status":"unverified","verification_level":0,"contract_check":null,"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, aisec-private/training-with-constraints, is not in the permissive set Syntology serves inline","code_sha256":"02fd874161e61abd","code_sha256_prefix":"02fd874161e61abd","mcp_get_code":{"code_sha256":"02fd874161e61abd"}},{"arxiv_id":"2103.12913","arxiv_id_is_arxiv":true,"paper":"/paper/improved-estimation-of-concentration-under-1","title":"Improved Estimation of Concentration Under $\\ell_p$-Norm Distance Metrics Using Half Spaces","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackbprescott/EMC_HalfSpaces","path":"evaluation_utils.py","file_url":"https://github.com/jackbprescott/EMC_HalfSpaces/blob/HEAD/evaluation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd8aca0c2fc5d6bd","code_sha256_prefix":"cd8aca0c2fc5d6bd","mcp_get_code":{"code_sha256":"cd8aca0c2fc5d6bd"}},{"arxiv_id":"2103.12171","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-feature-augmentation-and","title":"Adversarial Feature Augmentation and Normalization for Visual Recognition","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/CV_A-FAN","path":"Classification/main_base.py","file_url":"https://github.com/VITA-Group/CV_A-FAN/blob/HEAD/Classification/main_base.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":"a21162e8545743de","code_sha256_prefix":"a21162e8545743de","mcp_get_code":{"code_sha256":"a21162e8545743de"}},{"arxiv_id":"2103.02695","arxiv_id_is_arxiv":true,"paper":"/paper/shift-invariance-can-reduce-adversarial","title":"Shift Invariance Can Reduce Adversarial Robustness","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SongweiGe/shift-invariance-adv-robustness","path":"5_1_1/train_mnist_full.py","file_url":"https://github.com/SongweiGe/shift-invariance-adv-robustness/blob/HEAD/5_1_1/train_mnist_full.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, SongweiGe/shift-invariance-adv-robustness when it was checked","code_sha256":"9818a179216a2b9a","code_sha256_prefix":"9818a179216a2b9a","mcp_get_code":{"code_sha256":"9818a179216a2b9a"}},{"arxiv_id":"2102.07623","arxiv_id_is_arxiv":true,"paper":"/paper/fedbn-federated-learning-on-non-iid-features-1","title":"FedBN: Federated Learning on Non-IID Features via Local Batch Normalization","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"med-air/FedBN","path":"federated/fed_digits.py","file_url":"https://github.com/med-air/FedBN/blob/HEAD/federated/fed_digits.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, med-air/FedBN when it was checked","code_sha256":"ecb6e27008c12b2b","code_sha256_prefix":"ecb6e27008c12b2b","mcp_get_code":{"code_sha256":"ecb6e27008c12b2b"}},{"arxiv_id":"2102.05096","arxiv_id_is_arxiv":true,"paper":"/paper/adversarially-robust-classifier-with","title":"Towards Bridging the gap between Empirical and Certified Robustness against Adversarial Examples","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hadisalman/smoothing-adversarial","path":"code/train_pgd.py","file_url":"https://github.com/Hadisalman/smoothing-adversarial/blob/HEAD/code/train_pgd.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":"44eff0215f284676","code_sha256_prefix":"44eff0215f284676","mcp_get_code":{"code_sha256":"44eff0215f284676"}},{"arxiv_id":"2011.08939","arxiv_id_is_arxiv":true,"paper":"/paper/dual-stream-multiple-instance-learning","title":"Dual-stream Multiple Instance Learning Network for Whole Slide Image Classification with Self-supervised Contrastive Learning","date":"2020-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"binli123/dsmil-wsi","path":"train_tcga.py","file_url":"https://github.com/binli123/dsmil-wsi/blob/HEAD/train_tcga.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":"f3e5d5f346f71eab","code_sha256_prefix":"f3e5d5f346f71eab","mcp_get_code":{"code_sha256":"f3e5d5f346f71eab"}},{"arxiv_id":"2011.01424","arxiv_id_is_arxiv":true,"paper":"/paper/in-defense-of-feature-mimicking-for-knowledge","title":"Distilling Knowledge by Mimicking Features","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoctorKey/LSHFM.singleclassification","path":"imagenet_lsh.py","file_url":"https://github.com/DoctorKey/LSHFM.singleclassification/blob/HEAD/imagenet_lsh.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, DoctorKey/LSHFM.singleclassification when it was checked","code_sha256":"c1601433df697b2a","code_sha256_prefix":"c1601433df697b2a","mcp_get_code":{"code_sha256":"c1601433df697b2a"}},{"arxiv_id":"2010.13993","arxiv_id_is_arxiv":true,"paper":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/CorrectAndSmooth","path":"gen_models.py","file_url":"https://github.com/CUAI/CorrectAndSmooth/blob/HEAD/gen_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CUAI/CorrectAndSmooth when it was checked","code_sha256":"fac9425843013f50","code_sha256_prefix":"fac9425843013f50","mcp_get_code":{"code_sha256":"fac9425843013f50"}},{"arxiv_id":"2010.13993","arxiv_id_is_arxiv":true,"paper":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyx/gtrick","path":"benchmark/dgl/graph_pred.py","file_url":"https://github.com/sangyx/gtrick/blob/HEAD/benchmark/dgl/graph_pred.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":"4254dbfb6411b68f","code_sha256_prefix":"4254dbfb6411b68f","mcp_get_code":{"code_sha256":"4254dbfb6411b68f"}},{"arxiv_id":"2010.13902","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-with-augmentations","title":"Graph Contrastive Learning with Augmentations","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GraphCL_Automated","path":"transferLearning_MoleculeNet_PPI_LP/bio/pretrain_generative_infobn.py","file_url":"https://github.com/Shen-Lab/GraphCL_Automated/blob/HEAD/transferLearning_MoleculeNet_PPI_LP/bio/pretrain_generative_infobn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, Shen-Lab/GraphCL_Automated when it was checked","code_sha256":"84567ef3dc4cb159","code_sha256_prefix":"84567ef3dc4cb159","mcp_get_code":{"code_sha256":"84567ef3dc4cb159"}},{"arxiv_id":"2010.13337","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pre-training-by-adversarial","title":"Robust Pre-Training by Adversarial Contrastive Learning","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/adversarial-contrastive-learning","path":"train_simCLR.py","file_url":"https://github.com/vita-group/adversarial-contrastive-learning/blob/HEAD/train_simCLR.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, vita-group/adversarial-contrastive-learning when it was checked","code_sha256":"6686dd42e643aff5","code_sha256_prefix":"6686dd42e643aff5","mcp_get_code":{"code_sha256":"6686dd42e643aff5"}},{"arxiv_id":"2010.09515","arxiv_id_is_arxiv":true,"paper":"/paper/improving-transformation-invariance-in-1","title":"Improving Transformation Invariance in Contrastive Representation Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ae-foster/invclr","path":"invclr.py","file_url":"https://github.com/ae-foster/invclr/blob/HEAD/invclr.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":"e85d165d8a854a57","code_sha256_prefix":"e85d165d8a854a57","mcp_get_code":{"code_sha256":"e85d165d8a854a57"}},{"arxiv_id":"2010.08895","arxiv_id_is_arxiv":true,"paper":"/paper/fourier-neural-operator-for-parametric-1","title":"Fourier Neural Operator for Parametric Partial Differential Equations","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sala-group/autows-bench-101","path":"datasets/domainnet/generate_dataset.py","file_url":"https://github.com/sala-group/autows-bench-101/blob/HEAD/datasets/domainnet/generate_dataset.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":"6a451e4111fcdd7e","code_sha256_prefix":"6a451e4111fcdd7e","mcp_get_code":{"code_sha256":"6a451e4111fcdd7e"}},{"arxiv_id":"2010.07565","arxiv_id_is_arxiv":true,"paper":"/paper/bi-gcn-binary-graph-convolutional-network","title":"Bi-GCN: Binary Graph Convolutional Network","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bywmm/Bi-GCN","path":"inductive-gs-bignn.py","file_url":"https://github.com/bywmm/Bi-GCN/blob/HEAD/inductive-gs-bignn.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, bywmm/Bi-GCN when it was checked","code_sha256":"0fd5a5eb8d6afdf7","code_sha256_prefix":"0fd5a5eb8d6afdf7","mcp_get_code":{"code_sha256":"0fd5a5eb8d6afdf7"}},{"arxiv_id":"2010.06300","arxiv_id_is_arxiv":true,"paper":"/paper/mixco-mix-up-contrastive-learning-for-visual","title":"MixCo: Mix-up Contrastive Learning for Visual Representation","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lee-Gihun/MixCo-Mixup-Contrast","path":"moco/pretrain.py","file_url":"https://github.com/Lee-Gihun/MixCo-Mixup-Contrast/blob/HEAD/moco/pretrain.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":"346148e635559cbb","code_sha256_prefix":"346148e635559cbb","mcp_get_code":{"code_sha256":"346148e635559cbb"}},{"arxiv_id":"2010.05700","arxiv_id_is_arxiv":true,"paper":"/paper/reformulating-unsupervised-style-transfer-as","title":"Reformulating Unsupervised Style Transfer as Paraphrase Generation","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martiansideofthemoon/style-transfer-paraphrase","path":"style_paraphrase/run_lm_finetuning.py","file_url":"https://github.com/martiansideofthemoon/style-transfer-paraphrase/blob/HEAD/style_paraphrase/run_lm_finetuning.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":"dc55a6c3d8f5d0f0","code_sha256_prefix":"dc55a6c3d8f5d0f0","mcp_get_code":{"code_sha256":"dc55a6c3d8f5d0f0"}},{"arxiv_id":"2009.14416","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-kernel-transfer-in-knowledge","title":"Improved Knowledge Distillation via Full Kernel Matrix Transfer","date":"2020-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idstcv/kda","path":"main_kda.py","file_url":"https://github.com/idstcv/kda/blob/HEAD/main_kda.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":"f5802bd2a5722722","code_sha256_prefix":"f5802bd2a5722722","mcp_get_code":{"code_sha256":"f5802bd2a5722722"}},{"arxiv_id":"2009.11407","arxiv_id_is_arxiv":true,"paper":"/paper/steering-a-historical-disease-forecasting","title":"Steering a Historical Disease Forecasting Model Under a Pandemic: Case of Flu and COVID-19","date":"2020-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdityaLab/CALI-Net","path":"model_scripts/exog_model_utils.py","file_url":"https://github.com/AdityaLab/CALI-Net/blob/HEAD/model_scripts/exog_model_utils.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":"f3e8884f0025f1da","code_sha256_prefix":"f3e8884f0025f1da","mcp_get_code":{"code_sha256":"f3e8884f0025f1da"}},{"arxiv_id":"2009.00647","arxiv_id_is_arxiv":true,"paper":"/paper/lifelong-graph-learning","title":"Lifelong Graph Learning","date":"2020-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-chen/lgl-action-recognition","path":"regular.py","file_url":"https://github.com/wang-chen/lgl-action-recognition/blob/HEAD/regular.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":"d76980f73de94b11","code_sha256_prefix":"d76980f73de94b11","mcp_get_code":{"code_sha256":"d76980f73de94b11"}},{"arxiv_id":"2008.05660","arxiv_id_is_arxiv":true,"paper":"/paper/imitating-unknown-policies-via-exploration","title":"Imitating Unknown Policies via Exploration","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"65faa99ef0c486da","code_sha256_prefix":"65faa99ef0c486da","mcp_get_code":{"code_sha256":"65faa99ef0c486da"}},{"arxiv_id":"2008.05660","arxiv_id_is_arxiv":true,"paper":"/paper/imitating-unknown-policies-via-exploration","title":"Imitating Unknown Policies via Exploration","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"6cb5bfd9f6b92a48","code_sha256_prefix":"6cb5bfd9f6b92a48","mcp_get_code":{"code_sha256":"6cb5bfd9f6b92a48"}},{"arxiv_id":"2008.03781","arxiv_id_is_arxiv":true,"paper":"/paper/semeval-2020-task-8-memotion-analysis-the","title":"SemEval-2020 Task 8: Memotion Analysis -- The Visuo-Lingual Metaphor!","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terenceylchow124/Meme-MultiModal","path":"utils/util_train.py","file_url":"https://github.com/terenceylchow124/Meme-MultiModal/blob/HEAD/utils/util_train.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":"0f216dad249caa43","code_sha256_prefix":"0f216dad249caa43","mcp_get_code":{"code_sha256":"0f216dad249caa43"}},{"arxiv_id":"2008.03781","arxiv_id_is_arxiv":true,"paper":"/paper/semeval-2020-task-8-memotion-analysis-the","title":"SemEval-2020 Task 8: Memotion Analysis -- The Visuo-Lingual Metaphor!","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terenceylchow124/Meme-MultiModal","path":"utils/util_train_reddit.py","file_url":"https://github.com/terenceylchow124/Meme-MultiModal/blob/HEAD/utils/util_train_reddit.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":"9030dcfb2479a83f","code_sha256_prefix":"9030dcfb2479a83f","mcp_get_code":{"code_sha256":"9030dcfb2479a83f"}},{"arxiv_id":"2007.16189","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-through-the-eyes-of","title":"Self-supervised learning through the eyes of a child","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agentic-learning-ai-lab/memory-storyboard","path":"linear_decoding.py","file_url":"https://github.com/agentic-learning-ai-lab/memory-storyboard/blob/HEAD/linear_decoding.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":"9e8c24c5b951741f","code_sha256_prefix":"9e8c24c5b951741f","mcp_get_code":{"code_sha256":"9e8c24c5b951741f"}},{"arxiv_id":"2007.16189","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-through-the-eyes-of","title":"Self-supervised learning through the eyes of a child","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eminorhan/baby-vision","path":"temporal_classification.py","file_url":"https://github.com/eminorhan/baby-vision/blob/HEAD/temporal_classification.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":"68e213dd1bd7c775","code_sha256_prefix":"68e213dd1bd7c775","mcp_get_code":{"code_sha256":"68e213dd1bd7c775"}},{"arxiv_id":"2007.15829","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-bipartite-graph-learning-for","title":"Adversarial Bipartite Graph Learning for Video Domain Adaptation","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Luoyadan/MM2020_ABG","path":"main_G.py","file_url":"https://github.com/Luoyadan/MM2020_ABG/blob/HEAD/main_G.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":"93d1e6f74e435e53","code_sha256_prefix":"93d1e6f74e435e53","mcp_get_code":{"code_sha256":"93d1e6f74e435e53"}},{"arxiv_id":"2007.14612","arxiv_id_is_arxiv":true,"paper":"/paper/clarinet-a-one-step-approach-towards-budget","title":"Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation","date":"2020-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiyang98/BFUDA","path":"ours/train_mu_et.py","file_url":"https://github.com/Yiyang98/BFUDA/blob/HEAD/ours/train_mu_et.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, Yiyang98/BFUDA when it was checked","code_sha256":"8e2bb8b7806a57d8","code_sha256_prefix":"8e2bb8b7806a57d8","mcp_get_code":{"code_sha256":"8e2bb8b7806a57d8"}},{"arxiv_id":"2007.10396","arxiv_id_is_arxiv":true,"paper":"/paper/nsganetv2-evolutionary-multi-objective","title":"NSGANetV2: Evolutionary Multi-Objective Surrogate-Assisted Neural Architecture Search","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikelzc1990/nsganetv2","path":"train_cifar.py","file_url":"https://github.com/mikelzc1990/nsganetv2/blob/HEAD/train_cifar.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":"22ac9a49daa933c8","code_sha256_prefix":"22ac9a49daa933c8","mcp_get_code":{"code_sha256":"22ac9a49daa933c8"}},{"arxiv_id":"2007.04780","arxiv_id_is_arxiv":true,"paper":"/paper/modelling-the-distribution-of-3d-brain-mri","title":"Modelling the Distribution of 3D Brain MRI using a 2D Slice VAE","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voanna/slices-to-3d-brain-vae","path":"experiments/MICCAI-release-version/main_experiment_128.py","file_url":"https://github.com/voanna/slices-to-3d-brain-vae/blob/HEAD/experiments/MICCAI-release-version/main_experiment_128.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":"645a059ea71dbdad","code_sha256_prefix":"645a059ea71dbdad","mcp_get_code":{"code_sha256":"645a059ea71dbdad"}},{"arxiv_id":"2006.16811","arxiv_id_is_arxiv":true,"paper":"/paper/path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuGuangWang/PAN","path":"pan_benchmark.py","file_url":"https://github.com/YuGuangWang/PAN/blob/HEAD/pan_benchmark.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, YuGuangWang/PAN when it was checked","code_sha256":"06310f50e77e9c42","code_sha256_prefix":"06310f50e77e9c42","mcp_get_code":{"code_sha256":"06310f50e77e9c42"}},{"arxiv_id":"2006.12557","arxiv_id_is_arxiv":true,"paper":"/paper/just-how-toxic-is-data-poisoning-a-unified","title":"Just How Toxic is Data Poisoning? A Unified Benchmark for Backdoor and Data Poisoning Attacks","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aks2203/poisoning-benchmark","path":"learning_module.py","file_url":"https://github.com/aks2203/poisoning-benchmark/blob/HEAD/learning_module.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":"dae30877338a6c11","code_sha256_prefix":"dae30877338a6c11","mcp_get_code":{"code_sha256":"dae30877338a6c11"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dataflowr/notebooks","path":"Module13/seq2seq.py","file_url":"https://github.com/dataflowr/notebooks/blob/HEAD/Module13/seq2seq.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":"2c594da18d824eb0","code_sha256_prefix":"2c594da18d824eb0","mcp_get_code":{"code_sha256":"2c594da18d824eb0"}},{"arxiv_id":"2006.11165","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-to-graph-neural-networks","title":"Backdoor Attacks to Graph Neural Networks","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/graphbackdoor","path":"main_backdoor.py","file_url":"https://github.com/zaixizhang/graphbackdoor/blob/HEAD/main_backdoor.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, zaixizhang/graphbackdoor when it was checked","code_sha256":"d732e969a4a813f1","code_sha256_prefix":"d732e969a4a813f1","mcp_get_code":{"code_sha256":"d732e969a4a813f1"}},{"arxiv_id":"2006.10876","arxiv_id_is_arxiv":true,"paper":"/paper/beware-the-black-box-on-the-robustness-of","title":"Beware the Black-Box: on the Robustness of Recent Defenses to Adversarial Examples","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiaojunQAQ/Comdefend","path":"Train_comdefend_Torch.py","file_url":"https://github.com/jiaxiaojunQAQ/Comdefend/blob/HEAD/Train_comdefend_Torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, jiaxiaojunQAQ/Comdefend when it was checked","code_sha256":"b2e1abf5ebf26a32","code_sha256_prefix":"b2e1abf5ebf26a32","mcp_get_code":{"code_sha256":"b2e1abf5ebf26a32"}},{"arxiv_id":"2006.10138","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-online-method-for","title":"An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiqi-helloworld/recover","path":"RECOVER.py","file_url":"https://github.com/qiqi-helloworld/recover/blob/HEAD/RECOVER.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, qiqi-helloworld/recover when it was checked","code_sha256":"d43665fefeff80ac","code_sha256_prefix":"d43665fefeff80ac","mcp_get_code":{"code_sha256":"d43665fefeff80ac"}},{"arxiv_id":"2006.08572","arxiv_id_is_arxiv":true,"paper":"/paper/flexible-dataset-distillation-learn-labels","title":"Flexible Dataset Distillation: Learn Labels Instead of Images","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ondrejbohdal/label-distillation","path":"label_distillation_or2.py","file_url":"https://github.com/ondrejbohdal/label-distillation/blob/HEAD/label_distillation_or2.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":"c3716d20e4588723","code_sha256_prefix":"c3716d20e4588723","mcp_get_code":{"code_sha256":"c3716d20e4588723"}},{"arxiv_id":"2006.07846","arxiv_id_is_arxiv":true,"paper":"/paper/from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omri1348/LRGA","path":"ogb/examples/linkproppred/collab/gnn.py","file_url":"https://github.com/omri1348/LRGA/blob/HEAD/ogb/examples/linkproppred/collab/gnn.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, omri1348/LRGA when it was checked","code_sha256":"a2328b5e3445a490","code_sha256_prefix":"a2328b5e3445a490","mcp_get_code":{"code_sha256":"a2328b5e3445a490"}},{"arxiv_id":"2006.07356","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-bias-of-gradient-descent-for-mean","title":"Implicit Bias of Gradient Descent for Mean Squared Error Regression with Two-Layer Wide Neural Networks","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huijin12/implicit_bias_wide_neural_networks","path":"normal_train.py","file_url":"https://github.com/huijin12/implicit_bias_wide_neural_networks/blob/HEAD/normal_train.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, huijin12/implicit_bias_wide_neural_networks when it was checked","code_sha256":"3437e864aaf0d5a2","code_sha256_prefix":"3437e864aaf0d5a2","mcp_get_code":{"code_sha256":"3437e864aaf0d5a2"}},{"arxiv_id":"2006.04292","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yromano/fair_dummies","path":"others/adv_debiasing.py","file_url":"https://github.com/yromano/fair_dummies/blob/HEAD/others/adv_debiasing.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":"f6d9e0317d4ec628","code_sha256_prefix":"f6d9e0317d4ec628","mcp_get_code":{"code_sha256":"f6d9e0317d4ec628"}},{"arxiv_id":"2006.03806","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-the-feature-distribution-in","title":"Leveraging the Feature Distribution in Transfer-based Few-Shot Learning","date":"2020-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbonto/fewshot_neuroimaging_classification","path":"SimpleShot/functions.py","file_url":"https://github.com/mbonto/fewshot_neuroimaging_classification/blob/HEAD/SimpleShot/functions.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":"d5f7aba697839f38","code_sha256_prefix":"d5f7aba697839f38","mcp_get_code":{"code_sha256":"d5f7aba697839f38"}},{"arxiv_id":"2005.13239","arxiv_id_is_arxiv":true,"paper":"/paper/mopo-model-based-offline-policy-optimization","title":"MOPO: Model-based Offline Policy Optimization","date":"2020-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runamu/compositional-conservatism","path":"run_example/run_mopo.py","file_url":"https://github.com/runamu/compositional-conservatism/blob/HEAD/run_example/run_mopo.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":"2c8a2717c213a768","code_sha256_prefix":"2c8a2717c213a768","mcp_get_code":{"code_sha256":"2c8a2717c213a768"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junzhuang-code/graphss","path":"graphSS/models_SS.py","file_url":"https://github.com/junzhuang-code/graphss/blob/HEAD/graphSS/models_SS.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":"433c0da03b15b2fb","code_sha256_prefix":"433c0da03b15b2fb","mcp_get_code":{"code_sha256":"433c0da03b15b2fb"}},{"arxiv_id":"2005.10150","arxiv_id_is_arxiv":true,"paper":"/paper/gcn-based-user-representation-learning-for","title":"GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detection","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zsjdddhr/GraphRfi","path":"run_GraphRfi_example.py","file_url":"https://github.com/zsjdddhr/GraphRfi/blob/HEAD/run_GraphRfi_example.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, zsjdddhr/GraphRfi when it was checked","code_sha256":"ebd7d6c60dcd0310","code_sha256_prefix":"ebd7d6c60dcd0310","mcp_get_code":{"code_sha256":"ebd7d6c60dcd0310"}},{"arxiv_id":"2005.01856","arxiv_id_is_arxiv":true,"paper":"/paper/designing-data-augmentation-for-simulating","title":"Selecting Data Augmentation for Simulating Interventions","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DataAugmentationInterventions","path":"PACS/fine_tune_alexnet.py","file_url":"https://github.com/AMLab-Amsterdam/DataAugmentationInterventions/blob/HEAD/PACS/fine_tune_alexnet.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":"e5b4aa10ff210951","code_sha256_prefix":"e5b4aa10ff210951","mcp_get_code":{"code_sha256":"e5b4aa10ff210951"}},{"arxiv_id":"2005.01856","arxiv_id_is_arxiv":true,"paper":"/paper/designing-data-augmentation-for-simulating","title":"Selecting Data Augmentation for Simulating Interventions","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DataAugmentationInterventions","path":"PACS/fine_tune_alexnet_domain_classifier.py","file_url":"https://github.com/AMLab-Amsterdam/DataAugmentationInterventions/blob/HEAD/PACS/fine_tune_alexnet_domain_classifier.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":"90a975015834910a","code_sha256_prefix":"90a975015834910a","mcp_get_code":{"code_sha256":"90a975015834910a"}},{"arxiv_id":"2004.11362","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raymin0223/self-contrastive-learning","path":"main_represent.py","file_url":"https://github.com/raymin0223/self-contrastive-learning/blob/HEAD/main_represent.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":"d8660dac176225e1","code_sha256_prefix":"d8660dac176225e1","mcp_get_code":{"code_sha256":"d8660dac176225e1"}},{"arxiv_id":"2004.11362","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raymin0223/self-contrastive-learning","path":"main_linear.py","file_url":"https://github.com/raymin0223/self-contrastive-learning/blob/HEAD/main_linear.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":"18ee2c887bb737f7","code_sha256_prefix":"18ee2c887bb737f7","mcp_get_code":{"code_sha256":"18ee2c887bb737f7"}},{"arxiv_id":"2004.11198","arxiv_id_is_arxiv":true,"paper":"/paper/sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twitter-research/sign","path":"sign_training.py","file_url":"https://github.com/twitter-research/sign/blob/HEAD/sign_training.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":"17c5046a153ae409","code_sha256_prefix":"17c5046a153ae409","mcp_get_code":{"code_sha256":"17c5046a153ae409"}},{"arxiv_id":"2004.03706","arxiv_id_is_arxiv":true,"paper":"/paper/long-tailed-recognition-using-class-balanced","title":"Long-Tailed Recognition Using Class-Balanced Experts","date":"2020-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssfootball04/class-balanced-experts","path":"jointCalibration.py","file_url":"https://github.com/ssfootball04/class-balanced-experts/blob/HEAD/jointCalibration.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":"077e42d8357a996a","code_sha256_prefix":"077e42d8357a996a","mcp_get_code":{"code_sha256":"077e42d8357a996a"}},{"arxiv_id":"2003.13880","arxiv_id_is_arxiv":true,"paper":"/paper/muxconv-information-multiplexing-in","title":"MUXConv: Information Multiplexing in Convolutional Neural Networks","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human-analysis/MUXConv","path":"transfer_cifar.py","file_url":"https://github.com/human-analysis/MUXConv/blob/HEAD/transfer_cifar.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, human-analysis/MUXConv when it was checked","code_sha256":"86268981ba436430","code_sha256_prefix":"86268981ba436430","mcp_get_code":{"code_sha256":"86268981ba436430"}},{"arxiv_id":"2003.08934","arxiv_id_is_arxiv":true,"paper":"/paper/nerf-representing-scenes-as-neural-radiance","title":"NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"NeRF_Representing_Scenes_as_Neural_Radiance_Fields_for_View_Synthesis/nerf.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/NeRF_Representing_Scenes_as_Neural_Radiance_Fields_for_View_Synthesis/nerf.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":"72ae52782cdecbe7","code_sha256_prefix":"72ae52782cdecbe7","mcp_get_code":{"code_sha256":"72ae52782cdecbe7"}},{"arxiv_id":"2003.08934","arxiv_id_is_arxiv":true,"paper":"/paper/nerf-representing-scenes-as-neural-radiance","title":"NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kklemon/gon-pytorch","path":"train_gon.py","file_url":"https://github.com/kklemon/gon-pytorch/blob/HEAD/train_gon.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":"b06ced583714627c","code_sha256_prefix":"b06ced583714627c","mcp_get_code":{"code_sha256":"b06ced583714627c"}},{"arxiv_id":"2003.04297","arxiv_id_is_arxiv":true,"paper":"/paper/improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1170500804/MoCo","path":"main_lincls.py","file_url":"https://github.com/1170500804/MoCo/blob/HEAD/main_lincls.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, 1170500804/MoCo (NOASSERTION)","code_sha256":"efad379ea20fec59","code_sha256_prefix":"efad379ea20fec59","mcp_get_code":{"code_sha256":"efad379ea20fec59"}},{"arxiv_id":"2003.02944","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-neuron-and-synapse-filter-dynamics","title":"Exploiting Neuron and Synapse Filter Dynamics in Spatial Temporal Learning of Deep Spiking Neural Network","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyuchen/snn-iir","path":"snn_conv_1_gesture.py","file_url":"https://github.com/zhongyuchen/snn-iir/blob/HEAD/snn_conv_1_gesture.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":"d7e4ada9731bd191","code_sha256_prefix":"d7e4ada9731bd191","mcp_get_code":{"code_sha256":"d7e4ada9731bd191"}},{"arxiv_id":"2002.11807","arxiv_id_is_arxiv":true,"paper":"/paper/glas-global-to-local-safe-autonomy-synthesis","title":"GLAS: Global-to-Local Safe Autonomy Synthesis for Multi-Robot Motion Planning with End-to-End Learning","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"bpriviere/glas","path":"code/train_il.py","file_url":"https://github.com/bpriviere/glas/blob/HEAD/code/train_il.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":"f0dc37e6d72f2249","code_sha256_prefix":"f0dc37e6d72f2249","mcp_get_code":{"code_sha256":"f0dc37e6d72f2249"}},{"arxiv_id":"2002.11102","arxiv_id_is_arxiv":true,"paper":"/paper/on-feature-normalization-and-data","title":"On Feature Normalization and Data Augmentation","date":"2020-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Boyiliee/MoEx","path":"ImageNet/main_moex.py","file_url":"https://github.com/Boyiliee/MoEx/blob/HEAD/ImageNet/main_moex.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":"750382b7eb3ffbc5","code_sha256_prefix":"750382b7eb3ffbc5","mcp_get_code":{"code_sha256":"750382b7eb3ffbc5"}},{"arxiv_id":"2002.11102","arxiv_id_is_arxiv":true,"paper":"/paper/on-feature-normalization-and-data","title":"On Feature Normalization and Data Augmentation","date":"2020-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Boyiliee/MoEx","path":"ImageNet/main_moex_cutmix.py","file_url":"https://github.com/Boyiliee/MoEx/blob/HEAD/ImageNet/main_moex_cutmix.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":"78af1ef51a7861c5","code_sha256_prefix":"78af1ef51a7861c5","mcp_get_code":{"code_sha256":"78af1ef51a7861c5"}},{"arxiv_id":"2002.11102","arxiv_id_is_arxiv":true,"paper":"/paper/on-feature-normalization-and-data","title":"On Feature Normalization and Data Augmentation","date":"2020-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Boyiliee/MoEx","path":"ModelNet/pointnet2_classification_moex.py","file_url":"https://github.com/Boyiliee/MoEx/blob/HEAD/ModelNet/pointnet2_classification_moex.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":"c92643c0c22f35c2","code_sha256_prefix":"c92643c0c22f35c2","mcp_get_code":{"code_sha256":"c92643c0c22f35c2"}},{"arxiv_id":"2002.11102","arxiv_id_is_arxiv":true,"paper":"/paper/on-feature-normalization-and-data","title":"On Feature Normalization and Data Augmentation","date":"2020-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Boyiliee/MoEx","path":"CIFAR/train_moex.py","file_url":"https://github.com/Boyiliee/MoEx/blob/HEAD/CIFAR/train_moex.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":"0af00a0c1d3cde30","code_sha256_prefix":"0af00a0c1d3cde30","mcp_get_code":{"code_sha256":"0af00a0c1d3cde30"}},{"arxiv_id":"2002.06349","arxiv_id_is_arxiv":true,"paper":"/paper/hold-me-tight-influence-of-discriminative","title":"Hold me tight! Influence of discriminative features on deep network boundaries","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LTS4/hold-me-tight","path":"utils.py","file_url":"https://github.com/LTS4/hold-me-tight/blob/HEAD/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":"3ec95e9e5d9ba1bf","code_sha256_prefix":"3ec95e9e5d9ba1bf","mcp_get_code":{"code_sha256":"3ec95e9e5d9ba1bf"}},{"arxiv_id":"2002.04758","arxiv_id_is_arxiv":true,"paper":"/paper/salvaging-federated-learning-by-local","title":"Salvaging Federated Learning by Local Adaptation","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/federated_adaptation","path":"training.py","file_url":"https://github.com/ebagdasa/federated_adaptation/blob/HEAD/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":"2f2c95358bb2ba4b","code_sha256_prefix":"2f2c95358bb2ba4b","mcp_get_code":{"code_sha256":"2f2c95358bb2ba4b"}},{"arxiv_id":"2002.04758","arxiv_id_is_arxiv":true,"paper":"/paper/salvaging-federated-learning-by-local","title":"Salvaging Federated Learning by Local Adaptation","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SanaAwan5/FTLSimulation","path":"training.py","file_url":"https://github.com/SanaAwan5/FTLSimulation/blob/HEAD/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":"d1eabb8d72b78b3a","code_sha256_prefix":"d1eabb8d72b78b3a","mcp_get_code":{"code_sha256":"d1eabb8d72b78b3a"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongying-Deng/NorMatch","path":"train_fixmatch.py","file_url":"https://github.com/Zhongying-Deng/NorMatch/blob/HEAD/train_fixmatch.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":"92bbaed54dcdae65","code_sha256_prefix":"92bbaed54dcdae65","mcp_get_code":{"code_sha256":"92bbaed54dcdae65"}},{"arxiv_id":"2001.00705","arxiv_id_is_arxiv":true,"paper":"/paper/fractional-skipping-towards-finer-grained","title":"Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference","date":"2020-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/haq-release","path":"rl_quantize.py","file_url":"https://github.com/mit-han-lab/haq-release/blob/HEAD/rl_quantize.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":"d0be8747b3078aa4","code_sha256_prefix":"d0be8747b3078aa4","mcp_get_code":{"code_sha256":"d0be8747b3078aa4"}},{"arxiv_id":"1911.11834","arxiv_id_is_arxiv":true,"paper":"/paper/towards-fairness-in-visual-recognition","title":"Towards Fairness in Visual Recognition: Effective Strategies for Bias Mitigation","date":"2019-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjie1003/DL-Fairness-Study","path":"FAAP/train_deployed_model.py","file_url":"https://github.com/junjie1003/DL-Fairness-Study/blob/HEAD/FAAP/train_deployed_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":"d7fecd5203c15e82","code_sha256_prefix":"d7fecd5203c15e82","mcp_get_code":{"code_sha256":"d7fecd5203c15e82"}},{"arxiv_id":"1911.07389","arxiv_id_is_arxiv":true,"paper":"/paper/towards-visually-explaining-variational","title":"Towards Visually Explaining Variational Autoencoders","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrankBrongers/Reproducing_expVAE","path":"Anomaly_Detection/code/train_expVAE.py","file_url":"https://github.com/FrankBrongers/Reproducing_expVAE/blob/HEAD/Anomaly_Detection/code/train_expVAE.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, FrankBrongers/Reproducing_expVAE when it was checked","code_sha256":"0126207fc1b5cf8f","code_sha256_prefix":"0126207fc1b5cf8f","mcp_get_code":{"code_sha256":"0126207fc1b5cf8f"}},{"arxiv_id":"1911.07389","arxiv_id_is_arxiv":true,"paper":"/paper/towards-visually-explaining-variational","title":"Towards Visually Explaining Variational Autoencoders","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuem607/expVAE","path":"code/train_expVAE.py","file_url":"https://github.com/liuem607/expVAE/blob/HEAD/code/train_expVAE.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, liuem607/expVAE when it was checked","code_sha256":"35676bcbe6b2226a","code_sha256_prefix":"35676bcbe6b2226a","mcp_get_code":{"code_sha256":"35676bcbe6b2226a"}},{"arxiv_id":"1911.05856","arxiv_id_is_arxiv":true,"paper":"/paper/spiralnet-a-fast-and-highly-efficient-mesh","title":"SpiralNet++: A Fast and Highly Efficient Mesh Convolution Operator","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sw-gong/spiralnet_plus","path":"correspondence/train_eval.py","file_url":"https://github.com/sw-gong/spiralnet_plus/blob/HEAD/correspondence/train_eval.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":"2012ac47376905f7","code_sha256_prefix":"2012ac47376905f7","mcp_get_code":{"code_sha256":"2012ac47376905f7"}},{"arxiv_id":"1911.05856","arxiv_id_is_arxiv":true,"paper":"/paper/spiralnet-a-fast-and-highly-efficient-mesh","title":"SpiralNet++: A Fast and Highly Efficient Mesh Convolution Operator","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sw-gong/spiralnet_plus","path":"reconstruction/train_eval.py","file_url":"https://github.com/sw-gong/spiralnet_plus/blob/HEAD/reconstruction/train_eval.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":"5f92c0007cd5b74c","code_sha256_prefix":"5f92c0007cd5b74c","mcp_get_code":{"code_sha256":"5f92c0007cd5b74c"}},{"arxiv_id":"1911.03070","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-refinement-of-cross-lingual-word","title":"Interactive Refinement of Cross-Lingual Word Embeddings","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forest-snow/clime-ui","path":"model.py","file_url":"https://github.com/forest-snow/clime-ui/blob/HEAD/model.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":"80b24aafbca43d95","code_sha256_prefix":"80b24aafbca43d95","mcp_get_code":{"code_sha256":"80b24aafbca43d95"}},{"arxiv_id":"1910.03151","arxiv_id_is_arxiv":true,"paper":"/paper/eca-net-efficient-channel-attention-for-deep","title":"ECA-Net: Efficient Channel Attention for Deep Convolutional Neural Networks","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BangguWu/ECANet","path":"light_main.py","file_url":"https://github.com/BangguWu/ECANet/blob/HEAD/light_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":"aae02ce712945919","code_sha256_prefix":"aae02ce712945919","mcp_get_code":{"code_sha256":"aae02ce712945919"}},{"arxiv_id":"1910.00780","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unifying-neural-architecture-space","title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLDGroup/NN_Mass","path":"train_mlp.py","file_url":"https://github.com/SLDGroup/NN_Mass/blob/HEAD/train_mlp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0bd5cd7c711d4d1","code_sha256_prefix":"c0bd5cd7c711d4d1","mcp_get_code":{"code_sha256":"c0bd5cd7c711d4d1"}},{"arxiv_id":"1910.00780","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unifying-neural-architecture-space","title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SLDGroup/NN_Mass","path":"train_cifar.py","file_url":"https://github.com/SLDGroup/NN_Mass/blob/HEAD/train_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35d00fe15613b708","code_sha256_prefix":"35d00fe15613b708","mcp_get_code":{"code_sha256":"35d00fe15613b708"}},{"arxiv_id":"1909.13334","arxiv_id_is_arxiv":true,"paper":"/paper/symplectic-recurrent-neural-networks","title":"Symplectic Recurrent Neural Networks","date":"2019-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengdao-chen/SRNN","path":"src/run_experiments.py","file_url":"https://github.com/zhengdao-chen/SRNN/blob/HEAD/src/run_experiments.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, zhengdao-chen/SRNN (NOASSERTION)","code_sha256":"ed35fbcaa2f55107","code_sha256_prefix":"ed35fbcaa2f55107","mcp_get_code":{"code_sha256":"ed35fbcaa2f55107"}},{"arxiv_id":"1909.13082","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-2-generative-networks","title":"Wasserstein-2 Generative Networks","date":"2019-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lit-leo/inner-convex-nn","path":"vae/vanila_vae.py","file_url":"https://github.com/lit-leo/inner-convex-nn/blob/HEAD/vae/vanila_vae.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":"c5f18230130906c0","code_sha256_prefix":"c5f18230130906c0","mcp_get_code":{"code_sha256":"c5f18230130906c0"}},{"arxiv_id":"1909.01315","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dglai/dgl-0.5-benchmark","path":"end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.py","file_url":"https://github.com/dglai/dgl-0.5-benchmark/blob/HEAD/end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dglai/dgl-0.5-benchmark when it was checked","code_sha256":"dca95faa102e051a","code_sha256_prefix":"dca95faa102e051a","mcp_get_code":{"code_sha256":"dca95faa102e051a"}},{"arxiv_id":"1909.01315","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dglai/dgl-0.5-benchmark","path":"end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.py","file_url":"https://github.com/dglai/dgl-0.5-benchmark/blob/HEAD/end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.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, dglai/dgl-0.5-benchmark when it was checked","code_sha256":"44fd758f71d50278","code_sha256_prefix":"44fd758f71d50278","mcp_get_code":{"code_sha256":"44fd758f71d50278"}},{"arxiv_id":"1908.09979","arxiv_id_is_arxiv":true,"paper":"/paper/deephoyer-learning-sparser-neural-network","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanghr/DeepHoyer","path":"imagenet/main_group.py","file_url":"https://github.com/yanghr/DeepHoyer/blob/HEAD/imagenet/main_group.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":"396b51c81635919d","code_sha256_prefix":"396b51c81635919d","mcp_get_code":{"code_sha256":"396b51c81635919d"}},{"arxiv_id":"1908.09979","arxiv_id_is_arxiv":true,"paper":"/paper/deephoyer-learning-sparser-neural-network","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanghr/DeepHoyer","path":"imagenet/prun_tune.py","file_url":"https://github.com/yanghr/DeepHoyer/blob/HEAD/imagenet/prun_tune.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":"eb96629937f51120","code_sha256_prefix":"eb96629937f51120","mcp_get_code":{"code_sha256":"eb96629937f51120"}},{"arxiv_id":"1908.02899","arxiv_id_is_arxiv":true,"paper":"/paper/do-neural-language-representations-learn","title":"Do Neural Language Representations Learn Physical Commonsense?","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbforbes/physical-commonsense","path":"pc/models.py","file_url":"https://github.com/mbforbes/physical-commonsense/blob/HEAD/pc/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbc487522630ed47","code_sha256_prefix":"bbc487522630ed47","mcp_get_code":{"code_sha256":"bbc487522630ed47"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blawok/named-entity-recognition","path":"src/source_roberta/train_roberta.py","file_url":"https://github.com/blawok/named-entity-recognition/blob/HEAD/src/source_roberta/train_roberta.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":"92e80bcaa1f41216","code_sha256_prefix":"92e80bcaa1f41216","mcp_get_code":{"code_sha256":"92e80bcaa1f41216"}},{"arxiv_id":"1907.01108","arxiv_id_is_arxiv":true,"paper":"/paper/language2pose-natural-language-grounded-pose","title":"Language2Pose: Natural Language Grounded Pose Forecasting","date":"2019-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chahuja/language2pose","path":"src/train_wordConditioned.py","file_url":"https://github.com/chahuja/language2pose/blob/HEAD/src/train_wordConditioned.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":"bdffbd4b7a7df991","code_sha256_prefix":"bdffbd4b7a7df991","mcp_get_code":{"code_sha256":"bdffbd4b7a7df991"}},{"arxiv_id":"1907.00865","arxiv_id_is_arxiv":true,"paper":"/paper/radial-bayesian-neural-networks-robust","title":"Radial Bayesian Neural Networks: Beyond Discrete Support In Large-Scale Bayesian Deep Learning","date":"2019-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"5cc87715e60867cd","code_sha256_prefix":"5cc87715e60867cd","mcp_get_code":{"code_sha256":"5cc87715e60867cd"}},{"arxiv_id":"1906.09525","arxiv_id_is_arxiv":true,"paper":"/paper/defending-against-adversarial-examples-with-k","title":"Defending Against Adversarial Examples with K-Nearest Neighbor","date":"2019-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chawins/knn-defense","path":"train_scripts/train_mnist.py","file_url":"https://github.com/chawins/knn-defense/blob/HEAD/train_scripts/train_mnist.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":"05daa04a69782bd6","code_sha256_prefix":"05daa04a69782bd6","mcp_get_code":{"code_sha256":"05daa04a69782bd6"}},{"arxiv_id":"1906.02174","arxiv_id_is_arxiv":true,"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PwnerHarry/Stronger_GCN","path":"PyTorch/utils.py","file_url":"https://github.com/PwnerHarry/Stronger_GCN/blob/HEAD/PyTorch/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":"03af7551a7b7d050","code_sha256_prefix":"03af7551a7b7d050","mcp_get_code":{"code_sha256":"03af7551a7b7d050"}},{"arxiv_id":"1906.01195","arxiv_id_is_arxiv":true,"paper":"/paper/learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KXY-PUBLIC/NASE","path":"search.py","file_url":"https://github.com/KXY-PUBLIC/NASE/blob/HEAD/search.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, KXY-PUBLIC/NASE when it was checked","code_sha256":"dab3ba283314e6ec","code_sha256_prefix":"dab3ba283314e6ec","mcp_get_code":{"code_sha256":"dab3ba283314e6ec"}},{"arxiv_id":"1906.00642","arxiv_id_is_arxiv":true,"paper":"/paper/190600642","title":"A Variational Approach for Learning from Positive and Unlabeled Data","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HC-Feynman/vpu","path":"vpu.py","file_url":"https://github.com/HC-Feynman/vpu/blob/HEAD/vpu.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":"7d59f7376e28e787","code_sha256_prefix":"7d59f7376e28e787","mcp_get_code":{"code_sha256":"7d59f7376e28e787"}},{"arxiv_id":"1905.12265","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/pretrain-gnns","path":"bio/pretrain_contextpred.py","file_url":"https://github.com/snap-stanford/pretrain-gnns/blob/HEAD/bio/pretrain_contextpred.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":"4a6a649883d9c960","code_sha256_prefix":"4a6a649883d9c960","mcp_get_code":{"code_sha256":"4a6a649883d9c960"}},{"arxiv_id":"1905.12265","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/pretrain-gnns","path":"bio/pretrain_deepgraphinfomax.py","file_url":"https://github.com/snap-stanford/pretrain-gnns/blob/HEAD/bio/pretrain_deepgraphinfomax.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":"72b72fdcfbe3d398","code_sha256_prefix":"72b72fdcfbe3d398","mcp_get_code":{"code_sha256":"72b72fdcfbe3d398"}},{"arxiv_id":"1905.12265","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/pretrain-gnns","path":"bio/pretrain_edgepred.py","file_url":"https://github.com/snap-stanford/pretrain-gnns/blob/HEAD/bio/pretrain_edgepred.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":"b59818bdda2f75f5","code_sha256_prefix":"b59818bdda2f75f5","mcp_get_code":{"code_sha256":"b59818bdda2f75f5"}},{"arxiv_id":"1905.10671","arxiv_id_is_arxiv":true,"paper":"/paper/dianet-dense-and-implicit-attention-network","title":"DIANet: Dense-and-Implicit Attention Network","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/EAN-efficient-attention-network","path":"search_imagent/train_imagenet_ensemble_subset.py","file_url":"https://github.com/gbup-group/EAN-efficient-attention-network/blob/HEAD/search_imagent/train_imagenet_ensemble_subset.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":"4553b42d6bb45a62","code_sha256_prefix":"4553b42d6bb45a62","mcp_get_code":{"code_sha256":"4553b42d6bb45a62"}},{"arxiv_id":"1905.10671","arxiv_id_is_arxiv":true,"paper":"/paper/dianet-dense-and-implicit-attention-network","title":"DIANet: Dense-and-Implicit Attention Network","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/EAN-efficient-attention-network","path":"train_imagenet/train_imagenet_ensemble_subset.py","file_url":"https://github.com/gbup-group/EAN-efficient-attention-network/blob/HEAD/train_imagenet/train_imagenet_ensemble_subset.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":"c1768daf09350499","code_sha256_prefix":"c1768daf09350499","mcp_get_code":{"code_sha256":"c1768daf09350499"}},{"arxiv_id":"1905.10671","arxiv_id_is_arxiv":true,"paper":"/paper/dianet-dense-and-implicit-attention-network","title":"DIANet: Dense-and-Implicit Attention Network","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/EAN-efficient-attention-network","path":"train_imagenet/train_imagenet_forward.py","file_url":"https://github.com/gbup-group/EAN-efficient-attention-network/blob/HEAD/train_imagenet/train_imagenet_forward.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":"48c0d8320b0924d5","code_sha256_prefix":"48c0d8320b0924d5","mcp_get_code":{"code_sha256":"48c0d8320b0924d5"}},{"arxiv_id":"1905.10427","arxiv_id_is_arxiv":true,"paper":"/paper/diva-domain-invariant-variational","title":"DIVA: Domain Invariant Variational Autoencoders","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8c933ed6e26dcecc","code_sha256_prefix":"8c933ed6e26dcecc","mcp_get_code":{"code_sha256":"8c933ed6e26dcecc"}},{"arxiv_id":"1905.09433","arxiv_id_is_arxiv":true,"paper":"/paper/fibinet-combining-feature-importance-and","title":"FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"codectr/RefineCTR","path":"evaluation/mains/main_criteo_base.py","file_url":"https://github.com/codectr/RefineCTR/blob/HEAD/evaluation/mains/main_criteo_base.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, codectr/RefineCTR when it was checked","code_sha256":"e2dddebbea9ec26d","code_sha256_prefix":"e2dddebbea9ec26d","mcp_get_code":{"code_sha256":"e2dddebbea9ec26d"}},{"arxiv_id":"1905.09027","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-confuse-generating-training-time","title":"Learning to Confuse: Generating Training Time Adversarial Data with Auto-Encoder","date":"2019-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kingfengji/DeepConfuse","path":"ImageNet/train_binary.py","file_url":"https://github.com/kingfengji/DeepConfuse/blob/HEAD/ImageNet/train_binary.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, kingfengji/DeepConfuse when it was checked","code_sha256":"a7af1e1a81327f48","code_sha256_prefix":"a7af1e1a81327f48","mcp_get_code":{"code_sha256":"a7af1e1a81327f48"}},{"arxiv_id":"1905.08494","arxiv_id_is_arxiv":true,"paper":"/paper/deep-signatures","title":"Deep Signature Transforms","date":"2019-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patrick-kidger/Deep-Signatures","path":"src/reinforcement_learning.py","file_url":"https://github.com/patrick-kidger/Deep-Signatures/blob/HEAD/src/reinforcement_learning.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":"987a3ca85150e2e4","code_sha256_prefix":"987a3ca85150e2e4","mcp_get_code":{"code_sha256":"987a3ca85150e2e4"}},{"arxiv_id":"1905.03028","arxiv_id_is_arxiv":true,"paper":"/paper/deep-landscape-forecasting-for-real-time","title":"Deep Landscape Forecasting for Real-time Bidding Advertising","date":"2019-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rk2900/DLF","path":"python/km.py","file_url":"https://github.com/rk2900/DLF/blob/HEAD/python/km.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":"20c72b14500acdc1","code_sha256_prefix":"20c72b14500acdc1","mcp_get_code":{"code_sha256":"20c72b14500acdc1"}},{"arxiv_id":"1905.00292","arxiv_id_is_arxiv":true,"paper":"/paper/adacos-adaptively-scaling-cosine-logits-for","title":"AdaCos: Adaptively Scaling Cosine Logits for Effectively Learning Deep Face Representations","date":"2019-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4uiiurz1/pytorch-adacos","path":"mnist_train.py","file_url":"https://github.com/4uiiurz1/pytorch-adacos/blob/HEAD/mnist_train.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":"98eca2af137cb478","code_sha256_prefix":"98eca2af137cb478","mcp_get_code":{"code_sha256":"98eca2af137cb478"}},{"arxiv_id":"1904.04232","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-few-shot-classification-1","title":"A Closer Look at Few-shot Classification","date":"2019-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinuni-vishc/Few-Shot-Cosine-Transformer","path":"train_test.py","file_url":"https://github.com/vinuni-vishc/Few-Shot-Cosine-Transformer/blob/HEAD/train_test.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, vinuni-vishc/Few-Shot-Cosine-Transformer (NOASSERTION)","code_sha256":"55beb8cfed8198d9","code_sha256_prefix":"55beb8cfed8198d9","mcp_get_code":{"code_sha256":"55beb8cfed8198d9"}},{"arxiv_id":"1903.10258","arxiv_id_is_arxiv":true,"paper":"/paper/metapruning-meta-learning-for-automatic","title":"MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning","date":"2019-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuzechun/MetaPruning","path":"mobilenetv1/evaluating/evaluate.py","file_url":"https://github.com/liuzechun/MetaPruning/blob/HEAD/mobilenetv1/evaluating/evaluate.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":"8fccbb2d2cb28a4a","code_sha256_prefix":"8fccbb2d2cb28a4a","mcp_get_code":{"code_sha256":"8fccbb2d2cb28a4a"}},{"arxiv_id":"1902.07243","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLiangwei/ConsisRec","path":"run_GraphConsis_example.py","file_url":"https://github.com/YangLiangwei/ConsisRec/blob/HEAD/run_GraphConsis_example.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, YangLiangwei/ConsisRec when it was checked","code_sha256":"14ca1f25c49bee5f","code_sha256_prefix":"14ca1f25c49bee5f","mcp_get_code":{"code_sha256":"14ca1f25c49bee5f"}},{"arxiv_id":"1902.07243","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenqifan03/GraphRec-WWW19","path":"run_GraphRec_example.py","file_url":"https://github.com/wenqifan03/GraphRec-WWW19/blob/HEAD/run_GraphRec_example.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":"ec6c7ff7e60c925f","code_sha256_prefix":"ec6c7ff7e60c925f","mcp_get_code":{"code_sha256":"ec6c7ff7e60c925f"}},{"arxiv_id":"1902.02603","arxiv_id_is_arxiv":true,"paper":"/paper/radial-and-directional-posteriors-for","title":"Radial and Directional Posteriors for Bayesian Neural Networks","date":"2019-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChangYong-Oh/RadiusDirectionPosteriors","path":"RadiusDirectionPosteriors/train_double_uci.py","file_url":"https://github.com/ChangYong-Oh/RadiusDirectionPosteriors/blob/HEAD/RadiusDirectionPosteriors/train_double_uci.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, ChangYong-Oh/RadiusDirectionPosteriors when it was checked","code_sha256":"bdab7af08bcc2f37","code_sha256_prefix":"bdab7af08bcc2f37","mcp_get_code":{"code_sha256":"bdab7af08bcc2f37"}},{"arxiv_id":"1812.07617","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deep-conversational-recommendations","title":"Towards Deep Conversational Recommendations","date":"2018-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RaymondLi0/conversational-recommendations","path":"train_recommender.py","file_url":"https://github.com/RaymondLi0/conversational-recommendations/blob/HEAD/train_recommender.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, RaymondLi0/conversational-recommendations when it was checked","code_sha256":"772e03efcfe35812","code_sha256_prefix":"772e03efcfe35812","mcp_get_code":{"code_sha256":"772e03efcfe35812"}},{"arxiv_id":"1812.01819","arxiv_id_is_arxiv":true,"paper":"/paper/feature-matters-a-stage-by-stage-approach-for","title":"An Embarrassingly Simple Approach for Knowledge Distillation","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"00a58257f6886584","code_sha256_prefix":"00a58257f6886584","mcp_get_code":{"code_sha256":"00a58257f6886584"}},{"arxiv_id":"1812.00564","arxiv_id_is_arxiv":true,"paper":"/paper/split-learning-for-health-distributed-deep","title":"Split learning for health: Distributed deep learning without sharing raw patient data","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bt-s/Split-Learning-and-Federated-Learning","path":"src/federated_learning.py","file_url":"https://github.com/bt-s/Split-Learning-and-Federated-Learning/blob/HEAD/src/federated_learning.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":"6b861b86b0a4fb35","code_sha256_prefix":"6b861b86b0a4fb35","mcp_get_code":{"code_sha256":"6b861b86b0a4fb35"}},{"arxiv_id":"1812.00332","arxiv_id_is_arxiv":true,"paper":"/paper/proxylessnas-direct-neural-architecture","title":"ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/haq","path":"rl_quantize.py","file_url":"https://github.com/mit-han-lab/haq/blob/HEAD/rl_quantize.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":"d0be8747b3078aa4","code_sha256_prefix":"d0be8747b3078aa4","mcp_get_code":{"code_sha256":"d0be8747b3078aa4"}},{"arxiv_id":"1812.00101","arxiv_id_is_arxiv":true,"paper":"/paper/dvc-an-end-to-end-deep-video-compression","title":"DVC: An End-to-end Deep Video Compression Framework","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"binzzheng/DVC-PyTorch","path":"main_dvc.py","file_url":"https://github.com/binzzheng/DVC-PyTorch/blob/HEAD/main_dvc.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, binzzheng/DVC-PyTorch when it was checked","code_sha256":"be155fa04ef4fd36","code_sha256_prefix":"be155fa04ef4fd36","mcp_get_code":{"code_sha256":"be155fa04ef4fd36"}},{"arxiv_id":"1811.12673","arxiv_id_is_arxiv":true,"paper":"/paper/comdefend-an-efficient-image-compression","title":"ComDefend: An Efficient Image Compression Model to Defend Adversarial Examples","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b2e1abf5ebf26a32","code_sha256_prefix":"b2e1abf5ebf26a32","mcp_get_code":{"code_sha256":"b2e1abf5ebf26a32"}},{"arxiv_id":"1811.11168","arxiv_id_is_arxiv":true,"paper":"/paper/deformable-convnets-v2-more-deformable-better","title":"Deformable ConvNets v2: More Deformable, Better Results","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4uiiurz1/pytorch-deform-conv-v2","path":"scaled_mnist_train.py","file_url":"https://github.com/4uiiurz1/pytorch-deform-conv-v2/blob/HEAD/scaled_mnist_train.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":"1c4389015d8afe22","code_sha256_prefix":"1c4389015d8afe22","mcp_get_code":{"code_sha256":"1c4389015d8afe22"}},{"arxiv_id":"1810.10191","arxiv_id_is_arxiv":true,"paper":"/paper/making-sense-of-vision-and-touch-self","title":"Making Sense of Vision and Touch: Self-Supervised Learning of Multimodal Representations for Contact-Rich Tasks","date":"2018-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Henry1iu/ierg5350_rl_course_project","path":"multimodal/train_my_fusion_model.py","file_url":"https://github.com/Henry1iu/ierg5350_rl_course_project/blob/HEAD/multimodal/train_my_fusion_model.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, Henry1iu/ierg5350_rl_course_project when it was checked","code_sha256":"bf030a9f1859cfda","code_sha256_prefix":"bf030a9f1859cfda","mcp_get_code":{"code_sha256":"bf030a9f1859cfda"}},{"arxiv_id":"1810.00861","arxiv_id_is_arxiv":true,"paper":"/paper/proxquant-quantized-neural-networks-via","title":"ProxQuant: Quantized Neural Networks via Proximal Operators","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenbai01/ProxQuant","path":"main_binary_reg.py","file_url":"https://github.com/allenbai01/ProxQuant/blob/HEAD/main_binary_reg.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":"a6c968b28755b58c","code_sha256_prefix":"a6c968b28755b58c","mcp_get_code":{"code_sha256":"a6c968b28755b58c"}},{"arxiv_id":"1809.09401","arxiv_id_is_arxiv":true,"paper":"/paper/hypergraph-neural-networks","title":"Hypergraph Neural Networks","date":"2018-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imoonlab/deephypergraph","path":"examples/node_classification/hgnn_on_cora.py","file_url":"https://github.com/imoonlab/deephypergraph/blob/HEAD/examples/node_classification/hgnn_on_cora.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd070815ef37b617","code_sha256_prefix":"fd070815ef37b617","mcp_get_code":{"code_sha256":"fd070815ef37b617"}},{"arxiv_id":"1808.00508","arxiv_id_is_arxiv":true,"paper":"/paper/neural-arithmetic-logic-units","title":"Neural Arithmetic Logic Units","date":"2018-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nilabhra/NALU","path":"utilities/train_utils.py","file_url":"https://github.com/Nilabhra/NALU/blob/HEAD/utilities/train_utils.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, Nilabhra/NALU when it was checked","code_sha256":"8db99284cbba319d","code_sha256_prefix":"8db99284cbba319d","mcp_get_code":{"code_sha256":"8db99284cbba319d"}},{"arxiv_id":"1808.00508","arxiv_id_is_arxiv":true,"paper":"/paper/neural-arithmetic-logic-units","title":"Neural Arithmetic Logic Units","date":"2018-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrederikWarburg/latent_disagreement","path":"Experiments/NALU_all_we_need.py","file_url":"https://github.com/FrederikWarburg/latent_disagreement/blob/HEAD/Experiments/NALU_all_we_need.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, FrederikWarburg/latent_disagreement when it was checked","code_sha256":"e7f88fa947dc31b3","code_sha256_prefix":"e7f88fa947dc31b3","mcp_get_code":{"code_sha256":"e7f88fa947dc31b3"}},{"arxiv_id":"1806.10758","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-feature-importance-estimates","title":"A Benchmark for Interpretability Methods in Deep Neural Networks","date":"2018-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edpclau/ROAR-for-Scikit","path":"ROAR.py","file_url":"https://github.com/edpclau/ROAR-for-Scikit/blob/HEAD/ROAR.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":"48e80c989c12146f","code_sha256_prefix":"48e80c989c12146f","mcp_get_code":{"code_sha256":"48e80c989c12146f"}},{"arxiv_id":"1806.10758","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-feature-importance-estimates","title":"A Benchmark for Interpretability Methods in Deep Neural Networks","date":"2018-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edpclau/ROAR-for-Scikit","path":".ipynb_checkpoints/ROAR-checkpoint.py","file_url":"https://github.com/edpclau/ROAR-for-Scikit/blob/HEAD/.ipynb_checkpoints/ROAR-checkpoint.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":"dc221e4759c6b209","code_sha256_prefix":"dc221e4759c6b209","mcp_get_code":{"code_sha256":"dc221e4759c6b209"}},{"arxiv_id":"1806.08804","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/reproduciblefedgnn","path":"federated_reproducibility/main_gcn.py","file_url":"https://github.com/basiralab/reproduciblefedgnn/blob/HEAD/federated_reproducibility/main_gcn.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":"640adefa68f0073d","code_sha256_prefix":"640adefa68f0073d","mcp_get_code":{"code_sha256":"640adefa68f0073d"}},{"arxiv_id":"1806.04242","arxiv_id_is_arxiv":true,"paper":"/paper/the-potential-of-the-return-distribution-for","title":"The Potential of the Return Distribution for Exploration in RL","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmoer/return_distribution_exploration","path":"duvn_agent.py","file_url":"https://github.com/tmoer/return_distribution_exploration/blob/HEAD/duvn_agent.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, tmoer/return_distribution_exploration when it was checked","code_sha256":"14d43170bb5666d4","code_sha256_prefix":"14d43170bb5666d4","mcp_get_code":{"code_sha256":"14d43170bb5666d4"}},{"arxiv_id":"1805.11328","arxiv_id_is_arxiv":true,"paper":"/paper/hamiltonian-variational-auto-encoder","title":"Hamiltonian Variational Auto-Encoder","date":"2018-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anthonycaterini/hvae-nips","path":"mnist/training.py","file_url":"https://github.com/anthonycaterini/hvae-nips/blob/HEAD/mnist/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":"e44e76a7a6d6f69a","code_sha256_prefix":"e44e76a7a6d6f69a","mcp_get_code":{"code_sha256":"e44e76a7a6d6f69a"}},{"arxiv_id":"1805.11090","arxiv_id_is_arxiv":true,"paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/adversarial_genattack","path":"train_models.py","file_url":"https://github.com/nesl/adversarial_genattack/blob/HEAD/train_models.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":"8b389eb9f5726984","code_sha256_prefix":"8b389eb9f5726984","mcp_get_code":{"code_sha256":"8b389eb9f5726984"}},{"arxiv_id":"1805.01954","arxiv_id_is_arxiv":true,"paper":"/paper/behavioral-cloning-from-observation","title":"Behavioral Cloning from Observation","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NathanGavenski/IUPE","path":"models/policy.py","file_url":"https://github.com/NathanGavenski/IUPE/blob/HEAD/models/policy.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":"65faa99ef0c486da","code_sha256_prefix":"65faa99ef0c486da","mcp_get_code":{"code_sha256":"65faa99ef0c486da"}},{"arxiv_id":"1805.01954","arxiv_id_is_arxiv":true,"paper":"/paper/behavioral-cloning-from-observation","title":"Behavioral Cloning from Observation","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NathanGavenski/IUPE","path":"models/idm.py","file_url":"https://github.com/NathanGavenski/IUPE/blob/HEAD/models/idm.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":"6cb5bfd9f6b92a48","code_sha256_prefix":"6cb5bfd9f6b92a48","mcp_get_code":{"code_sha256":"6cb5bfd9f6b92a48"}},{"arxiv_id":"1803.09574","arxiv_id_is_arxiv":true,"paper":"/paper/long-short-term-memory-and-learning-to-learn","title":"Long short-term memory and learning-to-learn in networks of spiking neurons","date":"2018-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"norse/norse","path":"norse/task/mnist.py","file_url":"https://github.com/norse/norse/blob/HEAD/norse/task/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-3.0, as GitHub detects it on this paper's repository, norse/norse, is not in the permissive set Syntology serves inline","code_sha256":"daa1278e5382ed85","code_sha256_prefix":"daa1278e5382ed85","mcp_get_code":{"code_sha256":"daa1278e5382ed85"}},{"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":"aef495cebb5c30d0","code_sha256_prefix":"aef495cebb5c30d0","mcp_get_code":{"code_sha256":"aef495cebb5c30d0"}},{"arxiv_id":"1802.01561","arxiv_id_is_arxiv":true,"paper":"/paper/impala-scalable-distributed-deep-rl-with","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","date":"2018-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seolhokim/SimpleDistributedRL","path":"distributed_reinforcement_learning/algorithms/impala.py","file_url":"https://github.com/seolhokim/SimpleDistributedRL/blob/HEAD/distributed_reinforcement_learning/algorithms/impala.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":"01b62761de35ed90","code_sha256_prefix":"01b62761de35ed90","mcp_get_code":{"code_sha256":"01b62761de35ed90"}},{"arxiv_id":"1712.04248","arxiv_id_is_arxiv":true,"paper":"/paper/decision-based-adversarial-attacks-reliable","title":"Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Models","date":"2017-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MatveyMor/substitute_boundary_attack","path":"attacks/boundary_attack.py","file_url":"https://github.com/MatveyMor/substitute_boundary_attack/blob/HEAD/attacks/boundary_attack.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, MatveyMor/substitute_boundary_attack when it was checked","code_sha256":"596161374b2d3344","code_sha256_prefix":"596161374b2d3344","mcp_get_code":{"code_sha256":"596161374b2d3344"}},{"arxiv_id":"1711.02512","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-cnn-image-retrieval-with-no-human","title":"Fine-tuning CNN Image Retrieval with No Human Annotation","date":"2017-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuibinMa/comp755project-ruibinma","path":"cirtorch/examples/train_colon.py","file_url":"https://github.com/RuibinMa/comp755project-ruibinma/blob/HEAD/cirtorch/examples/train_colon.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, RuibinMa/comp755project-ruibinma when it was checked","code_sha256":"c46a359503f53583","code_sha256_prefix":"c46a359503f53583","mcp_get_code":{"code_sha256":"c46a359503f53583"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DanielLongo/CapsNet-PyTorch","path":"CapsNet.py","file_url":"https://github.com/DanielLongo/CapsNet-PyTorch/blob/HEAD/CapsNet.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, DanielLongo/CapsNet-PyTorch when it was checked","code_sha256":"a5be0ded65ff286c","code_sha256_prefix":"a5be0ded65ff286c","mcp_get_code":{"code_sha256":"a5be0ded65ff286c"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XifengGuo/CapsNet-Keras","path":"capsulenet.py","file_url":"https://github.com/XifengGuo/CapsNet-Keras/blob/HEAD/capsulenet.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":"bf56a8a6277e51bd","code_sha256_prefix":"bf56a8a6277e51bd","mcp_get_code":{"code_sha256":"bf56a8a6277e51bd"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshaikh2/GANs_Comparison","path":"capsule/capsulenet.py","file_url":"https://github.com/mshaikh2/GANs_Comparison/blob/HEAD/capsule/capsulenet.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":"6c016f20008ba616","code_sha256_prefix":"6c016f20008ba616","mcp_get_code":{"code_sha256":"6c016f20008ba616"}},{"arxiv_id":"1709.06053","arxiv_id_is_arxiv":true,"paper":"/paper/coupled-ensembles-of-neural-networks","title":"Coupled Ensembles of Neural Networks","date":"2017-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vabh/coupled_ensembles","path":"train_model.py","file_url":"https://github.com/vabh/coupled_ensembles/blob/HEAD/train_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, vabh/coupled_ensembles, is not in the permissive set Syntology serves inline","code_sha256":"89be6edf313246b5","code_sha256_prefix":"89be6edf313246b5","mcp_get_code":{"code_sha256":"89be6edf313246b5"}},{"arxiv_id":"1708.06733","arxiv_id_is_arxiv":true,"paper":"/paper/badnets-identifying-vulnerabilities-in-the","title":"BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain","date":"2017-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeTzannetos/badnets","path":"train_eval.py","file_url":"https://github.com/GeorgeTzannetos/badnets/blob/HEAD/train_eval.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, GeorgeTzannetos/badnets when it was checked","code_sha256":"53377da1ddefc4dd","code_sha256_prefix":"53377da1ddefc4dd","mcp_get_code":{"code_sha256":"53377da1ddefc4dd"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llSourcell/OpenAI_Five_vs_Dota2_Explained","path":"ppo.py","file_url":"https://github.com/llSourcell/OpenAI_Five_vs_Dota2_Explained/blob/HEAD/ppo.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":"f5d2e6057543255c","code_sha256_prefix":"f5d2e6057543255c","mcp_get_code":{"code_sha256":"f5d2e6057543255c"}},{"arxiv_id":"1706.02677","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-large-minibatch-sgd-training","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","date":"2017-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"efad379ea20fec59","code_sha256_prefix":"efad379ea20fec59","mcp_get_code":{"code_sha256":"efad379ea20fec59"}},{"arxiv_id":"1706.02515","arxiv_id_is_arxiv":true,"paper":"/paper/self-normalizing-neural-networks","title":"Self-Normalizing Neural Networks","date":"2017-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Self_Normalizing_Neural_Networks/selu.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Self_Normalizing_Neural_Networks/selu.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":"cd177ac59dc1b42c","code_sha256_prefix":"cd177ac59dc1b42c","mcp_get_code":{"code_sha256":"cd177ac59dc1b42c"}},{"arxiv_id":"1705.09056","arxiv_id_is_arxiv":true,"paper":"/paper/can-decentralized-algorithms-outperform","title":"Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent","date":"2017-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aparna-aketi/d_psgd","path":"trainer.py","file_url":"https://github.com/aparna-aketi/d_psgd/blob/HEAD/trainer.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, aparna-aketi/d_psgd when it was checked","code_sha256":"aee4a2097410762b","code_sha256_prefix":"aee4a2097410762b","mcp_get_code":{"code_sha256":"aee4a2097410762b"}},{"arxiv_id":"1705.07832","arxiv_id_is_arxiv":true,"paper":"/paper/concrete-dropout","title":"Concrete Dropout","date":"2017-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielkelshaw/ConcreteDropout","path":"mnist_example.py","file_url":"https://github.com/danielkelshaw/ConcreteDropout/blob/HEAD/mnist_example.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":"4b10c277faf961e9","code_sha256_prefix":"4b10c277faf961e9","mcp_get_code":{"code_sha256":"4b10c277faf961e9"}},{"arxiv_id":"1704.00028","arxiv_id_is_arxiv":true,"paper":"/paper/improved-training-of-wasserstein-gans","title":"Improved Training of Wasserstein GANs","date":"2017-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Improved_Training_of_Wasserstein_GANs/wgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Improved_Training_of_Wasserstein_GANs/wgan.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":"0fdb0bd2677b553b","code_sha256_prefix":"0fdb0bd2677b553b","mcp_get_code":{"code_sha256":"0fdb0bd2677b553b"}},{"arxiv_id":"1703.03864","arxiv_id_is_arxiv":true,"paper":"/paper/evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangtongZhang/DistributedES","path":"natural_es.py","file_url":"https://github.com/ShangtongZhang/DistributedES/blob/HEAD/natural_es.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":"c481166be3fcc928","code_sha256_prefix":"c481166be3fcc928","mcp_get_code":{"code_sha256":"c481166be3fcc928"}},{"arxiv_id":"1702.08484","arxiv_id_is_arxiv":true,"paper":"/paper/boosted-generative-models","title":"Boosted Generative Models","date":"2017-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/bgm","path":"src/bmm_utils.py","file_url":"https://github.com/ermongroup/bgm/blob/HEAD/src/bmm_utils.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":"e5907c3a80267a2e","code_sha256_prefix":"e5907c3a80267a2e","mcp_get_code":{"code_sha256":"e5907c3a80267a2e"}},{"arxiv_id":"1701.07875","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Wasserstein_GAN/wgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Wasserstein_GAN/wgan.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":"53065998bed260c3","code_sha256_prefix":"53065998bed260c3","mcp_get_code":{"code_sha256":"53065998bed260c3"}},{"arxiv_id":"1611.08402","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theswgong/MoNet","path":"image/train_eval.py","file_url":"https://github.com/theswgong/MoNet/blob/HEAD/image/train_eval.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":"668c5f7e61273fc2","code_sha256_prefix":"668c5f7e61273fc2","mcp_get_code":{"code_sha256":"668c5f7e61273fc2"}},{"arxiv_id":"1611.08402","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theswgong/MoNet","path":"manifolds/train_eval.py","file_url":"https://github.com/theswgong/MoNet/blob/HEAD/manifolds/train_eval.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":"b38fca4c55c291bc","code_sha256_prefix":"b38fca4c55c291bc","mcp_get_code":{"code_sha256":"b38fca4c55c291bc"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepware/pix2pix","path":"pix2pix.py","file_url":"https://github.com/deepware/pix2pix/blob/HEAD/pix2pix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"891a045eb4924a7b","code_sha256_prefix":"891a045eb4924a7b","mcp_get_code":{"code_sha256":"891a045eb4924a7b"}},{"arxiv_id":"1611.06455","arxiv_id_is_arxiv":true,"paper":"/paper/time-series-classification-from-scratch-with","title":"Time Series Classification from Scratch with Deep Neural Networks: A Strong Baseline","date":"2016-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NAVCAF/maneuver-id","path":"utils/train_val_funcs.py","file_url":"https://github.com/NAVCAF/maneuver-id/blob/HEAD/utils/train_val_funcs.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":"305de7efb576ceeb","code_sha256_prefix":"305de7efb576ceeb","mcp_get_code":{"code_sha256":"305de7efb576ceeb"}},{"arxiv_id":"1611.04076","arxiv_id_is_arxiv":true,"paper":"/paper/least-squares-generative-adversarial-networks","title":"Least Squares Generative Adversarial Networks","date":"2016-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Least_Squares_Generative_Adversarial_Networks/lsgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Least_Squares_Generative_Adversarial_Networks/lsgan.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":"7d6b4d1002b99d2f","code_sha256_prefix":"7d6b4d1002b99d2f","mcp_get_code":{"code_sha256":"7d6b4d1002b99d2f"}},{"arxiv_id":"1610.00087","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-neural-networks-for","title":"Very Deep Convolutional Neural Networks for Raw Waveforms","date":"2016-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andry-Heritiana/Very_Deep_CNN_Audio_Classification","path":"audio_classifier.py","file_url":"https://github.com/Andry-Heritiana/Very_Deep_CNN_Audio_Classification/blob/HEAD/audio_classifier.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, Andry-Heritiana/Very_Deep_CNN_Audio_Classification when it was checked","code_sha256":"10bcc83b10a601ad","code_sha256_prefix":"10bcc83b10a601ad","mcp_get_code":{"code_sha256":"10bcc83b10a601ad"}},{"arxiv_id":"1609.06647","arxiv_id_is_arxiv":true,"paper":"/paper/show-and-tell-lessons-learned-from-the-2015","title":"Show and Tell: Lessons learned from the 2015 MSCOCO Image Captioning Challenge","date":"2016-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ag169/Image-Captioning","path":"train_caption.py","file_url":"https://github.com/ag169/Image-Captioning/blob/HEAD/train_caption.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, ag169/Image-Captioning when it was checked","code_sha256":"6a98e984239dce16","code_sha256_prefix":"6a98e984239dce16","mcp_get_code":{"code_sha256":"6a98e984239dce16"}},{"arxiv_id":"1609.01596","arxiv_id_is_arxiv":true,"paper":"/paper/direct-feedback-alignment-provides-learning","title":"Direct Feedback Alignment Provides Learning in Deep Neural Networks","date":"2016-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"florian-bacho/dirdfa","path":"main_fwd_grad.py","file_url":"https://github.com/florian-bacho/dirdfa/blob/HEAD/main_fwd_grad.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":"8860f94661609337","code_sha256_prefix":"8860f94661609337","mcp_get_code":{"code_sha256":"8860f94661609337"}},{"arxiv_id":"1606.03498","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-training-gans","title":"Improved Techniques for Training GANs","date":"2016-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Improved_Techniques_for_Training_GANs/semi_supervised_learning.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Improved_Techniques_for_Training_GANs/semi_supervised_learning.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":"b855806c84babb76","code_sha256_prefix":"b855806c84babb76","mcp_get_code":{"code_sha256":"b855806c84babb76"}},{"arxiv_id":"1604.02426","arxiv_id_is_arxiv":true,"paper":"/paper/cnn-image-retrieval-learns-from-bow","title":"CNN Image Retrieval Learns from BoW: Unsupervised Fine-Tuning with Hard Examples","date":"2016-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"c46a359503f53583","code_sha256_prefix":"c46a359503f53583","mcp_get_code":{"code_sha256":"c46a359503f53583"}},{"arxiv_id":"1603.07285","arxiv_id_is_arxiv":true,"paper":"/paper/a-guide-to-convolution-arithmetic-for-deep","title":"A guide to convolution arithmetic for deep learning","date":"2016-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marbleton/FPGA_MNIST","path":"net/train_keras.py","file_url":"https://github.com/marbleton/FPGA_MNIST/blob/HEAD/net/train_keras.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":"db420a21c1aa09b8","code_sha256_prefix":"db420a21c1aa09b8","mcp_get_code":{"code_sha256":"db420a21c1aa09b8"}},{"arxiv_id":"1603.02754","arxiv_id_is_arxiv":true,"paper":"/paper/xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"360jinrong/GBST","path":"gbst_package/gbst/training.py","file_url":"https://github.com/360jinrong/GBST/blob/HEAD/gbst_package/gbst/training.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":"0deb98c24eb53d79","code_sha256_prefix":"0deb98c24eb53d79","mcp_get_code":{"code_sha256":"0deb98c24eb53d79"}},{"arxiv_id":"1602.05629","arxiv_id_is_arxiv":true,"paper":"/paper/communication-efficient-learning-of-deep","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willyfh/federated-learning-tensorflow","path":"federated_train.py","file_url":"https://github.com/willyfh/federated-learning-tensorflow/blob/HEAD/federated_train.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":"f457743261fa931b","code_sha256_prefix":"f457743261fa931b","mcp_get_code":{"code_sha256":"f457743261fa931b"}},{"arxiv_id":"1602.02644","arxiv_id_is_arxiv":true,"paper":"/paper/generating-images-with-perceptual-similarity","title":"Generating Images with Perceptual Similarity Metrics based on Deep Networks","date":"2016-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukky17/DeePSiM_pytorch","path":"ff_training.py","file_url":"https://github.com/ukky17/DeePSiM_pytorch/blob/HEAD/ff_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":"01dc40f3cb8aca84","code_sha256_prefix":"01dc40f3cb8aca84","mcp_get_code":{"code_sha256":"01dc40f3cb8aca84"}},{"arxiv_id":"1602.02644","arxiv_id_is_arxiv":true,"paper":"/paper/generating-images-with-perceptual-similarity","title":"Generating Images with Perceptual Similarity Metrics based on Deep Networks","date":"2016-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukky17/DeePSiM_pytorch","path":"invert.py","file_url":"https://github.com/ukky17/DeePSiM_pytorch/blob/HEAD/invert.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":"89a61e906fca4e48","code_sha256_prefix":"89a61e906fca4e48","mcp_get_code":{"code_sha256":"89a61e906fca4e48"}},{"arxiv_id":"1511.06530","arxiv_id_is_arxiv":true,"paper":"/paper/compression-of-deep-convolutional-neural","title":"Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications","date":"2015-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e8d9d8e78c7f0611","code_sha256_prefix":"e8d9d8e78c7f0611","mcp_get_code":{"code_sha256":"e8d9d8e78c7f0611"}},{"arxiv_id":"1511.06530","arxiv_id_is_arxiv":true,"paper":"/paper/compression-of-deep-convolutional-neural","title":"Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications","date":"2015-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"75e61dc3235c8bcc","code_sha256_prefix":"75e61dc3235c8bcc","mcp_get_code":{"code_sha256":"75e61dc3235c8bcc"}},{"arxiv_id":"1511.06335","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Derek-Wds/MAD-VAE","path":"train_classification.py","file_url":"https://github.com/Derek-Wds/MAD-VAE/blob/HEAD/train_classification.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":"870b6390bd4081dc","code_sha256_prefix":"870b6390bd4081dc","mcp_get_code":{"code_sha256":"870b6390bd4081dc"}},{"arxiv_id":"1511.06335","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Derek-Wds/MAD-VAE","path":"train_cluster.py","file_url":"https://github.com/Derek-Wds/MAD-VAE/blob/HEAD/train_cluster.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":"27fe143476938688","code_sha256_prefix":"27fe143476938688","mcp_get_code":{"code_sha256":"27fe143476938688"}},{"arxiv_id":"1511.06335","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Derek-Wds/MAD-VAE","path":"train_combined.py","file_url":"https://github.com/Derek-Wds/MAD-VAE/blob/HEAD/train_combined.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":"2df55ac487c883fd","code_sha256_prefix":"2df55ac487c883fd","mcp_get_code":{"code_sha256":"2df55ac487c883fd"}},{"arxiv_id":"1511.06335","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Derek-Wds/MAD-VAE","path":"train_identity.py","file_url":"https://github.com/Derek-Wds/MAD-VAE/blob/HEAD/train_identity.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":"98418f6d0bad0a09","code_sha256_prefix":"98418f6d0bad0a09","mcp_get_code":{"code_sha256":"98418f6d0bad0a09"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liampetti/DDPG","path":"ddpg.py","file_url":"https://github.com/liampetti/DDPG/blob/HEAD/ddpg.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, liampetti/DDPG when it was checked","code_sha256":"7f073c276baecc11","code_sha256_prefix":"7f073c276baecc11","mcp_get_code":{"code_sha256":"7f073c276baecc11"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjanamallya/speech_to_text","path":"speech_to_text.py","file_url":"https://github.com/sanjanamallya/speech_to_text/blob/HEAD/speech_to_text.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, sanjanamallya/speech_to_text when it was checked","code_sha256":"226df6a3394d1c2d","code_sha256_prefix":"226df6a3394d1c2d","mcp_get_code":{"code_sha256":"226df6a3394d1c2d"}},{"arxiv_id":"1505.07818","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AKASH2907/Forgery-Classification-via-Domain-Adaptation","path":"DANN/dann_keras.py","file_url":"https://github.com/AKASH2907/Forgery-Classification-via-Domain-Adaptation/blob/HEAD/DANN/dann_keras.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, AKASH2907/Forgery-Classification-via-Domain-Adaptation when it was checked","code_sha256":"1e5fb974a2b9088c","code_sha256_prefix":"1e5fb974a2b9088c","mcp_get_code":{"code_sha256":"1e5fb974a2b9088c"}},{"arxiv_id":"1505.05424","arxiv_id_is_arxiv":true,"paper":"/paper/weight-uncertainty-in-neural-networks","title":"Weight Uncertainty in Neural Networks","date":"2015-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielkelshaw/RadialBNN","path":"mnist_radial_bnn.py","file_url":"https://github.com/danielkelshaw/RadialBNN/blob/HEAD/mnist_radial_bnn.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":"5cc87715e60867cd","code_sha256_prefix":"5cc87715e60867cd","mcp_get_code":{"code_sha256":"5cc87715e60867cd"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divamgupta/image-segmentation-keras","path":"keras_segmentation/models/unet.py","file_url":"https://github.com/divamgupta/image-segmentation-keras/blob/HEAD/keras_segmentation/models/unet.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":"7aca87781aef20a4","code_sha256_prefix":"7aca87781aef20a4","mcp_get_code":{"code_sha256":"7aca87781aef20a4"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maveric4/pr19aaw01","path":"SRC/keras_segmentation/models/unet.py","file_url":"https://github.com/Maveric4/pr19aaw01/blob/HEAD/SRC/keras_segmentation/models/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, Maveric4/pr19aaw01 when it was checked","code_sha256":"32491410387de296","code_sha256_prefix":"32491410387de296","mcp_get_code":{"code_sha256":"32491410387de296"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stdereka/knowledge-distillation","path":"training.py","file_url":"https://github.com/stdereka/knowledge-distillation/blob/HEAD/training.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":"00a58257f6886584","code_sha256_prefix":"00a58257f6886584","mcp_get_code":{"code_sha256":"00a58257f6886584"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"knotgrass/Knowledge-Distillation","path":"distiller/distiller.py","file_url":"https://github.com/knotgrass/Knowledge-Distillation/blob/HEAD/distiller/distiller.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":"f7005e3d307e1c00","code_sha256_prefix":"f7005e3d307e1c00","mcp_get_code":{"code_sha256":"f7005e3d307e1c00"}},{"arxiv_id":"1412.6553","arxiv_id_is_arxiv":true,"paper":"/paper/speeding-up-convolutional-neural-networks","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","date":"2014-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mostafaelhoushi/tensor-decompositions","path":"imagenet.py","file_url":"https://github.com/mostafaelhoushi/tensor-decompositions/blob/HEAD/imagenet.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, mostafaelhoushi/tensor-decompositions when it was checked","code_sha256":"e8d9d8e78c7f0611","code_sha256_prefix":"e8d9d8e78c7f0611","mcp_get_code":{"code_sha256":"e8d9d8e78c7f0611"}},{"arxiv_id":"1412.6553","arxiv_id_is_arxiv":true,"paper":"/paper/speeding-up-convolutional-neural-networks","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","date":"2014-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mostafaelhoushi/tensor-decompositions","path":"cifar10.py","file_url":"https://github.com/mostafaelhoushi/tensor-decompositions/blob/HEAD/cifar10.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, mostafaelhoushi/tensor-decompositions when it was checked","code_sha256":"75e61dc3235c8bcc","code_sha256_prefix":"75e61dc3235c8bcc","mcp_get_code":{"code_sha256":"75e61dc3235c8bcc"}},{"arxiv_id":"1412.3128","arxiv_id_is_arxiv":true,"paper":"/paper/real-time-grasp-detection-using-convolutional","title":"Real-Time Grasp Detection Using Convolutional Neural Networks","date":"2014-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamed-hosseini/ggcnn","path":"train_cnn.py","file_url":"https://github.com/hamed-hosseini/ggcnn/blob/HEAD/train_cnn.py","status":"ran","verification_level":1,"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":"894f259f11b9d556","code_sha256_prefix":"894f259f11b9d556","mcp_get_code":{"code_sha256":"894f259f11b9d556"}},{"arxiv_id":"1412.0035","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-deep-image-representations-by","title":"Understanding Deep Image Representations by Inverting Them","date":"2014-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"01dc40f3cb8aca84","code_sha256_prefix":"01dc40f3cb8aca84","mcp_get_code":{"code_sha256":"01dc40f3cb8aca84"}},{"arxiv_id":"1409.2329","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhecloud/simple_language_modelling","path":"train_lm.py","file_url":"https://github.com/dhecloud/simple_language_modelling/blob/HEAD/train_lm.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, dhecloud/simple_language_modelling when it was checked","code_sha256":"eae89d8a906f77fb","code_sha256_prefix":"eae89d8a906f77fb","mcp_get_code":{"code_sha256":"eae89d8a906f77fb"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"delldu/TextCNN","path":"model.py","file_url":"https://github.com/delldu/TextCNN/blob/HEAD/model.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":"619063371b6abd03","code_sha256_prefix":"619063371b6abd03","mcp_get_code":{"code_sha256":"619063371b6abd03"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainorangelemon/TextCNN-with-Attention","path":"model.py","file_url":"https://github.com/rainorangelemon/TextCNN-with-Attention/blob/HEAD/model.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":"059bfdf0c683e8f4","code_sha256_prefix":"059bfdf0c683e8f4","mcp_get_code":{"code_sha256":"059bfdf0c683e8f4"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wy-ei/Text-CNN","path":"trainer.py","file_url":"https://github.com/wy-ei/Text-CNN/blob/HEAD/trainer.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":"346efb91ac88dfd5","code_sha256_prefix":"346efb91ac88dfd5","mcp_get_code":{"code_sha256":"346efb91ac88dfd5"}},{"arxiv_id":"aaai_33972","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_33972","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sangamesh-kodge/SAP","path":"demo_spiral.py","file_url":"https://github.com/sangamesh-kodge/SAP/blob/HEAD/demo_spiral.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":"0bc5fd5d3b82848e","code_sha256_prefix":"0bc5fd5d3b82848e","mcp_get_code":{"code_sha256":"0bc5fd5d3b82848e"}},{"arxiv_id":"aaai_27804","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27804","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DingJianhao/StoG-meets-SNN","path":"utils.py","file_url":"https://github.com/DingJianhao/StoG-meets-SNN/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":"2146c08c33292789","code_sha256_prefix":"2146c08c33292789","mcp_get_code":{"code_sha256":"2146c08c33292789"}},{"arxiv_id":"aaai_26026","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26026","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JHL-HUST/PMMM","path":"node_classification/train_search.py","file_url":"https://github.com/JHL-HUST/PMMM/blob/HEAD/node_classification/train_search.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":"d8723a8b0ad4ba47","code_sha256_prefix":"d8723a8b0ad4ba47","mcp_get_code":{"code_sha256":"d8723a8b0ad4ba47"}},{"arxiv_id":"aaai_26026","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26026","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JHL-HUST/PMMM","path":"recommendation/train_search.py","file_url":"https://github.com/JHL-HUST/PMMM/blob/HEAD/recommendation/train_search.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":"b5bc094ba8fd1b6b","code_sha256_prefix":"b5bc094ba8fd1b6b","mcp_get_code":{"code_sha256":"b5bc094ba8fd1b6b"}},{"arxiv_id":"aaai_25958","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25958","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tsingqguo/bgmix","path":"train_Classifier.py","file_url":"https://github.com/tsingqguo/bgmix/blob/HEAD/train_Classifier.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":"17ac4e69bd209ede","code_sha256_prefix":"17ac4e69bd209ede","mcp_get_code":{"code_sha256":"17ac4e69bd209ede"}},{"arxiv_id":"aaai_25127","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25127","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HuiGuanLab/HiCo","path":"pretraining.py","file_url":"https://github.com/HuiGuanLab/HiCo/blob/HEAD/pretraining.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":"0e69f68c0427b547","code_sha256_prefix":"0e69f68c0427b547","mcp_get_code":{"code_sha256":"0e69f68c0427b547"}},{"arxiv_id":"aaai_21366","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21366","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"qkrdmsghk/TextSSL","path":"ssl_graphmodels/pyg_models/train_docs.py","file_url":"https://github.com/qkrdmsghk/TextSSL/blob/HEAD/ssl_graphmodels/pyg_models/train_docs.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":"b109987b326c381c","code_sha256_prefix":"b109987b326c381c","mcp_get_code":{"code_sha256":"b109987b326c381c"}},{"arxiv_id":"aaai_20650","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20650","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/UAE","path":"Supervised/train_models.py","file_url":"https://github.com/IBM/UAE/blob/HEAD/Supervised/train_models.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":"8b389eb9f5726984","code_sha256_prefix":"8b389eb9f5726984","mcp_get_code":{"code_sha256":"8b389eb9f5726984"}},{"arxiv_id":"aaai_20460","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20460","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"rpSebastian/AutoCFR","path":"autocfr/plot.py","file_url":"https://github.com/rpSebastian/AutoCFR/blob/HEAD/autocfr/plot.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":"56c6fc52bd8e5058","code_sha256_prefix":"56c6fc52bd8e5058","mcp_get_code":{"code_sha256":"56c6fc52bd8e5058"}},{"arxiv_id":"aaai_16351","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16351","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"taoxvzi/DPFPS","path":"DPFPS_main.py","file_url":"https://github.com/taoxvzi/DPFPS/blob/HEAD/DPFPS_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":"9badd9b056cf6777","code_sha256_prefix":"9badd9b056cf6777","mcp_get_code":{"code_sha256":"9badd9b056cf6777"}},{"arxiv_id":"Yang_Attentive_Mask_CLIP_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yang_Attentive_Mask_CLIP_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/A-CLIP","path":"main_linear.py","file_url":"https://github.com/microsoft/A-CLIP/blob/HEAD/main_linear.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":"9c147228c1764edd","code_sha256_prefix":"9c147228c1764edd","mcp_get_code":{"code_sha256":"9c147228c1764edd"}},{"arxiv_id":"Tiong_Flexible_Biometrics_Recognition_Bridging_the_Multimodality_Gap_through_Attention_Alignment_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Tiong_Flexible_Biometrics_Recognition_Bridging_the_Multimodality_Gap_through_Attention_Alignment_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MIS-DevWorks/FBR","path":"utils/model_utils.py","file_url":"https://github.com/MIS-DevWorks/FBR/blob/HEAD/utils/model_utils.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":"06607fd6f8064916","code_sha256_prefix":"06607fd6f8064916","mcp_get_code":{"code_sha256":"06607fd6f8064916"}},{"arxiv_id":"Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_Soteria_Provable_Defense_Against_Privacy_Leakage_in_Federated_Learning_From_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jeremy313/Soteria","path":"GS_attack/inversefed/training/training_routine.py","file_url":"https://github.com/jeremy313/Soteria/blob/HEAD/GS_attack/inversefed/training/training_routine.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":"02933464ca81a4fe","code_sha256_prefix":"02933464ca81a4fe","mcp_get_code":{"code_sha256":"02933464ca81a4fe"}},{"arxiv_id":"Guo_SCAN_Bootstrapping_Contrastive_Pre-training_for_Data_Efficiency_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Guo_SCAN_Bootstrapping_Contrastive_Pre-training_for_Data_Efficiency_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"guoyang9/SCAN","path":"moco-scan/main_moco.py","file_url":"https://github.com/guoyang9/SCAN/blob/HEAD/moco-scan/main_moco.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":"0498b1c7da6c83fc","code_sha256_prefix":"0498b1c7da6c83fc","mcp_get_code":{"code_sha256":"0498b1c7da6c83fc"}},{"arxiv_id":"2023.findings-acl.876","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.876","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"szegedai/MLSM","path":"finetune_eval.py","file_url":"https://github.com/szegedai/MLSM/blob/HEAD/finetune_eval.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":"fb3abc74a32b33c2","code_sha256_prefix":"fb3abc74a32b33c2","mcp_get_code":{"code_sha256":"fb3abc74a32b33c2"}},{"arxiv_id":"2023.acl-long.782","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.782","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tenvence/ulra","path":"engine.py","file_url":"https://github.com/tenvence/ulra/blob/HEAD/engine.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":"4304feaceaeaad4f","code_sha256_prefix":"4304feaceaeaad4f","mcp_get_code":{"code_sha256":"4304feaceaeaad4f"}},{"arxiv_id":"136860514","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136860514 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"facebookresearch/SLIP","path":"main_linear.py","file_url":"https://github.com/facebookresearch/SLIP/blob/HEAD/main_linear.py","status":"ran","verification_level":1,"contract_check":null,"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, facebookresearch/SLIP, 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":"9c147228c1764edd","code_sha256_prefix":"9c147228c1764edd","mcp_get_code":{"code_sha256":"9c147228c1764edd"}}],"record_sha256":"f47e1cf5ab33e87f0a63f0f9f0f1934a4af33344bda4582d72ec5253618d5398","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}