{"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/val","entry":"val","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":24,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":1,"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":26,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":1,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":27,"n_places_pointer_only":11,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":6,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":7,"unverified":12},"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":"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":"9d8a6d700a2e387a","code_sha256_prefix":"9d8a6d700a2e387a","mcp_get_code":{"code_sha256":"9d8a6d700a2e387a"}},{"arxiv_id":"2406.15524","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-pruning-large-language-models","title":"Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"log-postech/rethinking-llm-pruning","path":"lib/llama/finetune.py","file_url":"https://github.com/log-postech/rethinking-llm-pruning/blob/HEAD/lib/llama/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, log-postech/rethinking-llm-pruning when it was checked","code_sha256":"c8b35875f810484d","code_sha256_prefix":"c8b35875f810484d","mcp_get_code":{"code_sha256":"c8b35875f810484d"}},{"arxiv_id":"2406.09317","arxiv_id_is_arxiv":true,"paper":"/paper/common-and-rare-fundus-diseases","title":"Enhancing Diagnostic Accuracy in Rare and Common Fundus Diseases with a Knowledge-Rich Vision-Language Model","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LooKing9218/RetiZero","path":"Finetuning.py","file_url":"https://github.com/LooKing9218/RetiZero/blob/HEAD/Finetuning.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, LooKing9218/RetiZero when it was checked","code_sha256":"30240001cf3459dc","code_sha256_prefix":"30240001cf3459dc","mcp_get_code":{"code_sha256":"30240001cf3459dc"}},{"arxiv_id":"2406.03923","arxiv_id_is_arxiv":true,"paper":"/paper/latent-neural-operator-for-solving-forward","title":"Latent Neural Operator for Solving Forward and Inverse PDE Problems","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-i-m-i-t/latentneuraloperator","path":"LNO-PyTorch/ForwardProblem/exp.py","file_url":"https://github.com/l-i-m-i-t/latentneuraloperator/blob/HEAD/LNO-PyTorch/ForwardProblem/exp.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":"7101f7fa241b749a","code_sha256_prefix":"7101f7fa241b749a","mcp_get_code":{"code_sha256":"7101f7fa241b749a"}},{"arxiv_id":"2402.12419","arxiv_id_is_arxiv":true,"paper":"/paper/ebft-effective-and-block-wise-fine-tuning-for","title":"EBFT: Effective and Block-Wise Fine-Tuning for Sparse LLMs","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunggo/ebft","path":"lib/finetune.py","file_url":"https://github.com/sunggo/ebft/blob/HEAD/lib/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, sunggo/ebft when it was checked","code_sha256":"dbd588c5078a3bc9","code_sha256_prefix":"dbd588c5078a3bc9","mcp_get_code":{"code_sha256":"dbd588c5078a3bc9"}},{"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":"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":"49732bab8713a245","code_sha256_prefix":"49732bab8713a245","mcp_get_code":{"code_sha256":"49732bab8713a245"}},{"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":"f787337c5aaa6127","code_sha256_prefix":"f787337c5aaa6127","mcp_get_code":{"code_sha256":"f787337c5aaa6127"}},{"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":"7bf5ba7073f803fc","code_sha256_prefix":"7bf5ba7073f803fc","mcp_get_code":{"code_sha256":"7bf5ba7073f803fc"}},{"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":"96ef9a5852ce9997","code_sha256_prefix":"96ef9a5852ce9997","mcp_get_code":{"code_sha256":"96ef9a5852ce9997"}},{"arxiv_id":"2304.04321","arxiv_id_is_arxiv":true,"paper":"/paper/arnold-a-benchmark-for-language-grounded-task","title":"ARNOLD: A Benchmark for Language-Grounded Task Learning With Continuous States in Realistic 3D Scenes","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnold-benchmark/arnold","path":"train_cliport6d.py","file_url":"https://github.com/arnold-benchmark/arnold/blob/HEAD/train_cliport6d.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":"e241a1dff2e417df","code_sha256_prefix":"e241a1dff2e417df","mcp_get_code":{"code_sha256":"e241a1dff2e417df"}},{"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":"7ff8886920adc1a3","code_sha256_prefix":"7ff8886920adc1a3","mcp_get_code":{"code_sha256":"7ff8886920adc1a3"}},{"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":"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":"5e20167b79ec09a4","code_sha256_prefix":"5e20167b79ec09a4","mcp_get_code":{"code_sha256":"5e20167b79ec09a4"}},{"arxiv_id":"2205.10733","arxiv_id_is_arxiv":true,"paper":"/paper/grab-finding-provably-better-data","title":"GraB: Finding Provably Better Data Permutations than Random Reshuffling","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenelyc/grab","path":"examples/train_logistic_regression.py","file_url":"https://github.com/eugenelyc/grab/blob/HEAD/examples/train_logistic_regression.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":"801a97282ddcecf8","code_sha256_prefix":"801a97282ddcecf8","mcp_get_code":{"code_sha256":"801a97282ddcecf8"}},{"arxiv_id":"2203.15190","arxiv_id_is_arxiv":true,"paper":"/paper/3d-shape-reconstruction-from-2d-images-with","title":"3D Shape Reconstruction from 2D Images with Disentangled Attribute Flow","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junshengzhou/3DAttriFlow","path":"train_svr.py","file_url":"https://github.com/junshengzhou/3DAttriFlow/blob/HEAD/train_svr.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":"46f620de04f39ed7","code_sha256_prefix":"46f620de04f39ed7","mcp_get_code":{"code_sha256":"46f620de04f39ed7"}},{"arxiv_id":"2203.14542","arxiv_id_is_arxiv":true,"paper":"/paper/unicon-combating-label-noise-through-uniform","title":"UNICON: Combating Label Noise Through Uniform Selection and Contrastive Learning","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nazmul-karim170/unicon-noisy-label","path":"Train_clothing1M.py","file_url":"https://github.com/nazmul-karim170/unicon-noisy-label/blob/HEAD/Train_clothing1M.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":"1012a2f9309055ef","code_sha256_prefix":"1012a2f9309055ef","mcp_get_code":{"code_sha256":"1012a2f9309055ef"}},{"arxiv_id":"2112.10789","arxiv_id_is_arxiv":true,"paper":"/paper/machine-learning-discovery-of-new-phases-in","title":"Machine learning discovery of new phases in programmable quantum simulator snapshots","date":"2021-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KimGroup/QGasML","path":"lassopath.py","file_url":"https://github.com/KimGroup/QGasML/blob/HEAD/lassopath.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":"5deec296a6bf2967","code_sha256_prefix":"5deec296a6bf2967","mcp_get_code":{"code_sha256":"5deec296a6bf2967"}},{"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":"d9191590db201cdf","code_sha256_prefix":"d9191590db201cdf","mcp_get_code":{"code_sha256":"d9191590db201cdf"}},{"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_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":"4f69a77f04e33665","code_sha256_prefix":"4f69a77f04e33665","mcp_get_code":{"code_sha256":"4f69a77f04e33665"}},{"arxiv_id":"2103.13023","arxiv_id_is_arxiv":true,"paper":"/paper/can-vision-transformers-learn-without-natural","title":"Can Vision Transformers Learn without Natural Images?","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hirokatsukataoka16/FractalDB-Pretrained-ResNet-PyTorch","path":"finetuning/train_val.py","file_url":"https://github.com/hirokatsukataoka16/FractalDB-Pretrained-ResNet-PyTorch/blob/HEAD/finetuning/train_val.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":"f6a8dbeb6413ff98","code_sha256_prefix":"f6a8dbeb6413ff98","mcp_get_code":{"code_sha256":"f6a8dbeb6413ff98"}},{"arxiv_id":"1902.07473","arxiv_id_is_arxiv":true,"paper":"/paper/dual-modality-seq2seq-network-for-audio","title":"Dual-modality seq2seq network for audio-visual event localization","date":"2019-02-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":"219c7611d3659ea1","code_sha256_prefix":"219c7611d3659ea1","mcp_get_code":{"code_sha256":"219c7611d3659ea1"}},{"arxiv_id":"1803.08842","arxiv_id_is_arxiv":true,"paper":"/paper/audio-visual-event-localization-in","title":"Audio-Visual Event Localization in Unconstrained Videos","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YapengTian/AVE-ECCV18","path":"supervised_main.py","file_url":"https://github.com/YapengTian/AVE-ECCV18/blob/HEAD/supervised_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, YapengTian/AVE-ECCV18 when it was checked","code_sha256":"219c7611d3659ea1","code_sha256_prefix":"219c7611d3659ea1","mcp_get_code":{"code_sha256":"219c7611d3659ea1"}},{"arxiv_id":"1711.06368","arxiv_id_is_arxiv":true,"paper":"/paper/mobile-video-object-detection-with-temporally","title":"Mobile Video Object Detection with Temporally-Aware Feature Maps","date":"2017-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vikrant7/mobile-vod-bottleneck-lstm","path":"train_mvod_basenet.py","file_url":"https://github.com/vikrant7/mobile-vod-bottleneck-lstm/blob/HEAD/train_mvod_basenet.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, vikrant7/mobile-vod-bottleneck-lstm when it was checked","code_sha256":"bc785e3bb3be8a15","code_sha256_prefix":"bc785e3bb3be8a15","mcp_get_code":{"code_sha256":"bc785e3bb3be8a15"}},{"arxiv_id":"1711.06368","arxiv_id_is_arxiv":true,"paper":"/paper/mobile-video-object-detection-with-temporally","title":"Mobile Video Object Detection with Temporally-Aware Feature Maps","date":"2017-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vikrant7/mobile-vod-bottleneck-lstm","path":"train_mvod_lstm1.py","file_url":"https://github.com/vikrant7/mobile-vod-bottleneck-lstm/blob/HEAD/train_mvod_lstm1.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, vikrant7/mobile-vod-bottleneck-lstm when it was checked","code_sha256":"0450965c711c906d","code_sha256_prefix":"0450965c711c906d","mcp_get_code":{"code_sha256":"0450965c711c906d"}},{"arxiv_id":"1703.11008","arxiv_id_is_arxiv":true,"paper":"/paper/computing-nonvacuous-generalization-bounds","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","date":"2017-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grasp-lyrl/sloppy","path":"bayes1.py","file_url":"https://github.com/grasp-lyrl/sloppy/blob/HEAD/bayes1.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, grasp-lyrl/sloppy when it was checked","code_sha256":"0112fd9162a57434","code_sha256_prefix":"0112fd9162a57434","mcp_get_code":{"code_sha256":"0112fd9162a57434"}},{"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":"f4da3a310e989511","code_sha256_prefix":"f4da3a310e989511","mcp_get_code":{"code_sha256":"f4da3a310e989511"}},{"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":"sparse_code_utils.py","file_url":"https://github.com/DingJianhao/StoG-meets-SNN/blob/HEAD/sparse_code_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":"e59d4d3fabd87987","code_sha256_prefix":"e59d4d3fabd87987","mcp_get_code":{"code_sha256":"e59d4d3fabd87987"}},{"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":"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":"677ba1186b7388df","code_sha256_prefix":"677ba1186b7388df","mcp_get_code":{"code_sha256":"677ba1186b7388df"}}],"record_sha256":"d4a397a4b80c78c38baa5ff2c400dcc39fd7dddb14c9e41bc84777f1df44c005","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}