{"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/symmetric","entry":"symmetric","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":0,"n_papers_ran_no_instrument_failure":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"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":0,"ran":0,"unverified":5},"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":"2503.13497","arxiv_id_is_arxiv":true,"paper":"/paper/is-limited-participant-diversity-impeding-eeg","title":"Is Limited Participant Diversity Impeding EEG-based Machine Learning?","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bomatter/participant-diversity-paper","path":"core/mAtt.py","file_url":"https://github.com/bomatter/participant-diversity-paper/blob/HEAD/core/mAtt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb630094fc8f5169","code_sha256_prefix":"fb630094fc8f5169","mcp_get_code":{"code_sha256":"fb630094fc8f5169"}},{"arxiv_id":"2402.17700","arxiv_id_is_arxiv":true,"paper":"/paper/ravel-evaluating-interpretability-methods-on","title":"RAVEL: Evaluating Interpretability Methods on Disentangling Language Model Representations","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explanare/ravel","path":"src/methods/linear_adversarial_probe.py","file_url":"https://github.com/explanare/ravel/blob/HEAD/src/methods/linear_adversarial_probe.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from shauli-ravfogel/rlace-icml, and GitHub detected no licence in that repository when it was checked","code_sha256":"5eb6f7201a4d2f1c","code_sha256_prefix":"5eb6f7201a4d2f1c","mcp_get_code":{"code_sha256":"5eb6f7201a4d2f1c"}},{"arxiv_id":"2312.08200","arxiv_id_is_arxiv":true,"paper":"/paper/spd-ddpm-denoising-diffusion-probabilistic","title":"SPD-DDPM: Denoising Diffusion Probabilistic Models in the Symmetric Positive Definite Space","date":"2023-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"li-yun-chen/spd-ddpm","path":"condition/SPD_net.py","file_url":"https://github.com/li-yun-chen/spd-ddpm/blob/HEAD/condition/SPD_net.py","status":"unverified","verification_level":0,"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, li-yun-chen/spd-ddpm when it was checked","code_sha256":"e9b42bb505335112","code_sha256_prefix":"e9b42bb505335112","mcp_get_code":{"code_sha256":"e9b42bb505335112"}},{"arxiv_id":"2210.01986","arxiv_id_is_arxiv":true,"paper":"/paper/matt-a-manifold-attention-network-for-eeg","title":"MAtt: A Manifold Attention Network for EEG Decoding","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cecnl/matt","path":"mAtt/utils.py","file_url":"https://github.com/cecnl/matt/blob/HEAD/mAtt/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb630094fc8f5169","code_sha256_prefix":"fb630094fc8f5169","mcp_get_code":{"code_sha256":"fb630094fc8f5169"}},{"arxiv_id":"2201.12091","arxiv_id_is_arxiv":true,"paper":"/paper/linear-adversarial-concept-erasure","title":"Linear Adversarial Concept Erasure","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shauli-ravfogel/rlace-icml","path":"rlace.py","file_url":"https://github.com/shauli-ravfogel/rlace-icml/blob/HEAD/rlace.py","status":"unverified","verification_level":0,"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, shauli-ravfogel/rlace-icml when it was checked","code_sha256":"4b6bf35b1e1ce947","code_sha256_prefix":"4b6bf35b1e1ce947","mcp_get_code":{"code_sha256":"4b6bf35b1e1ce947"}},{"arxiv_id":"2201.12091","arxiv_id_is_arxiv":true,"paper":"/paper/linear-adversarial-concept-erasure","title":"Linear Adversarial Concept Erasure","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shauli-ravfogel/rlace-icml","path":"rlace.py","file_url":"https://github.com/shauli-ravfogel/rlace-icml/blob/HEAD/rlace.py","status":"unverified","verification_level":0,"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, shauli-ravfogel/rlace-icml when it was checked","code_sha256":"5eb6f7201a4d2f1c","code_sha256_prefix":"5eb6f7201a4d2f1c","mcp_get_code":{"code_sha256":"5eb6f7201a4d2f1c"}},{"arxiv_id":"1901.08428","arxiv_id_is_arxiv":true,"paper":"/paper/cheap-orthogonal-constraints-in-neural","title":"Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Group","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lezcano/geotorch","path":"geotorch/constraints.py","file_url":"https://github.com/Lezcano/geotorch/blob/HEAD/geotorch/constraints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"446a426848ccde8b","code_sha256_prefix":"446a426848ccde8b","mcp_get_code":{"code_sha256":"446a426848ccde8b"}}],"record_sha256":"3b6f4e90e715f4a1d80b8732456b65bc611c4800082ad0fe48bd323cc29cf73f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}