{"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/weighted-average","entry":"weighted_average","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":10,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":5,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":11,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":2,"ran":4,"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":"2502.17184","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-data-diversity-for-instruction","title":"Measuring Data Diversity for Instruction Tuning: A Systematic Analysis and A Reliable Metric","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UmeanNever/NovelSum","path":"novelsum.py","file_url":"https://github.com/UmeanNever/NovelSum/blob/HEAD/novelsum.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b1df2266af9d9f5","code_sha256_prefix":"1b1df2266af9d9f5","mcp_get_code":{"code_sha256":"1b1df2266af9d9f5"}},{"arxiv_id":"2411.01842","arxiv_id_is_arxiv":true,"paper":"/paper/elastst-towards-robust-varied-horizon","title":"ElasTST: Towards Robust Varied-Horizon Forecasting with Elastic Time-Series Transformer","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProbTS","path":"probts/utils/utils.py","file_url":"https://github.com/microsoft/ProbTS/blob/HEAD/probts/utils/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":"3cd5309f49681509","code_sha256_prefix":"3cd5309f49681509","mcp_get_code":{"code_sha256":"3cd5309f49681509"}},{"arxiv_id":"2406.11944","arxiv_id_is_arxiv":true,"paper":"/paper/transcoders-find-interpretable-llm-feature","title":"Transcoders Find Interpretable LLM Feature Circuits","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobdunefsky/transcoder_circuits","path":"sae_training/geom_median/src/geom_median/numpy/weiszfeld_array.py","file_url":"https://github.com/jacobdunefsky/transcoder_circuits/blob/HEAD/sae_training/geom_median/src/geom_median/numpy/weiszfeld_array.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jacobdunefsky/transcoder_circuits when it was checked","code_sha256":"0c1b8e7c5079b759","code_sha256_prefix":"0c1b8e7c5079b759","mcp_get_code":{"code_sha256":"0c1b8e7c5079b759"}},{"arxiv_id":"2403.05751","arxiv_id_is_arxiv":true,"paper":"/paper/mg-tsd-multi-granularity-time-series","title":"MG-TSD: Multi-Granularity Time Series Diffusion Models with Guided Learning Process","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hundredl/MG-TSD","path":"src/utils.py","file_url":"https://github.com/Hundredl/MG-TSD/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23cd21b046ab5b4d","code_sha256_prefix":"23cd21b046ab5b4d","mcp_get_code":{"code_sha256":"23cd21b046ab5b4d"}},{"arxiv_id":"2310.09449","arxiv_id_is_arxiv":true,"paper":"/paper/pairwise-similarity-learning-is-simple-1","title":"Pairwise Similarity Learning is SimPLE","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ydwen/opensphere","path":"opensphere/module/head/simple.py","file_url":"https://github.com/ydwen/opensphere/blob/HEAD/opensphere/module/head/simple.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bd4678f04cf3ebf","code_sha256_prefix":"9bd4678f04cf3ebf","mcp_get_code":{"code_sha256":"9bd4678f04cf3ebf"}},{"arxiv_id":"2310.07587","arxiv_id_is_arxiv":true,"paper":"/paper/fed-grab-federated-long-tailed-learning-with-1","title":"Fed-GraB: Federated Long-tailed Learning with Self-Adjusting Gradient Balancer","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zackzikaixiao/fedgrab","path":"util/averaging.py","file_url":"https://github.com/zackzikaixiao/fedgrab/blob/HEAD/util/averaging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, zackzikaixiao/fedgrab when it was checked","code_sha256":"2af42978303848f8","code_sha256_prefix":"2af42978303848f8","mcp_get_code":{"code_sha256":"2af42978303848f8"}},{"arxiv_id":"2209.07923","arxiv_id_is_arxiv":true,"paper":"/paper/a-deep-moving-camera-background-model","title":"A Deep Moving-camera Background Model","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BGU-CS-VIL/DeepMCBM","path":"src/BMN.py","file_url":"https://github.com/BGU-CS-VIL/DeepMCBM/blob/HEAD/src/BMN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2cc6784d503beafa","code_sha256_prefix":"2cc6784d503beafa","mcp_get_code":{"code_sha256":"2cc6784d503beafa"}},{"arxiv_id":"2208.07363","arxiv_id_is_arxiv":true,"paper":"/paper/mocapact-a-multi-task-dataset-for-simulated","title":"MoCapAct: A Multi-Task Dataset for Simulated Humanoid Control","date":"2022-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MoCapAct","path":"mocapact/distillation/dataset.py","file_url":"https://github.com/microsoft/MoCapAct/blob/HEAD/mocapact/distillation/dataset.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":"ded38738a92916a7","code_sha256_prefix":"ded38738a92916a7","mcp_get_code":{"code_sha256":"ded38738a92916a7"}},{"arxiv_id":"2107.07502","arxiv_id_is_arxiv":true,"paper":"/paper/multibench-multiscale-benchmarks-for","title":"MultiBench: Multiscale Benchmarks for Multimodal Representation Learning","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brentyi/multimodalfilter","path":"crossmodal/base_models/utility.py","file_url":"https://github.com/brentyi/multimodalfilter/blob/HEAD/crossmodal/base_models/utility.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4da5d48e575e59b6","code_sha256_prefix":"4da5d48e575e59b6","mcp_get_code":{"code_sha256":"4da5d48e575e59b6"}},{"arxiv_id":"2004.10240","arxiv_id_is_arxiv":true,"paper":"/paper/neural-forecasting-introduction-and","title":"Deep Learning for Time Series Forecasting: Tutorial and Literature Survey","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"potosnakw/neuralforecast","path":"neuralforecast/losses/pytorch.py","file_url":"https://github.com/potosnakw/neuralforecast/blob/HEAD/neuralforecast/losses/pytorch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1af2fa5772fc7eca","code_sha256_prefix":"1af2fa5772fc7eca","mcp_get_code":{"code_sha256":"1af2fa5772fc7eca"}},{"arxiv_id":"1606.09282","arxiv_id_is_arxiv":true,"paper":"/paper/learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GMvandeVen/continual-learning","path":"models/utils/loss_functions.py","file_url":"https://github.com/GMvandeVen/continual-learning/blob/HEAD/models/utils/loss_functions.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":"1179cbb68303ab65","code_sha256_prefix":"1179cbb68303ab65","mcp_get_code":{"code_sha256":"1179cbb68303ab65"}}],"record_sha256":"8a66531da8081168edd64f64046be3bd866ad43cfc45ab4b0fe0b6beba8d7c22","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}