{"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/sample-batch","entry":"sample_batch","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"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":14,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":14,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":3,"ran":7,"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":"2603.06957","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-06957","title":"Post-Training with Policy Gradients: Optimality and the Base Model Barrier","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mousavih/rlvr-base-model-barrier","path":"utils/data_generator.py","file_url":"https://github.com/mousavih/rlvr-base-model-barrier/blob/HEAD/utils/data_generator.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, mousavih/rlvr-base-model-barrier when it was checked","code_sha256":"fab2e51229014b83","code_sha256_prefix":"fab2e51229014b83","mcp_get_code":{"code_sha256":"fab2e51229014b83"}},{"arxiv_id":"2602.04596","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04596","title":"Uncertainty Decomposition for Bayes-Filtered Transformers via Bayesian Predictive Inference","date":"2026-02-04","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"weiyaw/ud4pfn","path":"experiments/beta_bernoulli/data.py","file_url":"https://github.com/weiyaw/ud4pfn/blob/HEAD/experiments/beta_bernoulli/data.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":"1aa3ed1c49159f33","code_sha256_prefix":"1aa3ed1c49159f33","mcp_get_code":{"code_sha256":"1aa3ed1c49159f33"}},{"arxiv_id":"2602.00872","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00872","title":"Learning Heat-based Equations in Self-similar variables","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Kagami-319/SSV-Learning","path":"train_window_nets.py","file_url":"https://github.com/Kagami-319/SSV-Learning/blob/HEAD/train_window_nets.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, Kagami-319/SSV-Learning when it was checked","code_sha256":"0af19b5e13a0e111","code_sha256_prefix":"0af19b5e13a0e111","mcp_get_code":{"code_sha256":"0af19b5e13a0e111"}},{"arxiv_id":"2408.14393","arxiv_id_is_arxiv":true,"paper":"/paper/cure4rec-a-benchmark-for-recommendation","title":"CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiye7lai/CURE4Rec","path":"lightgcn.py","file_url":"https://github.com/xiye7lai/CURE4Rec/blob/HEAD/lightgcn.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, xiye7lai/CURE4Rec when it was checked","code_sha256":"ff17fff81e0dc53c","code_sha256_prefix":"ff17fff81e0dc53c","mcp_get_code":{"code_sha256":"ff17fff81e0dc53c"}},{"arxiv_id":"2405.14114","arxiv_id_is_arxiv":true,"paper":"/paper/offline-reinforcement-learning-from-datasets","title":"Offline Reinforcement Learning from Datasets with Structured Non-Stationarity","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johannesack/offlinerlstructurednonstationarity","path":"RLMethods/TD3BCTrainer.py","file_url":"https://github.com/johannesack/offlinerlstructurednonstationarity/blob/HEAD/RLMethods/TD3BCTrainer.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":"9e7e7578eb33e5fc","code_sha256_prefix":"9e7e7578eb33e5fc","mcp_get_code":{"code_sha256":"9e7e7578eb33e5fc"}},{"arxiv_id":"2405.14114","arxiv_id_is_arxiv":true,"paper":"/paper/offline-reinforcement-learning-from-datasets","title":"Offline Reinforcement Learning from Datasets with Structured Non-Stationarity","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johannesack/offlinerlstructurednonstationarity","path":"RLMethods/TD3Trainer.py","file_url":"https://github.com/johannesack/offlinerlstructurednonstationarity/blob/HEAD/RLMethods/TD3Trainer.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":"9dcf8cb33934578d","code_sha256_prefix":"9dcf8cb33934578d","mcp_get_code":{"code_sha256":"9dcf8cb33934578d"}},{"arxiv_id":"2403.03792","arxiv_id_is_arxiv":true,"paper":"/paper/neural-exec-learning-and-learning-from","title":"Neural Exec: Learning (and Learning from) Execution Triggers for Prompt Injection Attacks","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pasquini-dario/llm_neuralexec","path":"find_neural_exec.py","file_url":"https://github.com/pasquini-dario/llm_neuralexec/blob/HEAD/find_neural_exec.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b05c142487c9d8c7","code_sha256_prefix":"b05c142487c9d8c7","mcp_get_code":{"code_sha256":"b05c142487c9d8c7"}},{"arxiv_id":"2402.07129","arxiv_id_is_arxiv":true,"paper":"/paper/an-attempt-to-generate-new-bridge-types-from-5","title":"An attempt to generate new bridge types from latent space of denoising diffusion Implicit model","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QQ583304953/Bridge-DDIM","path":"utils.py","file_url":"https://github.com/QQ583304953/Bridge-DDIM/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, QQ583304953/Bridge-DDIM when it was checked","code_sha256":"8f5fb6c4bd5e1646","code_sha256_prefix":"8f5fb6c4bd5e1646","mcp_get_code":{"code_sha256":"8f5fb6c4bd5e1646"}},{"arxiv_id":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-tlabs/fdal","path":"demos/demo_mnist_usps.py","file_url":"https://github.com/nv-tlabs/fdal/blob/HEAD/demos/demo_mnist_usps.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, nv-tlabs/fdal (NOASSERTION)","code_sha256":"7c115a542ded0b00","code_sha256_prefix":"7c115a542ded0b00","mcp_get_code":{"code_sha256":"7c115a542ded0b00"}},{"arxiv_id":"2312.16248","arxiv_id_is_arxiv":true,"paper":"/paper/xuance-a-comprehensive-and-unified-deep","title":"XuanCe: A Comprehensive and Unified Deep Reinforcement Learning Library","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agi-brain/xuance","path":"xuance/common/memory_tools.py","file_url":"https://github.com/agi-brain/xuance/blob/HEAD/xuance/common/memory_tools.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":"921135160e526fe7","code_sha256_prefix":"921135160e526fe7","mcp_get_code":{"code_sha256":"921135160e526fe7"}},{"arxiv_id":"2304.11582","arxiv_id_is_arxiv":true,"paper":"/paper/difftraj-generating-gps-trajectory-with-1","title":"DiffTraj: Generating GPS Trajectory with Diffusion Probabilistic Model","date":"2023-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yasoz/DiffTraj","path":"utils/helper.py","file_url":"https://github.com/Yasoz/DiffTraj/blob/HEAD/utils/helper.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":"329c8696d9d543a5","code_sha256_prefix":"329c8696d9d543a5","mcp_get_code":{"code_sha256":"329c8696d9d543a5"}},{"arxiv_id":"2106.15728","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-errors-and-estimating-accuracy-on","title":"Detecting Errors and Estimating Accuracy on Unlabeled Data with Self-training Ensembles","date":"2021-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jfc43/self-training-ensembles","path":"utils/lib.py","file_url":"https://github.com/jfc43/self-training-ensembles/blob/HEAD/utils/lib.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd7764e623711eaa","code_sha256_prefix":"cd7764e623711eaa","mcp_get_code":{"code_sha256":"cd7764e623711eaa"}},{"arxiv_id":"2007.03511","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-generalization-under-distribution","title":"Estimating Generalization under Distribution Shifts via Domain-Invariant Representations","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/estimating-generalization","path":"proxy_risk.py","file_url":"https://github.com/chingyaoc/estimating-generalization/blob/HEAD/proxy_risk.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, chingyaoc/estimating-generalization when it was checked","code_sha256":"c8e8ed07252eed12","code_sha256_prefix":"c8e8ed07252eed12","mcp_get_code":{"code_sha256":"c8e8ed07252eed12"}},{"arxiv_id":"2002.06815","arxiv_id_is_arxiv":true,"paper":"/paper/class-imbalanced-semi-supervised-learning","title":"Class-Imbalanced Semi-Supervised Learning","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MinsungHyun/Class-Imbalanced-Semi-Supervised-Learning","path":"CISSL_cls/lib/mi.py","file_url":"https://github.com/MinsungHyun/Class-Imbalanced-Semi-Supervised-Learning/blob/HEAD/CISSL_cls/lib/mi.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":"c57d6ed45a1f7842","code_sha256_prefix":"c57d6ed45a1f7842","mcp_get_code":{"code_sha256":"c57d6ed45a1f7842"}}],"record_sha256":"f35d78240b120dcea77cee3a3b2998683681d16000bd5bfdaa338af9324f9ecf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}