{"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/module","entry":"Module","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":6,"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":0,"ran":4,"unverified":5},"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":"2512.02486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-02486","title":"Dual-Robust Cross-Domain Offline Reinforcement Learning Against Dynamics Shifts","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"zq2r/DROCO","path":"algo/offline_offline/droco.py","file_url":"https://github.com/zq2r/DROCO/blob/HEAD/algo/offline_offline/droco.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":"4cdbd80b8e624adc","code_sha256_prefix":"4cdbd80b8e624adc","mcp_get_code":{"code_sha256":"4cdbd80b8e624adc"}},{"arxiv_id":"2201.05989","arxiv_id_is_arxiv":true,"paper":"/paper/instant-neural-graphics-primitives-with-a","title":"Instant Neural Graphics Primitives with a Multiresolution Hash Encoding","date":"2022-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/tiny-cuda-nn","path":"bindings/torch/tinycudann/modules.py","file_url":"https://github.com/nvlabs/tiny-cuda-nn/blob/HEAD/bindings/torch/tinycudann/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nvlabs/tiny-cuda-nn (NOASSERTION)","code_sha256":"ee42d0c97cb735ff","code_sha256_prefix":"ee42d0c97cb735ff","mcp_get_code":{"code_sha256":"ee42d0c97cb735ff"}},{"arxiv_id":"2110.00529","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-motion-representation-learning","title":"Unsupervised Motion Representation Learning with Capsule Autoencoders","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZiweiXU/CapsuleMotion","path":"lib/mcae/model.py","file_url":"https://github.com/ZiweiXU/CapsuleMotion/blob/HEAD/lib/mcae/model.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":"335cc3b992ddaf73","code_sha256_prefix":"335cc3b992ddaf73","mcp_get_code":{"code_sha256":"335cc3b992ddaf73"}},{"arxiv_id":"1910.03193","arxiv_id_is_arxiv":true,"paper":"/paper/deeponet-learning-nonlinear-operators-for","title":"DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lululxvi/deeponet","path":"seq2seq/learner/nn/deeponet.py","file_url":"https://github.com/lululxvi/deeponet/blob/HEAD/seq2seq/learner/nn/deeponet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, lululxvi/deeponet (NOASSERTION)","code_sha256":"92298447e928deae","code_sha256_prefix":"92298447e928deae","mcp_get_code":{"code_sha256":"92298447e928deae"}},{"arxiv_id":"1803.02155","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-with-relative-position","title":"Self-Attention with Relative Position Representations","date":"2018-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thumt/THUMT","path":"thumt/modules/attention.py","file_url":"https://github.com/thumt/THUMT/blob/HEAD/thumt/modules/attention.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":"49d8363941029a9b","code_sha256_prefix":"49d8363941029a9b","mcp_get_code":{"code_sha256":"49d8363941029a9b"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanhaiNotHai/transformer","path":"transformer.py","file_url":"https://github.com/HanhaiNotHai/transformer/blob/HEAD/transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"WTFPL","inline_ok":false,"inline_ok_link":false,"withheld_clause":"WTFPL, as GitHub detects it on this paper's repository, HanhaiNotHai/transformer, is not in the permissive set Syntology serves inline","code_sha256":"68eeaf8f5426ca93","code_sha256_prefix":"68eeaf8f5426ca93","mcp_get_code":{"code_sha256":"68eeaf8f5426ca93"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanjeffreyz/attention-is-all-you-need","path":"modules/transformer.py","file_url":"https://github.com/tanjeffreyz/attention-is-all-you-need/blob/HEAD/modules/transformer.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, tanjeffreyz/attention-is-all-you-need when it was checked","code_sha256":"d1821f96962eef79","code_sha256_prefix":"d1821f96962eef79","mcp_get_code":{"code_sha256":"d1821f96962eef79"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vpj/jax_transformer","path":"transformer.py","file_url":"https://github.com/vpj/jax_transformer/blob/HEAD/transformer.py","status":"unverified","verification_level":0,"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, vpj/jax_transformer when it was checked","code_sha256":"6b3e189753b2d344","code_sha256_prefix":"6b3e189753b2d344","mcp_get_code":{"code_sha256":"6b3e189753b2d344"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmu2/PyTorch-MAML","path":"models/maml.py","file_url":"https://github.com/fmu2/PyTorch-MAML/blob/HEAD/models/maml.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fmu2/PyTorch-MAML when it was checked","code_sha256":"a1a99ec23db1357b","code_sha256_prefix":"a1a99ec23db1357b","mcp_get_code":{"code_sha256":"a1a99ec23db1357b"}}],"record_sha256":"c219101e08e44665e2ad589baa715b69f27abd5ea809f6cdb36330d6381837cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}