{"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/filter-data","entry":"filter_data","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":19,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":8,"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":13,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":6,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"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":"2607.06973","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-06973","title":"Rethinking Multimodal Time-Series Forecasting Evaluation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"decisionintelligence/TFB","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/TFB/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2604.13924","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-13924","title":"ASTER: Latent Pseudo-Anomaly Generation for Unsupervised Time-Series Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"decisionintelligence/TAB","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/TAB/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, decisionintelligence/TAB when it was checked","code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2603.21828","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21828","title":"CoRA: Boosting Time Series Foundation Models for Multivariate Forecasting through Correlation-aware Adapter","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"decisionintelligence/CoRA","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/CoRA/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, decisionintelligence/CoRA when it was checked","code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2602.18603","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18603","title":"Enhancing Goal Inference via Correction Timing","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"iqr-lab/correction-timing","path":"codes/where_model.py","file_url":"https://github.com/iqr-lab/correction-timing/blob/HEAD/codes/where_model.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":"104b7e2ec9e26645","code_sha256_prefix":"104b7e2ec9e26645","mcp_get_code":{"code_sha256":"104b7e2ec9e26645"}},{"arxiv_id":"2510.23672","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-23672","title":"DBLoss: Decomposition-based Loss Function for Time Series Forecasting","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"decisionintelligence/DBLoss","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/DBLoss/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2510.16511","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16511","title":"Structured Temporal Causality for Interpretable Multivariate Time Series Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"decisionintelligence/CATCH","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/CATCH/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, decisionintelligence/CATCH when it was checked","code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2506.18046","arxiv_id_is_arxiv":true,"paper":"/paper/tab-unified-benchmarking-of-time-series","title":"TAB: Unified Benchmarking of Time Series Anomaly Detection Methods","date":"2025-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/tab","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/tab/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, decisionintelligence/tab when it was checked","code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"2502.18754","arxiv_id_is_arxiv":true,"paper":"/paper/agentsociety-challenge-designing-llm-agents","title":"AgentSociety Challenge: Designing LLM Agents for User Modeling and Recommendation on Web Platforms","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/agentsocietychallenge","path":"data_process.py","file_url":"https://github.com/tsinghua-fib-lab/agentsocietychallenge/blob/HEAD/data_process.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":"ff075553db5b65e2","code_sha256_prefix":"ff075553db5b65e2","mcp_get_code":{"code_sha256":"ff075553db5b65e2"}},{"arxiv_id":"2411.12405","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-prompt-steerability-of-large","title":"Evaluating the Prompt Steerability of Large Language Models","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/prompt-steering","path":"prompt_steerability/persona/benchmark/utils/steering_utils.py","file_url":"https://github.com/IBM/prompt-steering/blob/HEAD/prompt_steerability/persona/benchmark/utils/steering_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":"f969c3c13217c254","code_sha256_prefix":"f969c3c13217c254","mcp_get_code":{"code_sha256":"f969c3c13217c254"}},{"arxiv_id":"2404.12512","arxiv_id_is_arxiv":true,"paper":"/paper/proteus-preserving-model-confidentiality","title":"Proteus: Preserving Model Confidentiality during Graph Optimizations","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"proteus-mlsys24/mlsys24-artifact","path":"figures/fig5-gnn-classifier/filter_and_train.py","file_url":"https://github.com/proteus-mlsys24/mlsys24-artifact/blob/HEAD/figures/fig5-gnn-classifier/filter_and_train.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, proteus-mlsys24/mlsys24-artifact when it was checked","code_sha256":"c33bb9497ed9398f","code_sha256_prefix":"c33bb9497ed9398f","mcp_get_code":{"code_sha256":"c33bb9497ed9398f"}},{"arxiv_id":"2403.13458","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-for-data-driven-2","title":"Uncertainty quantification for data-driven weather models","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cbuelt/dduq","path":"wb2/ifs.py","file_url":"https://github.com/cbuelt/dduq/blob/HEAD/wb2/ifs.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":"8ceaa09f3605111c","code_sha256_prefix":"8ceaa09f3605111c","mcp_get_code":{"code_sha256":"8ceaa09f3605111c"}},{"arxiv_id":"2401.15563","arxiv_id_is_arxiv":true,"paper":"/paper/brepgen-a-b-rep-generative-diffusion-model","title":"BrepGen: A B-rep Generative Diffusion Model with Structured Latent Geometry","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samxuxiang/brepgen","path":"dataset.py","file_url":"https://github.com/samxuxiang/brepgen/blob/HEAD/dataset.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, samxuxiang/brepgen (NOASSERTION)","code_sha256":"69210f5cf001181d","code_sha256_prefix":"69210f5cf001181d","mcp_get_code":{"code_sha256":"69210f5cf001181d"}},{"arxiv_id":"2310.06786","arxiv_id_is_arxiv":true,"paper":"/paper/openwebmath-an-open-dataset-of-high-quality","title":"OpenWebMath: An Open Dataset of High-Quality Mathematical Web Text","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keirp/OpenWebMath","path":"filtering/filter_dataset.py","file_url":"https://github.com/keirp/OpenWebMath/blob/HEAD/filtering/filter_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"527338d994af9eda","code_sha256_prefix":"527338d994af9eda","mcp_get_code":{"code_sha256":"527338d994af9eda"}},{"arxiv_id":"2303.05148","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-knowledge-transfer-with","title":"Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molden/ProbKT","path":"robust_detection/dpl_utils.py","file_url":"https://github.com/molden/ProbKT/blob/HEAD/robust_detection/dpl_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":"d2cb704276043c27","code_sha256_prefix":"d2cb704276043c27","mcp_get_code":{"code_sha256":"d2cb704276043c27"}},{"arxiv_id":"1807.06228","arxiv_id_is_arxiv":true,"paper":"/paper/rulematrix-visualizing-and-understanding","title":"RuleMatrix: Visualizing and Understanding Classifiers with Rules","date":"2018-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rulematrix/rule-matrix-py","path":"rulematrix/utils.py","file_url":"https://github.com/rulematrix/rule-matrix-py/blob/HEAD/rulematrix/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":"a8c4c235c66db7be","code_sha256_prefix":"a8c4c235c66db7be","mcp_get_code":{"code_sha256":"a8c4c235c66db7be"}},{"arxiv_id":"openreview_FYkXNAqq2D","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_FYkXNAqq2D","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"decisionintelligence/KITE","path":"ts_benchmark/pipeline.py","file_url":"https://github.com/decisionintelligence/KITE/blob/HEAD/ts_benchmark/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"005a7fb4e6c758a7","code_sha256_prefix":"005a7fb4e6c758a7","mcp_get_code":{"code_sha256":"005a7fb4e6c758a7"}},{"arxiv_id":"aaai_16593","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16593","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamHaoYuan/DSANForAAAI2021","path":"Preprocess_rr.py","file_url":"https://github.com/SamHaoYuan/DSANForAAAI2021/blob/HEAD/Preprocess_rr.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":"8f069fd78fbb0b80","code_sha256_prefix":"8f069fd78fbb0b80","mcp_get_code":{"code_sha256":"8f069fd78fbb0b80"}},{"arxiv_id":"2023.findings-emnlp.142","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.142","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Banner-Z/G-SPEED","path":"wiki_collector/data_processing/prepare.py","file_url":"https://github.com/Banner-Z/G-SPEED/blob/HEAD/wiki_collector/data_processing/prepare.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":"2f67a8c3e2ec428d","code_sha256_prefix":"2f67a8c3e2ec428d","mcp_get_code":{"code_sha256":"2f67a8c3e2ec428d"}},{"arxiv_id":"2021.emnlp-main.635","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.635","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"4AI/TDEER","path":"dataloader.py","file_url":"https://github.com/4AI/TDEER/blob/HEAD/dataloader.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":"8a9742973a1b36b3","code_sha256_prefix":"8a9742973a1b36b3","mcp_get_code":{"code_sha256":"8a9742973a1b36b3"}}],"record_sha256":"167904f669d8d94ec0c69f6d6a749a3e6045ec7a6002a2368717ab968c0212f8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}