{"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/train-loop","entry":"train_loop","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":11,"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":14,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":14,"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":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":8,"unverified":5},"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":"2604.23528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23528","title":"When PINNs Go Wrong: Pseudo-Time Stepping Against Spurious Solutions","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sifanexisted/jaxpi2","path":"jaxpi/training.py","file_url":"https://github.com/sifanexisted/jaxpi2/blob/HEAD/jaxpi/training.py","status":"unverified","verification_level":0,"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":"9ef8548ae633ca26","code_sha256_prefix":"9ef8548ae633ca26","mcp_get_code":{"code_sha256":"9ef8548ae633ca26"}},{"arxiv_id":"2504.08129","arxiv_id_is_arxiv":true,"paper":"/paper/between-linear-and-sinusoidal-rethinking-the","title":"Between Linear and Sinusoidal: Rethinking the Time Encoder in Dynamic Graph Learning","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsinghuan/dg-linear-time","path":"auxiliary/synthetic.py","file_url":"https://github.com/hsinghuan/dg-linear-time/blob/HEAD/auxiliary/synthetic.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":"dff46a044e84aff7","code_sha256_prefix":"dff46a044e84aff7","mcp_get_code":{"code_sha256":"dff46a044e84aff7"}},{"arxiv_id":"2501.19403","arxiv_id_is_arxiv":true,"paper":"/paper/redefining-machine-unlearning-a-conformal","title":"Redefining Machine Unlearning: A Conformal Prediction-Motivated Approach","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TIML-Group/Conformal-Prediction-Unlearning","path":"main_original_model.py","file_url":"https://github.com/TIML-Group/Conformal-Prediction-Unlearning/blob/HEAD/main_original_model.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":"28bf56b45f8ff355","code_sha256_prefix":"28bf56b45f8ff355","mcp_get_code":{"code_sha256":"28bf56b45f8ff355"}},{"arxiv_id":"2410.05057","arxiv_id_is_arxiv":true,"paper":"/paper/select-a-large-scale-benchmark-of-data","title":"SELECT: A Large-Scale Benchmark of Data Curation Strategies for Image Classification","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmyxu123/SELECT","path":"vtab/vtab_finetune.py","file_url":"https://github.com/jimmyxu123/SELECT/blob/HEAD/vtab/vtab_finetune.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":"7b10e462ddbf8e58","code_sha256_prefix":"7b10e462ddbf8e58","mcp_get_code":{"code_sha256":"7b10e462ddbf8e58"}},{"arxiv_id":"2305.06535","arxiv_id_is_arxiv":true,"paper":"/paper/kga-a-general-machine-unlearning-framework","title":"KGA: A General Machine Unlearning Framework Based on Knowledge Gap Alignment","date":"2023-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingzhi-wang/kgaunlearn","path":"response/run_generation.py","file_url":"https://github.com/lingzhi-wang/kgaunlearn/blob/HEAD/response/run_generation.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":"72c0db7655ddb2d6","code_sha256_prefix":"72c0db7655ddb2d6","mcp_get_code":{"code_sha256":"72c0db7655ddb2d6"}},{"arxiv_id":"2210.13043","arxiv_id_is_arxiv":true,"paper":"/paper/data-iq-characterizing-subgroups-with","title":"Data-IQ: Characterizing subgroups with heterogeneous outcomes in tabular data","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seedatnabeel/data-iq","path":"src/utils/group_dro_helpers.py","file_url":"https://github.com/seedatnabeel/data-iq/blob/HEAD/src/utils/group_dro_helpers.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":"369603fff1a7ea66","code_sha256_prefix":"369603fff1a7ea66","mcp_get_code":{"code_sha256":"369603fff1a7ea66"}},{"arxiv_id":"2206.12796","arxiv_id_is_arxiv":true,"paper":"/paper/transferring-fairness-under-distribution","title":"Transferring Fairness under Distribution Shifts via Fair Consistency Regularization","date":"2022-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/transfer-fairness","path":"laftr+consis.py","file_url":"https://github.com/umd-huang-lab/transfer-fairness/blob/HEAD/laftr%2Bconsis.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, umd-huang-lab/transfer-fairness when it was checked","code_sha256":"2ee088c87c5a9313","code_sha256_prefix":"2ee088c87c5a9313","mcp_get_code":{"code_sha256":"2ee088c87c5a9313"}},{"arxiv_id":"2206.12796","arxiv_id_is_arxiv":true,"paper":"/paper/transferring-fairness-under-distribution","title":"Transferring Fairness under Distribution Shifts via Fair Consistency Regularization","date":"2022-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/transfer-fairness","path":"cfair.py","file_url":"https://github.com/umd-huang-lab/transfer-fairness/blob/HEAD/cfair.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, umd-huang-lab/transfer-fairness when it was checked","code_sha256":"f3f35b4be3c6f201","code_sha256_prefix":"f3f35b4be3c6f201","mcp_get_code":{"code_sha256":"f3f35b4be3c6f201"}},{"arxiv_id":"2109.05522","arxiv_id_is_arxiv":true,"paper":"/paper/teasel-a-transformer-based-speech-prefixed","title":"TEASEL: A Transformer-Based Speech-Prefixed Language Model","date":"2021-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tjdevWorks/TEASEL","path":"fine_tune_mosi.py","file_url":"https://github.com/tjdevWorks/TEASEL/blob/HEAD/fine_tune_mosi.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":"9193f7ddaa9cf98e","code_sha256_prefix":"9193f7ddaa9cf98e","mcp_get_code":{"code_sha256":"9193f7ddaa9cf98e"}},{"arxiv_id":"2105.12628","arxiv_id_is_arxiv":true,"paper":"/paper/predict-then-interpolate-a-simple-algorithm","title":"Predict then Interpolate: A Simple Algorithm to Learn Stable Classifiers","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YujiaBao/Predict-then-Interpolate","path":"src/training/ours.py","file_url":"https://github.com/YujiaBao/Predict-then-Interpolate/blob/HEAD/src/training/ours.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":"d20003ab7073cb3f","code_sha256_prefix":"d20003ab7073cb3f","mcp_get_code":{"code_sha256":"d20003ab7073cb3f"}},{"arxiv_id":"2010.14290","arxiv_id_is_arxiv":true,"paper":"/paper/post-training-uncertainty-calibration-of-deep","title":"Post Training Uncertainty Calibration of Deep Networks For Medical Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"AxelJanRousseau/PostTrainCalibration","path":"u-net_model_scripts/finetune_base_model.py","file_url":"https://github.com/AxelJanRousseau/PostTrainCalibration/blob/HEAD/u-net_model_scripts/finetune_base_model.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":"cd5ce6539f54a651","code_sha256_prefix":"cd5ce6539f54a651","mcp_get_code":{"code_sha256":"cd5ce6539f54a651"}},{"arxiv_id":"2010.14290","arxiv_id_is_arxiv":true,"paper":"/paper/post-training-uncertainty-calibration-of-deep","title":"Post Training Uncertainty Calibration of Deep Networks For Medical Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"AxelJanRousseau/PostTrainCalibration","path":"u-net_model_scripts/retrain_dropout.py","file_url":"https://github.com/AxelJanRousseau/PostTrainCalibration/blob/HEAD/u-net_model_scripts/retrain_dropout.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":"d7a8367bbcba0130","code_sha256_prefix":"d7a8367bbcba0130","mcp_get_code":{"code_sha256":"d7a8367bbcba0130"}},{"arxiv_id":"2010.14290","arxiv_id_is_arxiv":true,"paper":"/paper/post-training-uncertainty-calibration-of-deep","title":"Post Training Uncertainty Calibration of Deep Networks For Medical Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"AxelJanRousseau/PostTrainCalibration","path":"aux_scripts/Train_aux.py","file_url":"https://github.com/AxelJanRousseau/PostTrainCalibration/blob/HEAD/aux_scripts/Train_aux.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":"32b55ab704551fca","code_sha256_prefix":"32b55ab704551fca","mcp_get_code":{"code_sha256":"32b55ab704551fca"}},{"arxiv_id":"openreview_5EKo3JdcR5","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_5EKo3JdcR5","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YingdaFan/ZeroDiff-ICML2026","path":"imputation/lstm/torch_utils.py","file_url":"https://github.com/YingdaFan/ZeroDiff-ICML2026/blob/HEAD/imputation/lstm/torch_utils.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":"81b20e77a4681fab","code_sha256_prefix":"81b20e77a4681fab","mcp_get_code":{"code_sha256":"81b20e77a4681fab"}}],"record_sha256":"25f61c9996753b7d53bbb7b820f9315bd05e09d71afcae376533b686ae7f63cd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}