{"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/linearlayer","entry":"LinearLayer","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":12,"n_papers_ran_no_instrument_failure":12,"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":14,"n_samples_ran":12,"n_samples_constructed":8,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":14,"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":12,"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":"2510.15729","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-15729","title":"FACE: A General Framework for Mapping Collaborative Filtering Embeddings into LLM Tokens","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"YixinRoll/FACE","path":"encoder/FACE.py","file_url":"https://github.com/YixinRoll/FACE/blob/HEAD/encoder/FACE.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, YixinRoll/FACE when it was checked","code_sha256":"2ef1beb654a7098f","code_sha256_prefix":"2ef1beb654a7098f","mcp_get_code":{"code_sha256":"2ef1beb654a7098f"}},{"arxiv_id":"2502.01989","arxiv_id_is_arxiv":true,"paper":"/paper/t-scend-test-time-scalable-mcts-enhanced","title":"T-SCEND: Test-time Scalable MCTS-enhanced Diffusion Model","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Science-WestlakeU/VFScale","path":"vfscale_src/model/models.py","file_url":"https://github.com/AI4Science-WestlakeU/VFScale/blob/HEAD/vfscale_src/model/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8d87e276de13f530","code_sha256_prefix":"8d87e276de13f530","mcp_get_code":{"code_sha256":"8d87e276de13f530"}},{"arxiv_id":"2401.02309","arxiv_id_is_arxiv":true,"paper":"/paper/tr-detr-task-reciprocal-transformer-for-joint","title":"TR-DETR: Task-Reciprocal Transformer for Joint Moment Retrieval and Highlight Detection","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyao1120/TR-DETR","path":"tr_detr/model.py","file_url":"https://github.com/mingyao1120/TR-DETR/blob/HEAD/tr_detr/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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, mingyao1120/TR-DETR (NOASSERTION)","code_sha256":"4abf288345162e2d","code_sha256_prefix":"4abf288345162e2d","mcp_get_code":{"code_sha256":"4abf288345162e2d"}},{"arxiv_id":"2307.04052","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-group-auxiliary-datasets-for","title":"Learning to Group Auxiliary Datasets for Molecule","date":"2023-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-and-geometric-learning/molgroup","path":"molgroup/models/metagin.py","file_url":"https://github.com/graph-and-geometric-learning/molgroup/blob/HEAD/molgroup/models/metagin.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, graph-and-geometric-learning/molgroup when it was checked","code_sha256":"ac36594669402b46","code_sha256_prefix":"ac36594669402b46","mcp_get_code":{"code_sha256":"ac36594669402b46"}},{"arxiv_id":"2305.15196","arxiv_id_is_arxiv":true,"paper":"/paper/feature-aligned-n-beats-with-sinkhorn","title":"Feature-aligned N-BEATS with Sinkhorn divergence","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leejoonhun/fan-beats","path":"models/nbeats.py","file_url":"https://github.com/leejoonhun/fan-beats/blob/HEAD/models/nbeats.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, leejoonhun/fan-beats when it was checked","code_sha256":"a234c0daf36316d6","code_sha256_prefix":"a234c0daf36316d6","mcp_get_code":{"code_sha256":"a234c0daf36316d6"}},{"arxiv_id":"2210.08714","arxiv_id_is_arxiv":true,"paper":"/paper/selective-query-guided-debiasing-network-for","title":"Selective Query-guided Debiasing for Video Corpus Moment Retrieval","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbstjswo505/SQuiDNet","path":"model/squidnet.py","file_url":"https://github.com/dbstjswo505/SQuiDNet/blob/HEAD/model/squidnet.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":"816eb98da721aba8","code_sha256_prefix":"816eb98da721aba8","mcp_get_code":{"code_sha256":"816eb98da721aba8"}},{"arxiv_id":"2206.05032","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-deep-gaussian-markov-random-fields","title":"Scalable Deep Gaussian Markov Random Fields for General Graphs","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeloskarsson/graph-dgmrf","path":"dgmrf.py","file_url":"https://github.com/joeloskarsson/graph-dgmrf/blob/HEAD/dgmrf.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":"cafc22705ea41e9b","code_sha256_prefix":"cafc22705ea41e9b","mcp_get_code":{"code_sha256":"cafc22705ea41e9b"}},{"arxiv_id":"2203.15125","arxiv_id_is_arxiv":true,"paper":"/paper/text2pos-text-to-point-cloud-cross-modal","title":"Text2Pos: Text-to-Point-Cloud Cross-Modal Localization","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin301342/cmmloc","path":"models/coarse/cell_retrieval.py","file_url":"https://github.com/kevin301342/cmmloc/blob/HEAD/models/coarse/cell_retrieval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kevin301342/cmmloc when it was checked","code_sha256":"3df8c1fd92a5fb57","code_sha256_prefix":"3df8c1fd92a5fb57","mcp_get_code":{"code_sha256":"3df8c1fd92a5fb57"}},{"arxiv_id":"2111.08679","arxiv_id_is_arxiv":true,"paper":"/paper/automatically-detecting-anomalous-exoplanet","title":"Automatically detecting anomalous exoplanet transits","date":"2021-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"christophhoenes/anomalousexoplanettransits","path":"architectures.py","file_url":"https://github.com/christophhoenes/anomalousexoplanettransits/blob/HEAD/architectures.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb07fa1cfe45efb6","code_sha256_prefix":"cb07fa1cfe45efb6","mcp_get_code":{"code_sha256":"cb07fa1cfe45efb6"}},{"arxiv_id":"2102.07954","arxiv_id_is_arxiv":true,"paper":"/paper/alphanet-improved-training-of-supernet-with","title":"AlphaNet: Improved Training of Supernets with Alpha-Divergence","date":"2021-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/AttentiveNAS","path":"models/attentive_nas_dynamic_model.py","file_url":"https://github.com/facebookresearch/AttentiveNAS/blob/HEAD/models/attentive_nas_dynamic_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","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, facebookresearch/AttentiveNAS (NOASSERTION)","code_sha256":"c3abc01ffd8662f7","code_sha256_prefix":"c3abc01ffd8662f7","mcp_get_code":{"code_sha256":"c3abc01ffd8662f7"}},{"arxiv_id":"2007.11412","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-graining-molecular-dynamics-with-graph","title":"Coarse Graining Molecular Dynamics with Graph Neural Networks","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coarse-graining/cgnet","path":"cgnet/feature/utils.py","file_url":"https://github.com/coarse-graining/cgnet/blob/HEAD/cgnet/feature/utils.py","status":"ran","verification_level":1,"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":"f8a6f5e127424484","code_sha256_prefix":"f8a6f5e127424484","mcp_get_code":{"code_sha256":"f8a6f5e127424484"}},{"arxiv_id":"2004.05718","arxiv_id_is_arxiv":true,"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changminwu/expandergnn","path":"layers/pna_layer.py","file_url":"https://github.com/changminwu/expandergnn/blob/HEAD/layers/pna_layer.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, changminwu/expandergnn when it was checked","code_sha256":"6f4fac2426ac1ca3","code_sha256_prefix":"6f4fac2426ac1ca3","mcp_get_code":{"code_sha256":"6f4fac2426ac1ca3"}},{"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":"abhaskumarsinha/MinimalGPT","path":"GPT.py","file_url":"https://github.com/abhaskumarsinha/MinimalGPT/blob/HEAD/GPT.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":"b9d42ba4bed4d1b3","code_sha256_prefix":"b9d42ba4bed4d1b3","mcp_get_code":{"code_sha256":"b9d42ba4bed4d1b3"}},{"arxiv_id":"1503.05671","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-neural-networks-with-kronecker","title":"Optimizing Neural Networks with Kronecker-factored Approximate Curvature","date":"2015-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tfjgeorge/nngeometry","path":"nngeometry/object/pspace.py","file_url":"https://github.com/tfjgeorge/nngeometry/blob/HEAD/nngeometry/object/pspace.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":"b213da7adb946c6e","code_sha256_prefix":"b213da7adb946c6e","mcp_get_code":{"code_sha256":"b213da7adb946c6e"}}],"record_sha256":"40e999b0a101bcd47731afe9b39cc38a22782bf440c9312609c1cc47a97ef587","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}