{"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/theta-shift","entry":"theta_shift","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":2,"n_papers_ran_instrument_only":4,"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":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":3,"ran":1,"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":"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":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"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":"baade25f8e90d2a7","code_sha256_prefix":"baade25f8e90d2a7","mcp_get_code":{"code_sha256":"baade25f8e90d2a7"}},{"arxiv_id":"2411.07635","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-low-rank-dilemma-of-linear","title":"Breaking the Low-Rank Dilemma of Linear Attention","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhfan/rala","path":"classfication/RALA.py","file_url":"https://github.com/qhfan/rala/blob/HEAD/classfication/RALA.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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/rala when it was checked","code_sha256":"baade25f8e90d2a7","code_sha256_prefix":"baade25f8e90d2a7","mcp_get_code":{"code_sha256":"baade25f8e90d2a7"}},{"arxiv_id":"2407.05562","arxiv_id_is_arxiv":true,"paper":"/paper/focus-on-the-whole-character-discriminative","title":"Focus on the Whole Character: Discriminative Character Modeling for Scene Text Recognition","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bang123-box/CFE","path":"strhub/models/cfe/modules.py","file_url":"https://github.com/bang123-box/CFE/blob/HEAD/strhub/models/cfe/modules.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8396d548dcd91a","code_sha256_prefix":"5d8396d548dcd91a","mcp_get_code":{"code_sha256":"5d8396d548dcd91a"}},{"arxiv_id":"2403.00818","arxiv_id_is_arxiv":true,"paper":"/paper/densemamba-state-space-models-with-dense","title":"DenseMamba: State Space Models with Dense Hidden Connection for Efficient Large Language Models","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wailordhe/densessm","path":"modeling/dense_gau_retnet_1p3b/modeling_dense_gau_retnet.py","file_url":"https://github.com/wailordhe/densessm/blob/HEAD/modeling/dense_gau_retnet_1p3b/modeling_dense_gau_retnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wailordhe/densessm when it was checked","code_sha256":"ade8815b75c0768c","code_sha256_prefix":"ade8815b75c0768c","mcp_get_code":{"code_sha256":"ade8815b75c0768c"}},{"arxiv_id":"2309.11523","arxiv_id_is_arxiv":true,"paper":"/paper/rmt-retentive-networks-meet-vision","title":"RMT: Retentive Networks Meet Vision Transformers","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhfan/RMT","path":"classfication_release/RMT.py","file_url":"https://github.com/qhfan/RMT/blob/HEAD/classfication_release/RMT.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, qhfan/RMT when it was checked","code_sha256":"b8350bfbda624e8a","code_sha256_prefix":"b8350bfbda624e8a","mcp_get_code":{"code_sha256":"b8350bfbda624e8a"}},{"arxiv_id":"Fu_SegMAN_Omni-scale_Context_Modeling_with_State_Space_Models_and_Local_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Fu_SegMAN_Omni-scale_Context_Modeling_with_State_Space_Models_and_Local_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yunxiangfu2001/SegMAN","path":"models/segman_encoder.py","file_url":"https://github.com/yunxiangfu2001/SegMAN/blob/HEAD/models/segman_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from qhfan/RMT, and GitHub detected no licence in that repository when it was checked","code_sha256":"b8350bfbda624e8a","code_sha256_prefix":"b8350bfbda624e8a","mcp_get_code":{"code_sha256":"b8350bfbda624e8a"}}],"record_sha256":"0ebb881f0631eb5f4b02e6e97064ad55496c3d0c0eae2a76ebb025551e201663","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}