{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/download-file-from-google-drive","entry":"download_file_from_google_drive","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":0,"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":6,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2209.15409","paper":"/paper/higher-order-neural-additive-models-an","title":"Higher-order Neural Additive Models: An Interpretable Machine Learning Model with Feature Interactions","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gim4855744/honam","path":"honam/fetchdata.py","file_url":"https://github.com/gim4855744/honam/blob/HEAD/honam/fetchdata.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"feee368db13f7be0","mcp_get_code":{"code_sha256":"feee368db13f7be0"}},{"arxiv_id":"2202.06851","paper":"/paper/hake-a-knowledge-engine-foundation-for-human","title":"HAKE: A Knowledge Engine Foundation for Human Activity Understanding","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DirtyHarryLYL/HAKE","path":"Images/download_image/Download_data.py","file_url":"https://github.com/DirtyHarryLYL/HAKE/blob/HEAD/Images/download_image/Download_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"2010.06897","paper":"/paper/adaptive-attentive-geolocalization-from-few","title":"Adaptive-Attentive Geolocalization from few queries: a hybrid approach","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeriopaolicelli/AdAGeo","path":"src/download_and_unzip_svox.py","file_url":"https://github.com/valeriopaolicelli/AdAGeo/blob/HEAD/src/download_and_unzip_svox.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ca4b3589df891c00","mcp_get_code":{"code_sha256":"ca4b3589df891c00"}},{"arxiv_id":"2010.00309","paper":"/paper/colake-contextualized-language-and-knowledge","title":"CoLAKE: Contextualized Language and Knowledge Embedding","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"txsun1997/CoLAKE","path":"download_gdrive.py","file_url":"https://github.com/txsun1997/CoLAKE/blob/HEAD/download_gdrive.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}},{"arxiv_id":"1910.10261","paper":"/paper/quartznet-deep-automatic-speech-recognition","title":"QuartzNet: Deep Automatic Speech Recognition with 1D Time-Channel Separable Convolutions","date":null,"month_inferred_from_arxiv_id":"2019-10","title_source":"archive","repo":"marka17/digit-recognition","path":"gfile.py","file_url":"https://github.com/marka17/digit-recognition/blob/HEAD/gfile.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1903.03372","paper":"/paper/semantically-tied-paired-cycle-consistency","title":"Semantically Tied Paired Cycle Consistency for Zero-Shot Sketch-based Image Retrieval","date":"2019-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AnjanDutta/sem-pcyc","path":"src/download_gdrive.py","file_url":"https://github.com/AnjanDutta/sem-pcyc/blob/HEAD/src/download_gdrive.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}},{"arxiv_id":"1811.08264","paper":"/paper/transferable-interactiveness-prior-for-human","title":"Transferable Interactiveness Knowledge for Human-Object Interaction Detection","date":"2018-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DirtyHarryLYL/Transferable-Interactiveness-Network","path":"lib/ult/Download_data.py","file_url":"https://github.com/DirtyHarryLYL/Transferable-Interactiveness-Network/blob/HEAD/lib/ult/Download_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1808.10437","paper":"/paper/ican-instance-centric-attention-network-for","title":"iCAN: Instance-Centric Attention Network for Human-Object Interaction Detection","date":"2018-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vt-vl-lab/iCAN","path":"lib/ult/Download_data.py","file_url":"https://github.com/vt-vl-lab/iCAN/blob/HEAD/lib/ult/Download_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1805.07010","paper":"/paper/learning-permutations-with-sinkhorn-policy","title":"Learning Permutations with Sinkhorn Policy Gradient","date":"2018-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pemami4911/sinkhorn-policy-gradient.pytorch","path":"envs/tsp_task.py","file_url":"https://github.com/pemami4911/sinkhorn-policy-gradient.pytorch/blob/HEAD/envs/tsp_task.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"500e7106751f6ddf","mcp_get_code":{"code_sha256":"500e7106751f6ddf"}},{"arxiv_id":"1611.09940","paper":"/paper/neural-combinatorial-optimization-with","title":"Neural Combinatorial Optimization with Reinforcement Learning","date":"2016-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pemami4911/neural-combinatorial-rl-pytorch","path":"tsp_task.py","file_url":"https://github.com/pemami4911/neural-combinatorial-rl-pytorch/blob/HEAD/tsp_task.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20f31737837ced8e","mcp_get_code":{"code_sha256":"20f31737837ced8e"}},{"arxiv_id":"1506.03134","paper":"/paper/pointer-networks","title":"Pointer Networks","date":"2015-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devsisters/pointer-network-tensorflow","path":"download.py","file_url":"https://github.com/devsisters/pointer-network-tensorflow/blob/HEAD/download.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20f31737837ced8e","mcp_get_code":{"code_sha256":"20f31737837ced8e"}},{"arxiv_id":"Bae_Multi-View_Depth_Estimation_by_Fusing_Single-View_Depth_Probability_With_Multi-View_CVPR_2022_paper","paper":null,"title":"arXiv:Bae_Multi-View_Depth_Estimation_by_Fusing_Single-View_Depth_Probability_With_Multi-View_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"baegwangbin/MaGNet","path":"ckpts/download.py","file_url":"https://github.com/baegwangbin/MaGNet/blob/HEAD/ckpts/download.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"2025.emnlp-industry.89","paper":null,"title":"arXiv:2025.emnlp-industry.89","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sssrlll/L4","path":"gdown.py","file_url":"https://github.com/sssrlll/L4/blob/HEAD/gdown.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}}]}