{"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/pack-one","entry":"pack_one","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":2,"n_papers_ran_no_instrument_failure":0,"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":9,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":0,"unverified":8},"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.22244","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22244","title":"Is Hierarchical Quantization Essential for Optimal Reconstruction?","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"wiskott-lab/single-vs-hier-recon","path":"vector_quantize_pytorch/finite_scalar_quantization.py","file_url":"https://github.com/wiskott-lab/single-vs-hier-recon/blob/HEAD/vector_quantize_pytorch/finite_scalar_quantization.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab03f61657f300bc","code_sha256_prefix":"ab03f61657f300bc","mcp_get_code":{"code_sha256":"ab03f61657f300bc"}},{"arxiv_id":"2411.06070","arxiv_id_is_arxiv":true,"paper":"/paper/gft-graph-foundation-model-with-transferable","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","date":"2024-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/gft","path":"GFT/model/vq.py","file_url":"https://github.com/zehong-wang/gft/blob/HEAD/GFT/model/vq.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":"9adcac32b9f87dfb","code_sha256_prefix":"9adcac32b9f87dfb","mcp_get_code":{"code_sha256":"9adcac32b9f87dfb"}},{"arxiv_id":"2411.02038","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-representation-collapse-in-vector","title":"Addressing Representation Collapse in Vector Quantized Models with One Linear Layer","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/vector-quantize-pytorch","path":"vector_quantize_pytorch/latent_quantization.py","file_url":"https://github.com/lucidrains/vector-quantize-pytorch/blob/HEAD/vector_quantize_pytorch/latent_quantization.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":"97b2f8dd6c45be1b","code_sha256_prefix":"97b2f8dd6c45be1b","mcp_get_code":{"code_sha256":"97b2f8dd6c45be1b"}},{"arxiv_id":"2409.18591","arxiv_id_is_arxiv":true,"paper":"/paper/off-to-new-shores-a-dataset-benchmark-for","title":"Off to new Shores: A Dataset & Benchmark for (near-)coastal Flood Inundation Forecasting","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multihuntr/gff","path":"gff/models/metnet.py","file_url":"https://github.com/multihuntr/gff/blob/HEAD/gff/models/metnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9603f8286f20223f","code_sha256_prefix":"9603f8286f20223f","mcp_get_code":{"code_sha256":"9603f8286f20223f"}},{"arxiv_id":"2401.12945","arxiv_id_is_arxiv":true,"paper":"/paper/lumiere-a-space-time-diffusion-model-for","title":"Lumiere: A Space-Time Diffusion Model for Video Generation","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/lumiere-pytorch","path":"lumiere_pytorch/lumiere.py","file_url":"https://github.com/lucidrains/lumiere-pytorch/blob/HEAD/lumiere_pytorch/lumiere.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":"bc82cc3c910834ed","code_sha256_prefix":"bc82cc3c910834ed","mcp_get_code":{"code_sha256":"bc82cc3c910834ed"}},{"arxiv_id":"2310.06625","arxiv_id_is_arxiv":true,"paper":"/paper/itransformer-inverted-transformers-are","title":"iTransformer: Inverted Transformers Are Effective for Time Series Forecasting","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/iTransformer","path":"iTransformer/iTransformer2D.py","file_url":"https://github.com/lucidrains/iTransformer/blob/HEAD/iTransformer/iTransformer2D.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":"6182326691dd827b","code_sha256_prefix":"6182326691dd827b","mcp_get_code":{"code_sha256":"6182326691dd827b"}},{"arxiv_id":"2309.02612","arxiv_id_is_arxiv":true,"paper":"/paper/music-source-separation-with-band-split-rope","title":"Music Source Separation with Band-Split RoPE Transformer","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":"archive","repo":"lucidrains/BS-RoFormer","path":"bs_roformer/bs_roformer.py","file_url":"https://github.com/lucidrains/BS-RoFormer/blob/HEAD/bs_roformer/bs_roformer.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab03f61657f300bc","code_sha256_prefix":"ab03f61657f300bc","mcp_get_code":{"code_sha256":"ab03f61657f300bc"}},{"arxiv_id":"2308.00951","arxiv_id_is_arxiv":true,"paper":"/paper/from-sparse-to-soft-mixtures-of-experts","title":"From Sparse to Soft Mixtures of Experts","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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":"ab03f61657f300bc","code_sha256_prefix":"ab03f61657f300bc","mcp_get_code":{"code_sha256":"ab03f61657f300bc"}},{"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/unet_upsampler.py","file_url":"https://github.com/lucidrains/gigagan-pytorch/blob/HEAD/gigagan_pytorch/unet_upsampler.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":"86ca4a3f9ab20a35","code_sha256_prefix":"86ca4a3f9ab20a35","mcp_get_code":{"code_sha256":"86ca4a3f9ab20a35"}},{"arxiv_id":"2302.03655","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-so-3-convolutions-to-so-2-for","title":"Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs","date":"2023-02-07","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":false,"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":"122e87ee0b05894f","code_sha256_prefix":"122e87ee0b05894f","mcp_get_code":{"code_sha256":"122e87ee0b05894f"}},{"arxiv_id":"2302.01327","arxiv_id_is_arxiv":true,"paper":"/paper/dual-patchnorm","title":"Dual PatchNorm","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/MEGABYTE-pytorch","path":"MEGABYTE_pytorch/megabyte.py","file_url":"https://github.com/lucidrains/MEGABYTE-pytorch/blob/HEAD/MEGABYTE_pytorch/megabyte.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":"6182326691dd827b","code_sha256_prefix":"6182326691dd827b","mcp_get_code":{"code_sha256":"6182326691dd827b"}},{"arxiv_id":"2206.11990","arxiv_id_is_arxiv":true,"paper":"/paper/equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/equiformer-pytorch","path":"equiformer_pytorch/equiformer_pytorch.py","file_url":"https://github.com/lucidrains/equiformer-pytorch/blob/HEAD/equiformer_pytorch/equiformer_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"122e87ee0b05894f","code_sha256_prefix":"122e87ee0b05894f","mcp_get_code":{"code_sha256":"122e87ee0b05894f"}},{"arxiv_id":"2205.14135","arxiv_id_is_arxiv":true,"paper":"/paper/flashattention-fast-and-memory-efficient","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","date":"2022-05-27","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":"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":"86ca4a3f9ab20a35","code_sha256_prefix":"86ca4a3f9ab20a35","mcp_get_code":{"code_sha256":"86ca4a3f9ab20a35"}},{"arxiv_id":"01329","arxiv_id_is_arxiv":false,"paper":null,"title":"id 01329 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ethanliuyu/ElegantlyWritten","path":"models/quantize.py","file_url":"https://github.com/ethanliuyu/ElegantlyWritten/blob/HEAD/models/quantize.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":"a67e2a1dc6af5215","code_sha256_prefix":"a67e2a1dc6af5215","mcp_get_code":{"code_sha256":"a67e2a1dc6af5215"}}],"record_sha256":"535f6071ed976d46a7cfad1c3f2fc6e98e0232a4b9f5e630fd9a63a21653570a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}