{"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/scaled-dot-product","entry":"scaled_dot_product","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"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":6,"ran_fixture":0,"ran":4,"unverified":0},"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":"2410.16432","arxiv_id_is_arxiv":true,"paper":"/paper/fair-bilevel-neural-network-fairbinn-on","title":"Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yazdanimehdi/Distraction_Fairness","path":"model.py","file_url":"https://github.com/yazdanimehdi/Distraction_Fairness/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yazdanimehdi/Distraction_Fairness when it was checked","code_sha256":"3590e425c7c27d55","code_sha256_prefix":"3590e425c7c27d55","mcp_get_code":{"code_sha256":"3590e425c7c27d55"}},{"arxiv_id":"2402.19009","arxiv_id_is_arxiv":true,"paper":"/paper/generating-reconstructing-and-representing","title":"Unified Generation, Reconstruction, and Representation: Generalized Diffusion with Adaptive Latent Encoding-Decoding","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyliu/eddpm","path":"Protein/codes/nn/models.py","file_url":"https://github.com/guangyliu/eddpm/blob/HEAD/Protein/codes/nn/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, guangyliu/eddpm when it was checked","code_sha256":"9e67eeb355787261","code_sha256_prefix":"9e67eeb355787261","mcp_get_code":{"code_sha256":"9e67eeb355787261"}},{"arxiv_id":"2311.01927","arxiv_id_is_arxiv":true,"paper":"/paper/gateloop-fully-data-controlled-linear","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiaskatsch/GateLoop","path":"flax_gated_linear_rnn/attention.py","file_url":"https://github.com/tobiaskatsch/GateLoop/blob/HEAD/flax_gated_linear_rnn/attention.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":"f070d6bd781117c0","code_sha256_prefix":"f070d6bd781117c0","mcp_get_code":{"code_sha256":"f070d6bd781117c0"}},{"arxiv_id":"2310.10649","arxiv_id_is_arxiv":true,"paper":"/paper/a-computational-framework-for-solving","title":"A Computational Framework for Solving Wasserstein Lagrangian Flows","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"necludov/wl-mechanics","path":"models/layers.py","file_url":"https://github.com/necludov/wl-mechanics/blob/HEAD/models/layers.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, necludov/wl-mechanics when it was checked","code_sha256":"b94cd22138442ee3","code_sha256_prefix":"b94cd22138442ee3","mcp_get_code":{"code_sha256":"b94cd22138442ee3"}},{"arxiv_id":"2305.00664","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"model/Transformer.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/model/Transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wanghh7/evolunet when it was checked","code_sha256":"8d4b93288e64fc96","code_sha256_prefix":"8d4b93288e64fc96","mcp_get_code":{"code_sha256":"8d4b93288e64fc96"}},{"arxiv_id":"2305.00664","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"model/model.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/model/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wanghh7/evolunet when it was checked","code_sha256":"bfb059e5bf53dd8a","code_sha256_prefix":"bfb059e5bf53dd8a","mcp_get_code":{"code_sha256":"bfb059e5bf53dd8a"}},{"arxiv_id":"2212.00973","arxiv_id_is_arxiv":true,"paper":"/paper/a-domain-knowledge-inspired-music-embedding","title":"A Domain-Knowledge-Inspired Music Embedding Space and a Novel Attention Mechanism for Symbolic Music Modeling","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guozixunnicolas/fundamentalmusicembedding","path":"model/layers.py","file_url":"https://github.com/guozixunnicolas/fundamentalmusicembedding/blob/HEAD/model/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, guozixunnicolas/fundamentalmusicembedding when it was checked","code_sha256":"eabaf7cdb398a215","code_sha256_prefix":"eabaf7cdb398a215","mcp_get_code":{"code_sha256":"eabaf7cdb398a215"}},{"arxiv_id":"2211.13449","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-of-diffusion-models-via","title":"Fast Sampling of Diffusion Models via Operator Learning","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devzhk/dsno-pytorch","path":"models/layersmt.py","file_url":"https://github.com/devzhk/dsno-pytorch/blob/HEAD/models/layersmt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"770ce3af9e8428eb","code_sha256_prefix":"770ce3af9e8428eb","mcp_get_code":{"code_sha256":"770ce3af9e8428eb"}},{"arxiv_id":"2210.03956","arxiv_id_is_arxiv":true,"paper":"/paper/robust-graph-structure-learning-over-images","title":"Robust Graph Structure Learning via Multiple Statistical Tests","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Thomas-wyh/B-Attention","path":"net/battention_with_gcn.py","file_url":"https://github.com/Thomas-wyh/B-Attention/blob/HEAD/net/battention_with_gcn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cdb0651eb662cfa1","code_sha256_prefix":"cdb0651eb662cfa1","mcp_get_code":{"code_sha256":"cdb0651eb662cfa1"}},{"arxiv_id":"2201.09948","arxiv_id_is_arxiv":true,"paper":"/paper/guided-generative-protein-design-using","title":"ReLSO: A Transformer-based Model for Latent Space Optimization and Generation of Proteins","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KrishnaswamyLab/ReLSO-Guided-Generative-Protein-Design-using-Regularized-Transformers","path":"relso/nn/transformers.py","file_url":"https://github.com/KrishnaswamyLab/ReLSO-Guided-Generative-Protein-Design-using-Regularized-Transformers/blob/HEAD/relso/nn/transformers.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":"e844fff14b289cce","code_sha256_prefix":"e844fff14b289cce","mcp_get_code":{"code_sha256":"e844fff14b289cce"}}],"record_sha256":"92fa2104748d9f534ec1b4f86344c3c195087b31d4306ec363466fd4cc313329","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}