{"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/early-stopping","entry":"early_stopping","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":10,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":6,"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":"2607.09371","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09371","title":"Spectrally Deconfounded Gradient Boosting","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"fabsig/GPBoost","path":"python-package/gpboost/callback.py","file_url":"https://github.com/fabsig/GPBoost/blob/HEAD/python-package/gpboost/callback.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, fabsig/GPBoost (NOASSERTION)","code_sha256":"ab97f6d90b4e59a3","code_sha256_prefix":"ab97f6d90b4e59a3","mcp_get_code":{"code_sha256":"ab97f6d90b4e59a3"}},{"arxiv_id":"2605.10076","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10076","title":"A Stability Benchmark of Generative Regularizers for Inverse Problems","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"alexdenker/GenRegBench","path":"reconstruction_methods/dmplug.py","file_url":"https://github.com/alexdenker/GenRegBench/blob/HEAD/reconstruction_methods/dmplug.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, alexdenker/GenRegBench when it was checked","code_sha256":"896fcb786175b8cd","code_sha256_prefix":"896fcb786175b8cd","mcp_get_code":{"code_sha256":"896fcb786175b8cd"}},{"arxiv_id":"2405.09851","arxiv_id_is_arxiv":true,"paper":"/paper/region-of-interest-detection-in-melanocytic-1","title":"Region of Interest Detection in Melanocytic Skin Tumor Whole Slide Images -- Nevus & Melanoma","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cymichael/roi_detection","path":"method_pcla_3class.py","file_url":"https://github.com/cymichael/roi_detection/blob/HEAD/method_pcla_3class.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eaa7260ea0285663","code_sha256_prefix":"eaa7260ea0285663","mcp_get_code":{"code_sha256":"eaa7260ea0285663"}},{"arxiv_id":"2403.17343","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-free-boosters-for","title":"Residual-based Language Models are Free Boosters for Biomedical Imaging","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixinlai/llmboostmedical","path":"2D_classification/main-cam.py","file_url":"https://github.com/zhixinlai/llmboostmedical/blob/HEAD/2D_classification/main-cam.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9bd1b6234a61b66","code_sha256_prefix":"b9bd1b6234a61b66","mcp_get_code":{"code_sha256":"b9bd1b6234a61b66"}},{"arxiv_id":"2311.08385","arxiv_id_is_arxiv":true,"paper":"/paper/choire-characterizing-and-predicting-human","title":"Aligning Large Language Models with Human Opinions through Persona Selection and Value--Belief--Norm Reasoning","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dxlong2000/coo","path":"src/coo_main.py","file_url":"https://github.com/dxlong2000/coo/blob/HEAD/src/coo_main.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, dxlong2000/coo when it was checked","code_sha256":"8e09cbcc3b1d8756","code_sha256_prefix":"8e09cbcc3b1d8756","mcp_get_code":{"code_sha256":"8e09cbcc3b1d8756"}},{"arxiv_id":"2308.14029","arxiv_id_is_arxiv":true,"paper":"/paper/text-matching-improves-sequential","title":"Text Matching Improves Sequential Recommendation by Reducing Popularity Biases","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/taste","path":"utils/util.py","file_url":"https://github.com/openmatch/taste/blob/HEAD/utils/util.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":"ed46760b4d079a20","code_sha256_prefix":"ed46760b4d079a20","mcp_get_code":{"code_sha256":"ed46760b4d079a20"}},{"arxiv_id":"2203.05406","arxiv_id_is_arxiv":true,"paper":"/paper/disentangled-multimodal-representation","title":"Disentangled Multimodal Representation Learning for Recommendation","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liufancs/dmrl","path":"DMRL.py","file_url":"https://github.com/liufancs/dmrl/blob/HEAD/DMRL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liufancs/dmrl when it was checked","code_sha256":"072558bea7555c1c","code_sha256_prefix":"072558bea7555c1c","mcp_get_code":{"code_sha256":"072558bea7555c1c"}},{"arxiv_id":"2201.06239","arxiv_id_is_arxiv":true,"paper":"/paper/mt-gbm-a-multi-task-gradient-boosting-machine-1","title":"MT-GBM: A Multi-Task Gradient Boosting Machine with Shared Decision Trees","date":"2022-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antmachineintelligence/mtgbmcode","path":"python-package/lightgbmmt/callback.py","file_url":"https://github.com/antmachineintelligence/mtgbmcode/blob/HEAD/python-package/lightgbmmt/callback.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, antmachineintelligence/mtgbmcode, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"fc3614ca41e7d68f","code_sha256_prefix":"fc3614ca41e7d68f","mcp_get_code":{"code_sha256":"fc3614ca41e7d68f"}},{"arxiv_id":"2110.04176","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-convolutional-neural-networks-by","title":"PHNNs: Lightweight Neural Networks via Parameterized Hypercomplex Convolutions","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleGAN23/QVAE","path":"train_vae.py","file_url":"https://github.com/eleGAN23/QVAE/blob/HEAD/train_vae.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":"cb04204d244b0222","code_sha256_prefix":"cb04204d244b0222","mcp_get_code":{"code_sha256":"cb04204d244b0222"}},{"arxiv_id":"2005.04177","arxiv_id_is_arxiv":true,"paper":"/paper/evidence-inference-2-0-more-data-better","title":"Evidence Inference 2.0: More Data, Better Models","date":"2020-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayded/evidence-inference","path":"evidence_inference/models/model_ico_scan.py","file_url":"https://github.com/jayded/evidence-inference/blob/HEAD/evidence_inference/models/model_ico_scan.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":"7dd72936b8f132ec","code_sha256_prefix":"7dd72936b8f132ec","mcp_get_code":{"code_sha256":"7dd72936b8f132ec"}}],"record_sha256":"6b63b98b2d7dd1b1f1331d96dfd647412703ae52280c77ac193719f9a0cd3e67","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}