{"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/create-loader","entry":"create_loader","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":5,"unverified":0},"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":"2501.01428","arxiv_id_is_arxiv":true,"paper":"/paper/gpt4scene-understand-3d-scenes-from-videos","title":"GPT4Scene: Understand 3D Scenes from Videos with Vision-Language Models","date":"2025-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qi-Zhangyang/GPT4Scene","path":"evaluate/val_dataset.py","file_url":"https://github.com/Qi-Zhangyang/GPT4Scene/blob/HEAD/evaluate/val_dataset.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":"c11a23c56c87bd2d","code_sha256_prefix":"c11a23c56c87bd2d","mcp_get_code":{"code_sha256":"c11a23c56c87bd2d"}},{"arxiv_id":"2305.07922","arxiv_id_is_arxiv":true,"paper":"/paper/codet5-open-code-large-language-models-for","title":"CodeT5+: Open Code Large Language Models for Code Understanding and Generation","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/codet5","path":"CodeT5+/code_retrieval/data_utils.py","file_url":"https://github.com/salesforce/codet5/blob/HEAD/CodeT5%2B/code_retrieval/data_utils.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":"634ef255c2b583be","code_sha256_prefix":"634ef255c2b583be","mcp_get_code":{"code_sha256":"634ef255c2b583be"}},{"arxiv_id":"2212.09748","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-diffusion-models-with-transformers","title":"Scalable Diffusion Models with Transformers","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/diffusion-transformer","path":"image_datasets.py","file_url":"https://github.com/milmor/diffusion-transformer/blob/HEAD/image_datasets.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":"deedff7c289ab393","code_sha256_prefix":"deedff7c289ab393","mcp_get_code":{"code_sha256":"deedff7c289ab393"}},{"arxiv_id":"2108.01684","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformer-with-progressive-sampling","title":"Vision Transformer with Progressive Sampling","date":"2021-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuexy/PS-ViT","path":"utils/loader.py","file_url":"https://github.com/yuexy/PS-ViT/blob/HEAD/utils/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":"1cf1c5e0f9a581ba","code_sha256_prefix":"1cf1c5e0f9a581ba","mcp_get_code":{"code_sha256":"1cf1c5e0f9a581ba"}},{"arxiv_id":"2103.12731","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-local-self-attention-for-parameter","title":"Scaling Local Self-Attention for Parameter Efficient Visual Backbones","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin-ssy/ViP","path":"utils/loader.py","file_url":"https://github.com/kevin-ssy/ViP/blob/HEAD/utils/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":"1cf1c5e0f9a581ba","code_sha256_prefix":"1cf1c5e0f9a581ba","mcp_get_code":{"code_sha256":"1cf1c5e0f9a581ba"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/LadaGAN-pytorch","path":"image_datasets.py","file_url":"https://github.com/milmor/LadaGAN-pytorch/blob/HEAD/image_datasets.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":"0c5eecc2f5f4579c","code_sha256_prefix":"0c5eecc2f5f4579c","mcp_get_code":{"code_sha256":"0c5eecc2f5f4579c"}}],"record_sha256":"f4560b106e7f4ef099f337099c57ec2e0314bd8316bcd37c79a14359cbfd2d26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}