{"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/random-orthogonal-matrix","entry":"random_orthogonal_matrix","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_places":5,"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":2,"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":"2605.15491","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chenxinrui-tsinghua/LinearPatch","path":"rotate_utils/rotation_utils.py","file_url":"https://github.com/chenxinrui-tsinghua/LinearPatch/blob/HEAD/rotate_utils/rotation_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"522f6e6438fa5941","code_sha256_prefix":"522f6e6438fa5941","mcp_get_code":{"code_sha256":"522f6e6438fa5941"}},{"arxiv_id":"2604.07955","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-07955","title":"Rethinking Residual Errors in Compensation-based LLM Quantization","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"list0830/ResComp","path":"fake_quant/rotation_utils.py","file_url":"https://github.com/list0830/ResComp/blob/HEAD/fake_quant/rotation_utils.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, list0830/ResComp when it was checked","code_sha256":"522f6e6438fa5941","code_sha256_prefix":"522f6e6438fa5941","mcp_get_code":{"code_sha256":"522f6e6438fa5941"}},{"arxiv_id":"2405.16406","arxiv_id_is_arxiv":true,"paper":"/paper/spinquant-llm-quantization-with-learned","title":"SpinQuant: LLM quantization with learned rotations","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/SpinQuant","path":"eval_utils/rotation_utils.py","file_url":"https://github.com/facebookresearch/SpinQuant/blob/HEAD/eval_utils/rotation_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"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/SpinQuant (NOASSERTION)","code_sha256":"9e664701215ea565","code_sha256_prefix":"9e664701215ea565","mcp_get_code":{"code_sha256":"9e664701215ea565"}},{"arxiv_id":"2310.00526","arxiv_id_is_arxiv":true,"paper":"/paper/are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"penlu/bespoke-gnn4do","path":"utils/graph_utils.py","file_url":"https://github.com/penlu/bespoke-gnn4do/blob/HEAD/utils/graph_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, penlu/bespoke-gnn4do when it was checked","code_sha256":"3409de43caa9035a","code_sha256_prefix":"3409de43caa9035a","mcp_get_code":{"code_sha256":"3409de43caa9035a"}},{"arxiv_id":"1611.03954","arxiv_id_is_arxiv":true,"paper":"/paper/multilingual-knowledge-graph-embeddings-for","title":"Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignment","date":"2016-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhaochen/MTransE","path":"src/common/utils.py","file_url":"https://github.com/muhaochen/MTransE/blob/HEAD/src/common/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"020f49ecea6b5347","code_sha256_prefix":"020f49ecea6b5347","mcp_get_code":{"code_sha256":"020f49ecea6b5347"}}],"record_sha256":"f0be2a5dd22fde7f4eaf9d6c559db02d259efce22eed3054889ad2a389d50083","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}