{"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/fold","entry":"fold","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"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":3,"ran_fixture":0,"ran":5,"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":"2608.17087","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17087","title":"Backward through Time, Algebraically","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"konstantinosKokos/telos","path":"src/telos/algebras/base.py","file_url":"https://github.com/konstantinosKokos/telos/blob/HEAD/src/telos/algebras/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"029ec275f8afc5f1","code_sha256_prefix":"029ec275f8afc5f1","mcp_get_code":{"code_sha256":"029ec275f8afc5f1"}},{"arxiv_id":"2412.06566","arxiv_id_is_arxiv":true,"paper":"/paper/dex-data-channel-extension-for-efficient-cnn","title":"DEX: Data Channel Extension for Efficient CNN Inference on Tiny AI Accelerators","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nokia-bell-labs/data-channel-extension","path":"ai8x.py","file_url":"https://github.com/nokia-bell-labs/data-channel-extension/blob/HEAD/ai8x.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nokia-bell-labs/data-channel-extension (NOASSERTION)","code_sha256":"b65fe9574f66b0cd","code_sha256_prefix":"b65fe9574f66b0cd","mcp_get_code":{"code_sha256":"b65fe9574f66b0cd"}},{"arxiv_id":"2409.17502","arxiv_id_is_arxiv":true,"paper":"/paper/broadcast-product-shape-aligned-element-wise","title":"Broadcast Product: Shape-aligned Element-wise Multiplication and Beyond","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matsui528/broadcast_product_demo","path":"broadcast_decomposition/python/src/broadcast_decomposition/tensor_ops.py","file_url":"https://github.com/matsui528/broadcast_product_demo/blob/HEAD/broadcast_decomposition/python/src/broadcast_decomposition/tensor_ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, matsui528/broadcast_product_demo when it was checked","code_sha256":"e59721ab05438e5c","code_sha256_prefix":"e59721ab05438e5c","mcp_get_code":{"code_sha256":"e59721ab05438e5c"}},{"arxiv_id":"2305.14342","arxiv_id_is_arxiv":true,"paper":"/paper/sophia-a-scalable-stochastic-second-order","title":"Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-training","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-crfm/levanter","path":"src/levanter/metrics.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/metrics.py","status":"unverified","verification_level":0,"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":"d40382c2fb844d41","code_sha256_prefix":"d40382c2fb844d41","mcp_get_code":{"code_sha256":"d40382c2fb844d41"}},{"arxiv_id":"2203.11889","arxiv_id_is_arxiv":true,"paper":"/paper/insights-from-the-neurips-2021-nethack","title":"Insights From the NeurIPS 2021 NetHack Challenge","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dllllb/neurips2021-nethack-raph","path":"nethack_raph/Level.py","file_url":"https://github.com/dllllb/neurips2021-nethack-raph/blob/HEAD/nethack_raph/Level.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":"2896d0ffefd9b335","code_sha256_prefix":"2896d0ffefd9b335","mcp_get_code":{"code_sha256":"2896d0ffefd9b335"}},{"arxiv_id":"2201.00520","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformer-with-deformable-attention","title":"Vision Transformer with Deformable Attention","date":"2022-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChristophReich1996/Swin-Transformer-V2","path":"swin_transformer_v2/model_parts.py","file_url":"https://github.com/ChristophReich1996/Swin-Transformer-V2/blob/HEAD/swin_transformer_v2/model_parts.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":"ae92018684b30199","code_sha256_prefix":"ae92018684b30199","mcp_get_code":{"code_sha256":"ae92018684b30199"}},{"arxiv_id":"2106.08265","arxiv_id_is_arxiv":true,"paper":"/paper/towards-total-recall-in-industrial-anomaly","title":"Towards Total Recall in Industrial Anomaly Detection","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/PatchCore","path":"src/operator.py","file_url":"https://github.com/JoegameZhou/PatchCore/blob/HEAD/src/operator.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":"b4bfdc071e0f7908","code_sha256_prefix":"b4bfdc071e0f7908","mcp_get_code":{"code_sha256":"b4bfdc071e0f7908"}},{"arxiv_id":"1901.02015","arxiv_id_is_arxiv":true,"paper":"/paper/transit-least-squares-an-optimized-transit","title":"Transit Least Squares: An optimized transit detection algorithm to search for periodic transits of small planets","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"hippke/tls","path":"transitleastsquares/core.py","file_url":"https://github.com/hippke/tls/blob/HEAD/transitleastsquares/core.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":"52c3d1f4ce1655b9","code_sha256_prefix":"52c3d1f4ce1655b9","mcp_get_code":{"code_sha256":"52c3d1f4ce1655b9"}},{"arxiv_id":"1702.02390","arxiv_id_is_arxiv":true,"paper":"/paper/a-hybrid-convolutional-variational","title":"A Hybrid Convolutional Variational Autoencoder for Text Generation","date":"2017-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kefirski/hybrid_rvae","path":"utils/functions.py","file_url":"https://github.com/kefirski/hybrid_rvae/blob/HEAD/utils/functions.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":"0381de7a8ac5ced5","code_sha256_prefix":"0381de7a8ac5ced5","mcp_get_code":{"code_sha256":"0381de7a8ac5ced5"}},{"arxiv_id":"1511.06349","arxiv_id_is_arxiv":true,"paper":"/paper/generating-sentences-from-a-continuous-space","title":"Generating Sentences from a Continuous Space","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kefirski/pytorch_RVAE","path":"model/rvae.py","file_url":"https://github.com/kefirski/pytorch_RVAE/blob/HEAD/model/rvae.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":"0381de7a8ac5ced5","code_sha256_prefix":"0381de7a8ac5ced5","mcp_get_code":{"code_sha256":"0381de7a8ac5ced5"}}],"record_sha256":"dda617aabf3cdcf265d5526bcfc1471aeca8d9de4618f3f2afacc281fddaaa26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}