{"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/pkl-load","entry":"pkl_load","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"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":1,"ran_fixture":0,"ran":2,"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":"2602.23663","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23663","title":"Disentangled Mode-Specific Representations for Tensor Time Series via Contrastive Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KoheiObata/MoST","path":"utils.py","file_url":"https://github.com/KoheiObata/MoST/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KoheiObata/MoST when it was checked","code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2510.06699","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-06699","title":"A Diffusion Model for Regular Time Series Generation from Irregular Data with Completion and Masking","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"azencot-group/ImagenI2R","path":"metrics/context_fid.py","file_url":"https://github.com/azencot-group/ImagenI2R/blob/HEAD/metrics/context_fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, azencot-group/ImagenI2R when it was checked","code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2411.07506","arxiv_id_is_arxiv":true,"paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Models/ts2vec/utils.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Models/ts2vec/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, unites-lab/fmts when it was checked","code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2312.15709","arxiv_id_is_arxiv":true,"paper":"/paper/timesurl-self-supervised-contrastive-learning","title":"TimesURL: Self-supervised Contrastive Learning for Universal Time Series Representation Learning","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alrash/TimesURL","path":"src/utils.py","file_url":"https://github.com/Alrash/TimesURL/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2311.11235","arxiv_id_is_arxiv":true,"paper":"/paper/unraveling-the-anomaly-in-time-series-anomaly","title":"Unraveling the \"Anomaly\" in Time Series Anomaly Detection: A Self-supervised Tri-domain Solution","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pseudo-skye/triad","path":"preprocess_data.py","file_url":"https://github.com/pseudo-skye/triad/blob/HEAD/preprocess_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pseudo-skye/triad when it was checked","code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2202.01575","arxiv_id_is_arxiv":true,"paper":"/paper/cost-contrastive-learning-of-disentangled-1","title":"CoST: Contrastive Learning of Disentangled Seasonal-Trend Representations for Time Series Forecasting","date":"2022-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/CoST","path":"utils.py","file_url":"https://github.com/salesforce/CoST/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"2110.12320","arxiv_id_is_arxiv":true,"paper":"/paper/cova-context-aware-visual-attention-for","title":"CoVA: Context-aware Visual Attention for Webpage Information Extraction","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevalmorabia97/cova-web-object-detection","path":"utils.py","file_url":"https://github.com/kevalmorabia97/cova-web-object-detection/blob/HEAD/utils.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":"7d27c8ec904b9dfc","code_sha256_prefix":"7d27c8ec904b9dfc","mcp_get_code":{"code_sha256":"7d27c8ec904b9dfc"}},{"arxiv_id":"2106.10466","arxiv_id_is_arxiv":true,"paper":"/paper/learning-timestamp-level-representations-for","title":"TS2Vec: Towards Universal Representation of Time Series","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhihanyue/ts2vec","path":"utils.py","file_url":"https://github.com/zhihanyue/ts2vec/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"645d1fdb1dc0e80c","code_sha256_prefix":"645d1fdb1dc0e80c","mcp_get_code":{"code_sha256":"645d1fdb1dc0e80c"}},{"arxiv_id":"1906.03158","arxiv_id_is_arxiv":true,"paper":"/paper/matching-the-blanks-distributional-similarity","title":"Matching the Blanks: Distributional Similarity for Relation Learning","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction","path":"baseline/data_utils.py","file_url":"https://github.com/uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/blob/HEAD/baseline/data_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":"1012ce3bde482566","code_sha256_prefix":"1012ce3bde482566","mcp_get_code":{"code_sha256":"1012ce3bde482566"}},{"arxiv_id":"2022.acl-long.141","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.acl-long.141","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Los-Phoenix/NFETC-FCLC","path":"preprocess.py","file_url":"https://github.com/Los-Phoenix/NFETC-FCLC/blob/HEAD/preprocess.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":"c54560a0dca774a6","code_sha256_prefix":"c54560a0dca774a6","mcp_get_code":{"code_sha256":"c54560a0dca774a6"}}],"record_sha256":"f312c0d524b55266d8b175372142661c4b796764ff9da8c215cbfbce3e649d0d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}