{"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/unpack-one","entry":"unpack_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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":4,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"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":3,"ran_fixture":0,"ran":1,"unverified":2},"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/latent_quantization.py","file_url":"https://github.com/wiskott-lab/single-vs-hier-recon/blob/HEAD/vector_quantize_pytorch/latent_quantization.py","status":"unverified","verification_level":0,"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":"4fdceb95b4bb47b7","code_sha256_prefix":"4fdceb95b4bb47b7","mcp_get_code":{"code_sha256":"4fdceb95b4bb47b7"}},{"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":"95a567bd7c1ffdce","code_sha256_prefix":"95a567bd7c1ffdce","mcp_get_code":{"code_sha256":"95a567bd7c1ffdce"}},{"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":"4fdceb95b4bb47b7","code_sha256_prefix":"4fdceb95b4bb47b7","mcp_get_code":{"code_sha256":"4fdceb95b4bb47b7"}},{"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":"lucidrains/soft-moe-pytorch","path":"soft_moe_pytorch/soft_moe.py","file_url":"https://github.com/lucidrains/soft-moe-pytorch/blob/HEAD/soft_moe_pytorch/soft_moe.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":"57fd83aecedfe674","code_sha256_prefix":"57fd83aecedfe674","mcp_get_code":{"code_sha256":"57fd83aecedfe674"}},{"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":"invariant","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":"b8149022c0d28e97","code_sha256_prefix":"b8149022c0d28e97","mcp_get_code":{"code_sha256":"b8149022c0d28e97"}},{"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":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b8149022c0d28e97","code_sha256_prefix":"b8149022c0d28e97","mcp_get_code":{"code_sha256":"b8149022c0d28e97"}},{"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":"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":"a0902e24bf5299e7","code_sha256_prefix":"a0902e24bf5299e7","mcp_get_code":{"code_sha256":"a0902e24bf5299e7"}},{"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":"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":"67a405c47f8f7e0b","code_sha256_prefix":"67a405c47f8f7e0b","mcp_get_code":{"code_sha256":"67a405c47f8f7e0b"}}],"record_sha256":"31ba4afc7d110d24ac5bcad91c06e6ec9ad97125cb1c510c7fd7832846d115c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}