{"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/is-pos-def","entry":"is_pos_def","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":9,"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":0,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"unverified":1},"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":"97d4c97ee913a736","code_sha256_prefix":"97d4c97ee913a736","mcp_get_code":{"code_sha256":"97d4c97ee913a736"}},{"arxiv_id":"2502.04043","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2502.04043","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"nguyenngocbaocmt02/EFI","path":"utils.py","file_url":"https://github.com/nguyenngocbaocmt02/EFI/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6025f43882841e71","code_sha256_prefix":"6025f43882841e71","mcp_get_code":{"code_sha256":"6025f43882841e71"}},{"arxiv_id":"2405.16391","arxiv_id_is_arxiv":true,"paper":"/paper/when-does-compositional-structure-yield","title":"When does compositional structure yield compositional generalization? A kernel theory","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sflippl/compositional-generalization","path":"simple_compositional_tasks/models/kernel_machines.py","file_url":"https://github.com/sflippl/compositional-generalization/blob/HEAD/simple_compositional_tasks/models/kernel_machines.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, sflippl/compositional-generalization when it was checked","code_sha256":"329d4d83983cce32","code_sha256_prefix":"329d4d83983cce32","mcp_get_code":{"code_sha256":"329d4d83983cce32"}},{"arxiv_id":"2403.05645","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-neural-network-based-on-phase-space","title":"Geometric Neural Network based on Phase Space for BCI-EEG decoding","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carraraig/Phase-SPDNet","path":"PhaseSPDnet/Connectivities.py","file_url":"https://github.com/carraraig/Phase-SPDNet/blob/HEAD/PhaseSPDnet/Connectivities.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, carraraig/Phase-SPDNet when it was checked","code_sha256":"1116cd61da51278e","code_sha256_prefix":"1116cd61da51278e","mcp_get_code":{"code_sha256":"1116cd61da51278e"}},{"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":"97d4c97ee913a736","code_sha256_prefix":"97d4c97ee913a736","mcp_get_code":{"code_sha256":"97d4c97ee913a736"}},{"arxiv_id":"2106.01854","arxiv_id_is_arxiv":true,"paper":"/paper/optimization-based-algebraic-multigrid","title":"Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"compdyn/rl_grid_coarsen","path":"Solve_MG.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Solve_MG.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37bb1126cefd3957","code_sha256_prefix":"37bb1126cefd3957","mcp_get_code":{"code_sha256":"37bb1126cefd3957"}},{"arxiv_id":"1901.05335","arxiv_id_is_arxiv":true,"paper":"/paper/a-review-of-single-source-unsupervised-domain","title":"A review of domain adaptation without target labels","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmkouw/libTLDA","path":"libtlda/util.py","file_url":"https://github.com/wmkouw/libTLDA/blob/HEAD/libtlda/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd4f79aa6de07f0d","code_sha256_prefix":"dd4f79aa6de07f0d","mcp_get_code":{"code_sha256":"dd4f79aa6de07f0d"}},{"arxiv_id":"1511.05547","arxiv_id_is_arxiv":true,"paper":"/paper/return-of-frustratingly-easy-domain","title":"Return of Frustratingly Easy Domain Adaptation","date":"2015-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincent-vercruyssen/transfertools","path":"transfertools/utils/utils.py","file_url":"https://github.com/vincent-vercruyssen/transfertools/blob/HEAD/transfertools/utils/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":"ce996da27300ae61","code_sha256_prefix":"ce996da27300ae61","mcp_get_code":{"code_sha256":"ce996da27300ae61"}},{"arxiv_id":"ijcai2020_0750","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2020_0750","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"aia-uclouvain/pydl8.5","path":"pydl85/supervised/classifiers/boosting.py","file_url":"https://github.com/aia-uclouvain/pydl8.5/blob/HEAD/pydl85/supervised/classifiers/boosting.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6025f43882841e71","code_sha256_prefix":"6025f43882841e71","mcp_get_code":{"code_sha256":"6025f43882841e71"}}],"record_sha256":"2ab8d9d41e03ac0284b4fc5ca0408e7a88ac768b539d5ac2e1d5b4222a4cfee8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}