{"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/feedforwardnetwork","entry":"FeedForwardNetwork","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":8,"n_samples_ran":7,"n_samples_constructed":5,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":7,"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":7,"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":"2602.08629","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08629","title":"CauScale: Neural Causal Discovery at Scale","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"OpenCausaLab/CauScale","path":"src/model/causcale.py","file_url":"https://github.com/OpenCausaLab/CauScale/blob/HEAD/src/model/causcale.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, OpenCausaLab/CauScale when it was checked","code_sha256":"a6ebf0e756f9f41e","code_sha256_prefix":"a6ebf0e756f9f41e","mcp_get_code":{"code_sha256":"a6ebf0e756f9f41e"}},{"arxiv_id":"2507.00698","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.00698","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"qhfan/MALA","path":"classfication_release/model.py","file_url":"https://github.com/qhfan/MALA/blob/HEAD/classfication_release/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qhfan/MALA when it was checked","code_sha256":"32803281c13be945","code_sha256_prefix":"32803281c13be945","mcp_get_code":{"code_sha256":"32803281c13be945"}},{"arxiv_id":"2411.17296","arxiv_id_is_arxiv":true,"paper":"/paper/grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GGA23/GrokFormer","path":"model.py","file_url":"https://github.com/GGA23/GrokFormer/blob/HEAD/model.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, GGA23/GrokFormer when it was checked","code_sha256":"74cb217ec0101821","code_sha256_prefix":"74cb217ec0101821","mcp_get_code":{"code_sha256":"74cb217ec0101821"}},{"arxiv_id":"2403.16030","arxiv_id_is_arxiv":true,"paper":"/paper/vcr-graphormer-a-mini-batch-graph-transformer","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongqifu/vcr-graphormer","path":"model.py","file_url":"https://github.com/dongqifu/vcr-graphormer/blob/HEAD/model.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, dongqifu/vcr-graphormer when it was checked","code_sha256":"20da3dbb92e45d6e","code_sha256_prefix":"20da3dbb92e45d6e","mcp_get_code":{"code_sha256":"20da3dbb92e45d6e"}},{"arxiv_id":"1807.03819","arxiv_id_is_arxiv":true,"paper":"/paper/universal-transformers","title":"Universal Transformers","date":"2018-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cfiken/universal_transformer","path":"model/ut.py","file_url":"https://github.com/cfiken/universal_transformer/blob/HEAD/model/ut.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, cfiken/universal_transformer when it was checked","code_sha256":"81f546780efe0c63","code_sha256_prefix":"81f546780efe0c63","mcp_get_code":{"code_sha256":"81f546780efe0c63"}},{"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":"229a1bc080aba314","code_sha256_prefix":"229a1bc080aba314","mcp_get_code":{"code_sha256":"229a1bc080aba314"}},{"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":"seunghwan1228/Transfomer-MachineTranslation","path":"models/transformer.py","file_url":"https://github.com/seunghwan1228/Transfomer-MachineTranslation/blob/HEAD/models/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, seunghwan1228/Transfomer-MachineTranslation when it was checked","code_sha256":"615d17b10dc8a9c6","code_sha256_prefix":"615d17b10dc8a9c6","mcp_get_code":{"code_sha256":"615d17b10dc8a9c6"}},{"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":"demelin/nematode","path":"codebase/transformer.py","file_url":"https://github.com/demelin/nematode/blob/HEAD/codebase/transformer.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":"9fd0462cbef849fe","code_sha256_prefix":"9fd0462cbef849fe","mcp_get_code":{"code_sha256":"9fd0462cbef849fe"}}],"record_sha256":"6a9d31ea3f72e3b1b4bcbf14b0fb68daec94ee7da2959a8e7a6dc71c98f8d414","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}