{"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/get-slopes","entry":"get_slopes","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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2505.22842","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-attention-mechanism-a-probabilistic","title":"Bayesian Attention Mechanism: A Probabilistic Framework for Positional Encoding and Context Length Extrapolation","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthursbianchessi/bam","path":"models/bam.py","file_url":"https://github.com/arthursbianchessi/bam/blob/HEAD/models/bam.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, arthursbianchessi/bam when it was checked","code_sha256":"43e6934a82b49af9","code_sha256_prefix":"43e6934a82b49af9","mcp_get_code":{"code_sha256":"43e6934a82b49af9"}},{"arxiv_id":"2501.15368","arxiv_id_is_arxiv":true,"paper":"/paper/baichuan-omni-1-5-technical-report","title":"Baichuan-Omni-1.5 Technical Report","date":"2025-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"43e6934a82b49af9","code_sha256_prefix":"43e6934a82b49af9","mcp_get_code":{"code_sha256":"43e6934a82b49af9"}},{"arxiv_id":"2405.13985","arxiv_id_is_arxiv":true,"paper":"/paper/lookhere-vision-transformers-with-directed","title":"LookHere: Vision Transformers with Directed Attention Generalize and Extrapolate","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greencubic/lookhere","path":"lookhere.py","file_url":"https://github.com/greencubic/lookhere/blob/HEAD/lookhere.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"219b1bd8df9afa74","code_sha256_prefix":"219b1bd8df9afa74","mcp_get_code":{"code_sha256":"219b1bd8df9afa74"}},{"arxiv_id":"2402.05706","arxiv_id_is_arxiv":true,"paper":"/paper/unified-speech-text-pretraining-for-spoken","title":"Paralinguistics-Aware Speech-Empowered Large Language Models for Natural Conversation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/usdm","path":"src/decoder/voicebox/model/voicebox.py","file_url":"https://github.com/naver-ai/usdm/blob/HEAD/src/decoder/voicebox/model/voicebox.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb307ac322982165","code_sha256_prefix":"bb307ac322982165","mcp_get_code":{"code_sha256":"bb307ac322982165"}},{"arxiv_id":"2205.13760","arxiv_id_is_arxiv":true,"paper":"/paper/tranception-protein-fitness-prediction-with","title":"Tranception: protein fitness prediction with autoregressive transformers and inference-time retrieval","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML-Markslab/Tranception","path":"tranception/model_pytorch.py","file_url":"https://github.com/OATML-Markslab/Tranception/blob/HEAD/tranception/model_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4305f4fdd8e54bc1","code_sha256_prefix":"4305f4fdd8e54bc1","mcp_get_code":{"code_sha256":"4305f4fdd8e54bc1"}},{"arxiv_id":"2106.02584","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-between-datapoints-going","title":"Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learning","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oatml-markslab/proteinnpt","path":"proteinnpt/utils/tranception/model_pytorch.py","file_url":"https://github.com/oatml-markslab/proteinnpt/blob/HEAD/proteinnpt/utils/tranception/model_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4305f4fdd8e54bc1","code_sha256_prefix":"4305f4fdd8e54bc1","mcp_get_code":{"code_sha256":"4305f4fdd8e54bc1"}}],"record_sha256":"ff265991ca38da7d67bdb9a3d75fb50e68c4604d3d1d9f7dd5a139520fb22ad3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}