{"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/data-split","entry":"data_split","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":17,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":7,"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":16,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":18,"n_places_pointer_only":9,"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":3,"ran_fixture":2,"ran":10,"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":"2606.10448","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10448","title":"Mitigating Bias in Low-SNR Financial Reinforcement Learning via Quantum Representations","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ZeyuLIU-UST/FPQC-SAC-main","path":"finrl/meta/preprocessor/preprocessors.py","file_url":"https://github.com/ZeyuLIU-UST/FPQC-SAC-main/blob/HEAD/finrl/meta/preprocessor/preprocessors.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, ZeyuLIU-UST/FPQC-SAC-main (NOASSERTION)","code_sha256":"9e2462a4091d6bdc","code_sha256_prefix":"9e2462a4091d6bdc","mcp_get_code":{"code_sha256":"9e2462a4091d6bdc"}},{"arxiv_id":"2511.08846","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-08846","title":"On topological descriptors for graph products","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"Aalto-QuML/tda_graph_product","path":"datasets.py","file_url":"https://github.com/Aalto-QuML/tda_graph_product/blob/HEAD/datasets.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, Aalto-QuML/tda_graph_product when it was checked","code_sha256":"6a8ee3ce32d9acd3","code_sha256_prefix":"6a8ee3ce32d9acd3","mcp_get_code":{"code_sha256":"6a8ee3ce32d9acd3"}},{"arxiv_id":"2411.15206","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenjie20/SSCDL","path":"utils.py","file_url":"https://github.com/chenjie20/SSCDL/blob/HEAD/utils.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, chenjie20/SSCDL when it was checked","code_sha256":"ba1e40dec8f1105e","code_sha256_prefix":"ba1e40dec8f1105e","mcp_get_code":{"code_sha256":"ba1e40dec8f1105e"}},{"arxiv_id":"2410.09629","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-knowledge-ingestion-towards","title":"Synthetic Knowledge Ingestion: Towards Knowledge Refinement and Injection for Enhancing Large Language Models","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intuit-ai-research/knowledge-infused-ai","path":"synthetic-knowledge-ingestion/finetuning/data_preparation.py","file_url":"https://github.com/intuit-ai-research/knowledge-infused-ai/blob/HEAD/synthetic-knowledge-ingestion/finetuning/data_preparation.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":"d889e2a80bfef40d","code_sha256_prefix":"d889e2a80bfef40d","mcp_get_code":{"code_sha256":"d889e2a80bfef40d"}},{"arxiv_id":"2405.06880","arxiv_id_is_arxiv":true,"paper":"/paper/emcad-efficient-multi-scale-convolutional","title":"EMCAD: Efficient Multi-scale Convolutional Attention Decoding for Medical Image Segmentation","date":"2024-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sldgroup/emcad","path":"utils/format_conversion.py","file_url":"https://github.com/sldgroup/emcad/blob/HEAD/utils/format_conversion.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sldgroup/emcad (NOASSERTION)","code_sha256":"8cbe68372aad40f6","code_sha256_prefix":"8cbe68372aad40f6","mcp_get_code":{"code_sha256":"8cbe68372aad40f6"}},{"arxiv_id":"2404.00712","arxiv_id_is_arxiv":true,"paper":"/paper/survey-of-computerized-adaptive-testing-a","title":"Survey of Computerized Adaptive Testing: A Machine Learning Perspective","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/educat","path":"scripts/bobcat_train.py","file_url":"https://github.com/bigdata-ustc/educat/blob/HEAD/scripts/bobcat_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c06783f2193b248","code_sha256_prefix":"6c06783f2193b248","mcp_get_code":{"code_sha256":"6c06783f2193b248"}},{"arxiv_id":"2402.18152","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-neural-representations-for-videos","title":"Boosting Neural Representations for Videos with a Conditional Decoder","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xinjie-Q/Boosting-NeRV","path":"hnerv_utils.py","file_url":"https://github.com/Xinjie-Q/Boosting-NeRV/blob/HEAD/hnerv_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":"c550e0aeb789ebd2","code_sha256_prefix":"c550e0aeb789ebd2","mcp_get_code":{"code_sha256":"c550e0aeb789ebd2"}},{"arxiv_id":"2402.07742","arxiv_id_is_arxiv":true,"paper":"/paper/asking-multimodal-clarifying-questions-in","title":"Asking Multimodal Clarifying Questions in Mixed-Initiative Conversational Search","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfyuan01/mqc","path":"facet_data/train_split.py","file_url":"https://github.com/yfyuan01/mqc/blob/HEAD/facet_data/train_split.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, yfyuan01/mqc when it was checked","code_sha256":"d35ee4a3f75ba6dd","code_sha256_prefix":"d35ee4a3f75ba6dd","mcp_get_code":{"code_sha256":"d35ee4a3f75ba6dd"}},{"arxiv_id":"2310.17498","arxiv_id_is_arxiv":true,"paper":"/paper/cbd-a-certified-backdoor-detector-based-on-1","title":"CBD: A Certified Backdoor Detector Based on Local Dominant Probability","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenxianglance/cbd","path":"src/util.py","file_url":"https://github.com/zhenxianglance/cbd/blob/HEAD/src/util.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, zhenxianglance/cbd when it was checked","code_sha256":"454a84e28567bd39","code_sha256_prefix":"454a84e28567bd39","mcp_get_code":{"code_sha256":"454a84e28567bd39"}},{"arxiv_id":"2308.05309","arxiv_id_is_arxiv":true,"paper":"/paper/homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galogm/hole","path":"models/HoLe_batch.py","file_url":"https://github.com/galogm/hole/blob/HEAD/models/HoLe_batch.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":"59bb258945226a8b","code_sha256_prefix":"59bb258945226a8b","mcp_get_code":{"code_sha256":"59bb258945226a8b"}},{"arxiv_id":"2304.13174","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-datasets-and-market-environments-for","title":"Dynamic Datasets and Market Environments for Financial Reinforcement Learning","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"840792cc80b38e1a","code_sha256_prefix":"840792cc80b38e1a","mcp_get_code":{"code_sha256":"840792cc80b38e1a"}},{"arxiv_id":"2211.03107","arxiv_id_is_arxiv":true,"paper":"/paper/finrl-meta-market-environments-and-benchmarks","title":"FinRL-Meta: Market Environments and Benchmarks for Data-Driven Financial Reinforcement Learning","date":"2022-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"840792cc80b38e1a","code_sha256_prefix":"840792cc80b38e1a","mcp_get_code":{"code_sha256":"840792cc80b38e1a"}},{"arxiv_id":"2208.10888","arxiv_id_is_arxiv":true,"paper":"/paper/joint-privacy-enhancement-and-quantization-in","title":"Joint Privacy Enhancement and Quantization in Federated Learning","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"langnatalie/jopeq","path":"utils.py","file_url":"https://github.com/langnatalie/jopeq/blob/HEAD/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":"5e8d1204e415bd16","code_sha256_prefix":"5e8d1204e415bd16","mcp_get_code":{"code_sha256":"5e8d1204e415bd16"}},{"arxiv_id":"2112.06753","arxiv_id_is_arxiv":true,"paper":"/paper/finrl-meta-a-universe-of-near-real-market","title":"FinRL-Meta: A Universe of Near-Real Market Environments for Data-Driven Deep Reinforcement Learning in Quantitative Finance","date":"2021-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Finance-Foundation/FinRL-Meta","path":"examples/run_rl_portfolio_optimization.py","file_url":"https://github.com/AI4Finance-Foundation/FinRL-Meta/blob/HEAD/examples/run_rl_portfolio_optimization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"840792cc80b38e1a","code_sha256_prefix":"840792cc80b38e1a","mcp_get_code":{"code_sha256":"840792cc80b38e1a"}},{"arxiv_id":"2106.01342","arxiv_id_is_arxiv":true,"paper":"/paper/saint-improved-neural-networks-for-tabular","title":"SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Training","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somepago/saint","path":"data_openml.py","file_url":"https://github.com/somepago/saint/blob/HEAD/data_openml.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, somepago/saint, 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":"afcf8e4fc8cd0b4d","code_sha256_prefix":"afcf8e4fc8cd0b4d","mcp_get_code":{"code_sha256":"afcf8e4fc8cd0b4d"}},{"arxiv_id":"2005.09682","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-derivation-of-stellar-properties","title":"Data-driven derivation of stellar properties from photometric time series data using convolutional neural networks","date":null,"month_inferred_from_arxiv_id":"2020-05","title_source":"archive","repo":"kblancato/theia-net","path":"theia-net/classification/modules/prepare_data.py","file_url":"https://github.com/kblancato/theia-net/blob/HEAD/theia-net/classification/modules/prepare_data.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":"32603d33af9b46af","code_sha256_prefix":"32603d33af9b46af","mcp_get_code":{"code_sha256":"32603d33af9b46af"}},{"arxiv_id":"2005.09682","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-derivation-of-stellar-properties","title":"Data-driven derivation of stellar properties from photometric time series data using convolutional neural networks","date":null,"month_inferred_from_arxiv_id":"2020-05","title_source":"archive","repo":"kblancato/theia-net","path":"theia-net/regression/modules/prepare_data.py","file_url":"https://github.com/kblancato/theia-net/blob/HEAD/theia-net/regression/modules/prepare_data.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":"39276dfd7995f5d3","code_sha256_prefix":"39276dfd7995f5d3","mcp_get_code":{"code_sha256":"39276dfd7995f5d3"}},{"arxiv_id":"1907.02189","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-convergence-of-fedavg-on-non-iid-data","title":"On the Convergence of FedAvg on Non-IID Data","date":"2019-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lx10077/fedavgpy","path":"data/mnist/generate_random_niid.py","file_url":"https://github.com/lx10077/fedavgpy/blob/HEAD/data/mnist/generate_random_niid.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bc895fd7c355f2a","code_sha256_prefix":"3bc895fd7c355f2a","mcp_get_code":{"code_sha256":"3bc895fd7c355f2a"}}],"record_sha256":"9d9adba99b11a8a26fe26a704a2984caaef7bae75fd28b054125e1d8615f5026","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}