{"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/orthogonal-matrix-chunk","entry":"orthogonal_matrix_chunk","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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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.15500","arxiv_id_is_arxiv":true,"paper":"/paper/anonymising-elderly-and-pathological-speech","title":"Anonymising Elderly and Pathological Speech: Voice Conversion Using DDSP and Query-by-Example","date":"2024-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suhitaghosh10/ddsp-qbe","path":"fusion_synthesis/ddsp/conformer.py","file_url":"https://github.com/suhitaghosh10/ddsp-qbe/blob/HEAD/fusion_synthesis/ddsp/conformer.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, suhitaghosh10/ddsp-qbe when it was checked","code_sha256":"a8cffaf25442a3ed","code_sha256_prefix":"a8cffaf25442a3ed","mcp_get_code":{"code_sha256":"a8cffaf25442a3ed"}},{"arxiv_id":"2310.13225","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-neural-network-kernels","title":"Scalable Neural Network Kernels","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arijitthegame/neural-network-kernels","path":"src/nnk/nnk.py","file_url":"https://github.com/arijitthegame/neural-network-kernels/blob/HEAD/src/nnk/nnk.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97b8b7b080cf8316","code_sha256_prefix":"97b8b7b080cf8316","mcp_get_code":{"code_sha256":"97b8b7b080cf8316"}},{"arxiv_id":"2307.10802","arxiv_id_is_arxiv":true,"paper":"/paper/meta-transformer-a-unified-framework-for","title":"Meta-Transformer: A Unified Framework for Multimodal Learning","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"invictus717/MetaTransformer","path":"Graph/metatransformer/modules/orf.py","file_url":"https://github.com/invictus717/MetaTransformer/blob/HEAD/Graph/metatransformer/modules/orf.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":"a02dd771934e8662","code_sha256_prefix":"a02dd771934e8662","mcp_get_code":{"code_sha256":"a02dd771934e8662"}},{"arxiv_id":"2207.02505","arxiv_id_is_arxiv":true,"paper":"/paper/pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jw9730/tokengt","path":"large-scale-regression/tokengt/modules/orf.py","file_url":"https://github.com/jw9730/tokengt/blob/HEAD/large-scale-regression/tokengt/modules/orf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, jw9730/tokengt, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a02dd771934e8662","code_sha256_prefix":"a02dd771934e8662","mcp_get_code":{"code_sha256":"a02dd771934e8662"}},{"arxiv_id":"2201.03794","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-non-local-contrastive-attention-for","title":"Efficient Non-Local Contrastive Attention for Image Super-Resolution","date":"2022-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zj-binxia/enlca","path":"src/model/ENLA.py","file_url":"https://github.com/zj-binxia/enlca/blob/HEAD/src/model/ENLA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zj-binxia/enlca when it was checked","code_sha256":"b2edd96923818916","code_sha256_prefix":"b2edd96923818916","mcp_get_code":{"code_sha256":"b2edd96923818916"}},{"arxiv_id":"2106.06295","arxiv_id_is_arxiv":true,"paper":"/paper/going-beyond-linear-transformers-with","title":"Going Beyond Linear Transformers with Recurrent Fast Weight Programmers","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IDSIA/lmtool-fwms","path":"src/utils/performer_helper.py","file_url":"https://github.com/IDSIA/lmtool-fwms/blob/HEAD/src/utils/performer_helper.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":"aa14b5ef69b1c4ef","code_sha256_prefix":"aa14b5ef69b1c4ef","mcp_get_code":{"code_sha256":"aa14b5ef69b1c4ef"}}],"record_sha256":"caf5f380624cd11d386c2d6d0dc4ffa5b29571f8c459bf337b1aa6af6d9dbe87","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}