{"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/earlystopping","entry":"EarlyStopping","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":3,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_constructed":3,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_fixture":0,"ran":3,"unverified":2},"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.24903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24903","title":"SEED: Semi-supervised Continual MalwarE Detection for Tackling ConcEpt Drift on a BuDget","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"amalapuram/SEED","path":"SSCL.py","file_url":"https://github.com/amalapuram/SEED/blob/HEAD/SSCL.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, amalapuram/SEED when it was checked","code_sha256":"2ef1b1a0841f5f35","code_sha256_prefix":"2ef1b1a0841f5f35","mcp_get_code":{"code_sha256":"2ef1b1a0841f5f35"}},{"arxiv_id":"2410.12261","arxiv_id_is_arxiv":true,"paper":"/paper/catch-channel-aware-multivariate-time-series","title":"CATCH: Channel-Aware multivariate Time Series Anomaly Detection via Frequency Patching","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/catch","path":"ts_benchmark/baselines/catch/CATCH.py","file_url":"https://github.com/decisionintelligence/catch/blob/HEAD/ts_benchmark/baselines/catch/CATCH.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, decisionintelligence/catch when it was checked","code_sha256":"e1d93133fa73f150","code_sha256_prefix":"e1d93133fa73f150","mcp_get_code":{"code_sha256":"e1d93133fa73f150"}},{"arxiv_id":"2406.06452","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-heterogeneous-treatment-effects-by","title":"Estimating Heterogeneous Treatment Effects by Combining Weak Instruments and Observational Data","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CausalML/Weak-Instruments-Obs-Data-CATE","path":"models.py","file_url":"https://github.com/CausalML/Weak-Instruments-Obs-Data-CATE/blob/HEAD/models.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, CausalML/Weak-Instruments-Obs-Data-CATE when it was checked","code_sha256":"39db0966aa749647","code_sha256_prefix":"39db0966aa749647","mcp_get_code":{"code_sha256":"39db0966aa749647"}},{"arxiv_id":"2107.01876","arxiv_id_is_arxiv":true,"paper":"/paper/causally-invariant-predictor-with-shift","title":"Which Invariance Should We Transfer? A Causal Minimax Learning Approach","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmz123321/which_invariance","path":"findoptset/findoptset.py","file_url":"https://github.com/lmz123321/which_invariance/blob/HEAD/findoptset/findoptset.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":"3efc81b90aa688b0","code_sha256_prefix":"3efc81b90aa688b0","mcp_get_code":{"code_sha256":"3efc81b90aa688b0"}},{"arxiv_id":"1907.02893","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-risk-minimization","title":"Invariant Risk Minimization","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parshakova/IRM_ICP-IC_ERM","path":"code/models.py","file_url":"https://github.com/parshakova/IRM_ICP-IC_ERM/blob/HEAD/code/models.py","status":"ran","verification_level":1,"contract_check":null,"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, parshakova/IRM_ICP-IC_ERM (NOASSERTION)","code_sha256":"abbd8616af693ed0","code_sha256_prefix":"abbd8616af693ed0","mcp_get_code":{"code_sha256":"abbd8616af693ed0"}}],"record_sha256":"d27c6bc6bea8d277a91e1b6d3b68ba6692477045d009cc19e9f3735cb916d616","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}