{"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/pad-to-square","entry":"pad_to_square","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":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":3,"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":2,"ran":3,"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":"2605.00789","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00789","title":"Make Your LVLM KV Cache More Lightweight","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"howtoosee/LightKV","path":"lmms-eval/lmms_eval/mymodels/lightkv/module.py","file_url":"https://github.com/howtoosee/LightKV/blob/HEAD/lmms-eval/lmms_eval/mymodels/lightkv/module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73f5714053365c84","code_sha256_prefix":"73f5714053365c84","mcp_get_code":{"code_sha256":"73f5714053365c84"}},{"arxiv_id":"2505.24298","arxiv_id_is_arxiv":true,"paper":"/paper/areal-a-large-scale-asynchronous","title":"AReaL: A Large-Scale Asynchronous Reinforcement Learning System for Language Reasoning","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inclusionai/areal","path":"areal/dataset/geometry3k.py","file_url":"https://github.com/inclusionai/areal/blob/HEAD/areal/dataset/geometry3k.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":"57fa5d6aba08d9d5","code_sha256_prefix":"57fa5d6aba08d9d5","mcp_get_code":{"code_sha256":"57fa5d6aba08d9d5"}},{"arxiv_id":"2403.09981","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-text-to-3d-generation-via","title":"Controllable Text-to-3D Generation via Surface-Aligned Gaussian Splatting","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-cvgl/mvcontrol","path":"app_stage1.py","file_url":"https://github.com/wu-cvgl/mvcontrol/blob/HEAD/app_stage1.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e20f2847f4726ebc","code_sha256_prefix":"e20f2847f4726ebc","mcp_get_code":{"code_sha256":"e20f2847f4726ebc"}},{"arxiv_id":"2204.03972","arxiv_id_is_arxiv":true,"paper":"/paper/fashionclip-connecting-language-and-images","title":"Contrastive language and vision learning of general fashion concepts","date":"2022-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patrickjohncyh/fashion-clip","path":"fashion_clip/attention_map.py","file_url":"https://github.com/patrickjohncyh/fashion-clip/blob/HEAD/fashion_clip/attention_map.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":"954092c03f1d3195","code_sha256_prefix":"954092c03f1d3195","mcp_get_code":{"code_sha256":"954092c03f1d3195"}},{"arxiv_id":"2106.13358","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-perception-action-communication","title":"Scalable Perception-Action-Communication Loops with Convolutional and Graph Neural Networks","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/VGAI","path":"dataset.py","file_url":"https://github.com/VITA-Group/VGAI/blob/HEAD/dataset.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":"dfdf238cc257c75a","code_sha256_prefix":"dfdf238cc257c75a","mcp_get_code":{"code_sha256":"dfdf238cc257c75a"}},{"arxiv_id":"1802.06182","arxiv_id_is_arxiv":true,"paper":"/paper/crepe-a-convolutional-representation-for","title":"CREPE: A Convolutional Representation for Pitch Estimation","date":"2018-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bpiyush/SoundOfWater","path":"shared/utils/image.py","file_url":"https://github.com/bpiyush/SoundOfWater/blob/HEAD/shared/utils/image.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":"78cfceace594ec65","code_sha256_prefix":"78cfceace594ec65","mcp_get_code":{"code_sha256":"78cfceace594ec65"}}],"record_sha256":"d1a65f778f19148f9e4cecff1d1ee55a701699972e8c395c96b771a3d01eb7ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}