{"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/is-empty","entry":"is_empty","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":3,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":15,"n_places_pointer_only":4,"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":5,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"unverified":1},"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":"2604.15140","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15140","title":"DiscoTrace: Representing and Comparing Answering Strategies of Humans and LLMs in Information-Seeking Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Watchful1/PushshiftDumps","path":"personal/combine/merge.py","file_url":"https://github.com/Watchful1/PushshiftDumps/blob/HEAD/personal/combine/merge.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"607d702150216f2f","code_sha256_prefix":"607d702150216f2f","mcp_get_code":{"code_sha256":"607d702150216f2f"}},{"arxiv_id":"2602.07063","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07063","title":"Video-based Music Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"serkansulun/trailer-genre-classification","path":"utils.py","file_url":"https://github.com/serkansulun/trailer-genre-classification/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, serkansulun/trailer-genre-classification (NOASSERTION)","code_sha256":"0f369e196ec20e7c","code_sha256_prefix":"0f369e196ec20e7c","mcp_get_code":{"code_sha256":"0f369e196ec20e7c"}},{"arxiv_id":"2601.05851","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05851","title":"Router-Suggest: Dynamic Routing for Multimodal Auto-Completion in Visually-Grounded Dialogs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"devichand579/MAC","path":"TAC_models/mpc/main_trie_creation.py","file_url":"https://github.com/devichand579/MAC/blob/HEAD/TAC_models/mpc/main_trie_creation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06b3af2a41f83859","code_sha256_prefix":"06b3af2a41f83859","mcp_get_code":{"code_sha256":"06b3af2a41f83859"}},{"arxiv_id":"2502.12154","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-without-classifier-free-1","title":"Diffusion Models without Classifier-free Guidance","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/classifier-free-guidance-pytorch","path":"classifier_free_guidance_pytorch/classifier_free_guidance_pytorch.py","file_url":"https://github.com/lucidrains/classifier-free-guidance-pytorch/blob/HEAD/classifier_free_guidance_pytorch/classifier_free_guidance_pytorch.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":"5d2c2d7980cd0f5c","code_sha256_prefix":"5d2c2d7980cd0f5c","mcp_get_code":{"code_sha256":"5d2c2d7980cd0f5c"}},{"arxiv_id":"2407.16434","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-llm-s-cognition-via-structurization","title":"Enhancing LLM's Cognition via Structurization","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/struxgpt","path":"src/utils/str.py","file_url":"https://github.com/alibaba/struxgpt/blob/HEAD/src/utils/str.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"043a6276fc4cb5d1","code_sha256_prefix":"043a6276fc4cb5d1","mcp_get_code":{"code_sha256":"043a6276fc4cb5d1"}},{"arxiv_id":"2401.07322","arxiv_id_is_arxiv":true,"paper":"/paper/rsud20k-a-dataset-for-road-scene","title":"RSUD20K: A Dataset for Road Scene Understanding In Autonomous Driving","date":"2024-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hasibzunair/rsud20k","path":"utils/delete_img_wo_labels.py","file_url":"https://github.com/hasibzunair/rsud20k/blob/HEAD/utils/delete_img_wo_labels.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, hasibzunair/rsud20k when it was checked","code_sha256":"b98f6047150ea4e4","code_sha256_prefix":"b98f6047150ea4e4","mcp_get_code":{"code_sha256":"b98f6047150ea4e4"}},{"arxiv_id":"2303.05511","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-up-gans-for-text-to-image-synthesis","title":"Scaling up GANs for Text-to-Image Synthesis","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/gigagan-pytorch","path":"gigagan_pytorch/gigagan_pytorch.py","file_url":"https://github.com/lucidrains/gigagan-pytorch/blob/HEAD/gigagan_pytorch/gigagan_pytorch.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":"2c9c110bdde8a564","code_sha256_prefix":"2c9c110bdde8a564","mcp_get_code":{"code_sha256":"2c9c110bdde8a564"}},{"arxiv_id":"2203.07852","arxiv_id_is_arxiv":true,"paper":"/paper/block-recurrent-transformers","title":"Block-Recurrent Transformers","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/block-recurrent-transformer-pytorch","path":"block_recurrent_transformer_pytorch/block_recurrent_transformer_pytorch.py","file_url":"https://github.com/lucidrains/block-recurrent-transformer-pytorch/blob/HEAD/block_recurrent_transformer_pytorch/block_recurrent_transformer_pytorch.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"039ac61b2d11642b","code_sha256_prefix":"039ac61b2d11642b","mcp_get_code":{"code_sha256":"039ac61b2d11642b"}},{"arxiv_id":"2105.14850","arxiv_id_is_arxiv":true,"paper":"/paper/cascaded-head-colliding-attention","title":"Cascaded Head-colliding Attention","date":"2021-05-31","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":"deterministic","behaviour_fingerprint":true,"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":"a91aa4d3b29e189e","code_sha256_prefix":"a91aa4d3b29e189e","mcp_get_code":{"code_sha256":"a91aa4d3b29e189e"}},{"arxiv_id":"2102.12092","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-text-to-image-generation","title":"Zero-Shot Text-to-Image Generation","date":"2021-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/DALLE-pytorch","path":"dalle_pytorch/dalle_pytorch.py","file_url":"https://github.com/lucidrains/DALLE-pytorch/blob/HEAD/dalle_pytorch/dalle_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a91aa4d3b29e189e","code_sha256_prefix":"a91aa4d3b29e189e","mcp_get_code":{"code_sha256":"a91aa4d3b29e189e"}},{"arxiv_id":"1912.04958","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-image-quality-of","title":"Analyzing and Improving the Image Quality of StyleGAN","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bakikii/stylegan2-pytorch23","path":"stylegan2_pytorch/stylegan2_pytorch.py","file_url":"https://github.com/Bakikii/stylegan2-pytorch23/blob/HEAD/stylegan2_pytorch/stylegan2_pytorch.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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, Bakikii/stylegan2-pytorch23, is not in the permissive set Syntology serves inline","code_sha256":"78d64d6c6d3e642a","code_sha256_prefix":"78d64d6c6d3e642a","mcp_get_code":{"code_sha256":"78d64d6c6d3e642a"}},{"arxiv_id":"1910.02481","arxiv_id_is_arxiv":true,"paper":"/paper/learn-to-explain-efficiently-via-neural-logic","title":"Learn to Explain Efficiently via Neural Logic Inductive Learning","date":"2019-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gblackout/NLIL","path":"common/utlis.py","file_url":"https://github.com/gblackout/NLIL/blob/HEAD/common/utlis.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":"8c1627c1feb99bd5","code_sha256_prefix":"8c1627c1feb99bd5","mcp_get_code":{"code_sha256":"8c1627c1feb99bd5"}},{"arxiv_id":"1806.01830","arxiv_id_is_arxiv":true,"paper":"/paper/relational-deep-reinforcement-learning","title":"Relational Deep Reinforcement Learning","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nathangrinsztajn/Box-World","path":"boxworld_gen.py","file_url":"https://github.com/nathangrinsztajn/Box-World/blob/HEAD/boxworld_gen.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":"1370fecfbea0eb23","code_sha256_prefix":"1370fecfbea0eb23","mcp_get_code":{"code_sha256":"1370fecfbea0eb23"}},{"arxiv_id":"2025.acl-long.1425","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.1425","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"D2I-ai/struxgpt","path":"src/utils/str.py","file_url":"https://github.com/D2I-ai/struxgpt/blob/HEAD/src/utils/str.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"043a6276fc4cb5d1","code_sha256_prefix":"043a6276fc4cb5d1","mcp_get_code":{"code_sha256":"043a6276fc4cb5d1"}},{"arxiv_id":"2023.findings-emnlp.574","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.574","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mt-upc/SegAugment","path":"src/audio_alignment/get_source_text.py","file_url":"https://github.com/mt-upc/SegAugment/blob/HEAD/src/audio_alignment/get_source_text.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":"ddac19a99e6092b0","code_sha256_prefix":"ddac19a99e6092b0","mcp_get_code":{"code_sha256":"ddac19a99e6092b0"}}],"record_sha256":"7cbefafcd4d9a2b3b3caa6ced223f93042bd3d7a803b4e7a8873644b0047281e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}