{"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-multiple","entry":"pad_to_multiple","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":14,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":5,"ran_fixture":0,"ran":3,"unverified":4},"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":"2601.20104","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20104","title":"NucFuseRank: Dataset Fusion and Performance Ranking for Nuclei Instance Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"masih4/NucleiAnalysis","path":"Evaluate.py","file_url":"https://github.com/masih4/NucleiAnalysis/blob/HEAD/Evaluate.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":"002bda16c58651bc","code_sha256_prefix":"002bda16c58651bc","mcp_get_code":{"code_sha256":"002bda16c58651bc"}},{"arxiv_id":"2507.06363","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.06363","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"gmum/MambaHoME","path":"src/models/soft_moe_2d_3d.py","file_url":"https://github.com/gmum/MambaHoME/blob/HEAD/src/models/soft_moe_2d_3d.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":"231058f3e271eb01","code_sha256_prefix":"231058f3e271eb01","mcp_get_code":{"code_sha256":"231058f3e271eb01"}},{"arxiv_id":"2505.02625","arxiv_id_is_arxiv":true,"paper":"/paper/llama-omni2-llm-based-real-time-spoken","title":"LLaMA-Omni2: LLM-based Real-time Spoken Chatbot with Autoregressive Streaming Speech Synthesis","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tarepan/SpeechMOS","path":"speechmos/utmos22/fairseq_alt.py","file_url":"https://github.com/tarepan/SpeechMOS/blob/HEAD/speechmos/utmos22/fairseq_alt.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":"49d0b5ded7a1be92","code_sha256_prefix":"49d0b5ded7a1be92","mcp_get_code":{"code_sha256":"49d0b5ded7a1be92"}},{"arxiv_id":"2402.15160","arxiv_id_is_arxiv":true,"paper":"/paper/spatially-aware-transformer-memory-for","title":"Spatially-Aware Transformer for Embodied Agents","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junmokane/spatially-aware-transformer","path":"htm/hcam.py","file_url":"https://github.com/junmokane/spatially-aware-transformer/blob/HEAD/htm/hcam.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, junmokane/spatially-aware-transformer when it was checked","code_sha256":"4f5419184b0129f9","code_sha256_prefix":"4f5419184b0129f9","mcp_get_code":{"code_sha256":"4f5419184b0129f9"}},{"arxiv_id":"2306.05407","arxiv_id_is_arxiv":true,"paper":"/paper/snap-self-supervised-neural-maps-for-visual-1","title":"SNAP: Self-Supervised Neural Maps for Visual Positioning and Semantic Understanding","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/snap","path":"snap/models/image_encoder.py","file_url":"https://github.com/google-research/snap/blob/HEAD/snap/models/image_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, google-research/snap, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"3f53d845c39b8bf4","code_sha256_prefix":"3f53d845c39b8bf4","mcp_get_code":{"code_sha256":"3f53d845c39b8bf4"}},{"arxiv_id":"2210.02592","arxiv_id_is_arxiv":true,"paper":"/paper/ccc-wav2vec-2-0-clustering-aided-cross","title":"CCC-wav2vec 2.0: Clustering aided Cross Contrastive Self-supervised learning of speech representations","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"speech-lab-iitm/ccc-wav2vec-2.0","path":"fairseq/models/wav2vec/utils.py","file_url":"https://github.com/speech-lab-iitm/ccc-wav2vec-2.0/blob/HEAD/fairseq/models/wav2vec/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, speech-lab-iitm/ccc-wav2vec-2.0, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"b57d92d8a18d12a3","code_sha256_prefix":"b57d92d8a18d12a3","mcp_get_code":{"code_sha256":"b57d92d8a18d12a3"}},{"arxiv_id":"2207.00555","arxiv_id_is_arxiv":true,"paper":"/paper/fithubert-going-thinner-and-deeper-for","title":"FitHuBERT: Going Thinner and Deeper for Knowledge Distillation of Speech Self-Supervised Learning","date":"2022-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glory20h/FitHuBERT","path":"fithubert/module.py","file_url":"https://github.com/glory20h/FitHuBERT/blob/HEAD/fithubert/module.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from speech-lab-iitm/ccc-wav2vec-2.0, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"b57d92d8a18d12a3","code_sha256_prefix":"b57d92d8a18d12a3","mcp_get_code":{"code_sha256":"b57d92d8a18d12a3"}},{"arxiv_id":"2203.15610","arxiv_id_is_arxiv":true,"paper":"/paper/lighthubert-lightweight-and-configurable","title":"LightHuBERT: Lightweight and Configurable Speech Representation Learning with Once-for-All Hidden-Unit BERT","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mechanicalsea/lighthubert","path":"lighthubert/functional/fairseq_utils.py","file_url":"https://github.com/mechanicalsea/lighthubert/blob/HEAD/lighthubert/functional/fairseq_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from speech-lab-iitm/ccc-wav2vec-2.0, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"b57d92d8a18d12a3","code_sha256_prefix":"b57d92d8a18d12a3","mcp_get_code":{"code_sha256":"b57d92d8a18d12a3"}},{"arxiv_id":"2110.13711","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-transformers-are-more-efficient","title":"Hierarchical Transformers Are More Efficient Language Models","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/hourglass-transformer-pytorch","path":"hourglass_transformer_pytorch/hourglass_transformer_pytorch.py","file_url":"https://github.com/lucidrains/hourglass-transformer-pytorch/blob/HEAD/hourglass_transformer_pytorch/hourglass_transformer_pytorch.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":"7b1a6a233eb01a3b","code_sha256_prefix":"7b1a6a233eb01a3b","mcp_get_code":{"code_sha256":"7b1a6a233eb01a3b"}},{"arxiv_id":"2107.02192","arxiv_id_is_arxiv":true,"paper":"/paper/long-short-transformer-efficient-transformers","title":"Long-Short Transformer: Efficient Transformers for Language and Vision","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/long-short-transformer","path":"long_short_transformer/long_short_transformer.py","file_url":"https://github.com/lucidrains/long-short-transformer/blob/HEAD/long_short_transformer/long_short_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf60f4efa3554792","code_sha256_prefix":"cf60f4efa3554792","mcp_get_code":{"code_sha256":"cf60f4efa3554792"}},{"arxiv_id":"2106.12672","arxiv_id_is_arxiv":true,"paper":"/paper/charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/charformer-pytorch","path":"charformer_pytorch/charformer_pytorch.py","file_url":"https://github.com/lucidrains/charformer-pytorch/blob/HEAD/charformer_pytorch/charformer_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a84e35f3a42e1eb","code_sha256_prefix":"5a84e35f3a42e1eb","mcp_get_code":{"code_sha256":"5a84e35f3a42e1eb"}},{"arxiv_id":"2105.08050","arxiv_id_is_arxiv":true,"paper":"/paper/pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/g-mlp-gpt","path":"g_mlp_gpt/g_mlp_gpt.py","file_url":"https://github.com/lucidrains/g-mlp-gpt/blob/HEAD/g_mlp_gpt/g_mlp_gpt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df3be65159852cd8","code_sha256_prefix":"df3be65159852cd8","mcp_get_code":{"code_sha256":"df3be65159852cd8"}},{"arxiv_id":"1511.05879","arxiv_id_is_arxiv":true,"paper":"/paper/particular-object-retrieval-with-integral-max","title":"Particular object retrieval with integral max-pooling of CNN activations","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moabitcoin/sisyphus","path":"sfi/transforms.py","file_url":"https://github.com/moabitcoin/sisyphus/blob/HEAD/sfi/transforms.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":"13336f591d395532","code_sha256_prefix":"13336f591d395532","mcp_get_code":{"code_sha256":"13336f591d395532"}},{"arxiv_id":"openreview_xyKr7qopq6","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_xyKr7qopq6","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Kust-lp/ECMRNet","path":"codes/infer.py","file_url":"https://github.com/Kust-lp/ECMRNet/blob/HEAD/codes/infer.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":"e272c52445a48250","code_sha256_prefix":"e272c52445a48250","mcp_get_code":{"code_sha256":"e272c52445a48250"}}],"record_sha256":"1a31c692f8e18f78a118a0782f2a796e9ac5513b2e723a534da9ef88f9e23c8d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}