{"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/download-file-from-google-drive","entry":"download_file_from_google_drive","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":13,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2209.15409","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"feee368db13f7be0","code_sha256_prefix":"feee368db13f7be0","mcp_get_code":{"code_sha256":"feee368db13f7be0"}},{"arxiv_id":"2202.06851","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc1cace2b69b6f80","code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"2010.06897","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ca4b3589df891c00","code_sha256_prefix":"ca4b3589df891c00","mcp_get_code":{"code_sha256":"ca4b3589df891c00"}},{"arxiv_id":"2010.00309","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c23741b45f0d0d67","code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}},{"arxiv_id":"1910.10261","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc1cace2b69b6f80","code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1903.03372","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c23741b45f0d0d67","code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}},{"arxiv_id":"1811.08264","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc1cace2b69b6f80","code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1808.10437","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc1cace2b69b6f80","code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"1805.07010","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"500e7106751f6ddf","code_sha256_prefix":"500e7106751f6ddf","mcp_get_code":{"code_sha256":"500e7106751f6ddf"}},{"arxiv_id":"1611.09940","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20f31737837ced8e","code_sha256_prefix":"20f31737837ced8e","mcp_get_code":{"code_sha256":"20f31737837ced8e"}},{"arxiv_id":"1506.03134","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20f31737837ced8e","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc1cace2b69b6f80","code_sha256_prefix":"dc1cace2b69b6f80","mcp_get_code":{"code_sha256":"dc1cace2b69b6f80"}},{"arxiv_id":"2025.emnlp-industry.89","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c23741b45f0d0d67","code_sha256_prefix":"c23741b45f0d0d67","mcp_get_code":{"code_sha256":"c23741b45f0d0d67"}}],"record_sha256":"9aa723d4e712dff6df3cbe400faf8054ace2de04b3a11b2215d357988bf394b4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}