{"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/predictionhead","entry":"PredictionHead","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":5,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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.10111","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10111","title":"CFSPMNet: Cross-subject Fourier-guided Spatial-Patch Mamba Network for EEG Motor Imagery Decoding in Stroke Patients","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"wxk1224/CFSPMNet","path":"cfspmnet_frsmamba_model.py","file_url":"https://github.com/wxk1224/CFSPMNet/blob/HEAD/cfspmnet_frsmamba_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wxk1224/CFSPMNet when it was checked","code_sha256":"313cb0a376ff49fa","code_sha256_prefix":"313cb0a376ff49fa","mcp_get_code":{"code_sha256":"313cb0a376ff49fa"}},{"arxiv_id":"2603.01657","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01657","title":"FreeGNN: Continual Source-Free Graph Neural Network Adaptation for Renewable Energy Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AraoufBh/FreeGNN","path":"models/freegnn_backbone.py","file_url":"https://github.com/AraoufBh/FreeGNN/blob/HEAD/models/freegnn_backbone.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4dc96f3137abc2b","code_sha256_prefix":"c4dc96f3137abc2b","mcp_get_code":{"code_sha256":"c4dc96f3137abc2b"}},{"arxiv_id":"2510.19710","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-19710","title":"SEMPO: Lightweight Foundation Models for Time Series Forecasting","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mala-lab/SEMPO","path":"models/SEMPO.py","file_url":"https://github.com/mala-lab/SEMPO/blob/HEAD/models/SEMPO.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f7d9151481dae1e","code_sha256_prefix":"8f7d9151481dae1e","mcp_get_code":{"code_sha256":"8f7d9151481dae1e"}},{"arxiv_id":"2312.16427","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-embed-time-series-patches","title":"Learning to Embed Time Series Patches Independently","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghan96/pits","path":"PITS_self_supervised/src/models/PITS.py","file_url":"https://github.com/seunghan96/pits/blob/HEAD/PITS_self_supervised/src/models/PITS.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, seunghan96/pits when it was checked","code_sha256":"94642dfc7cfa152d","code_sha256_prefix":"94642dfc7cfa152d","mcp_get_code":{"code_sha256":"94642dfc7cfa152d"}},{"arxiv_id":"2303.15724","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-detailed-and-mask-free-universal","title":"Scalable, Detailed and Mask-Free Universal Photometric Stereo","date":"2023-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"satoshi-ikehata/sdm-unips-cvpr2023","path":"sdm_unips/modules/model/model.py","file_url":"https://github.com/satoshi-ikehata/sdm-unips-cvpr2023/blob/HEAD/sdm_unips/modules/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, satoshi-ikehata/sdm-unips-cvpr2023 (NOASSERTION)","code_sha256":"18c46000813125d3","code_sha256_prefix":"18c46000813125d3","mcp_get_code":{"code_sha256":"18c46000813125d3"}}],"record_sha256":"7329ea15c0ef8edad0b238b9577ce34f624b107672bac5bbbbc417d725c27a26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}