{"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/random","entry":"random","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":15,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":2,"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":15,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":16,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":7,"unverified":3},"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":"2608.17567","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17567","title":"Domain-Adapted Molecular Language Models for Efficient Search of Make-on-Demand Libraries","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"fsk-lab/bayleys","path":"src/bayleys/acquisition/acquisition_function.py","file_url":"https://github.com/fsk-lab/bayleys/blob/HEAD/src/bayleys/acquisition/acquisition_function.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, fsk-lab/bayleys when it was checked","code_sha256":"42c75da1b51b1483","code_sha256_prefix":"42c75da1b51b1483","mcp_get_code":{"code_sha256":"42c75da1b51b1483"}},{"arxiv_id":"2608.17190","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17190","title":"How smoothing the affinity matrix affects neighborhood preservation in t-SNE","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"aida-ugent/smooth_affinity_tsne","path":"openTSNE/initialization.py","file_url":"https://github.com/aida-ugent/smooth_affinity_tsne/blob/HEAD/openTSNE/initialization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"321c8c3b648319f4","code_sha256_prefix":"321c8c3b648319f4","mcp_get_code":{"code_sha256":"321c8c3b648319f4"}},{"arxiv_id":"2511.00116","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-00116","title":"LC-Opt: Benchmarking Reinforcement Learning and Agentic AI for End-to-End Liquid Cooling Optimization in Data Centers","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"lbl-srg/modelica-buildings","path":"Buildings/Resources/Python-Sources/KalmanFilter.py","file_url":"https://github.com/lbl-srg/modelica-buildings/blob/HEAD/Buildings/Resources/Python-Sources/KalmanFilter.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, lbl-srg/modelica-buildings when it was checked","code_sha256":"3c198028edf7a2b3","code_sha256_prefix":"3c198028edf7a2b3","mcp_get_code":{"code_sha256":"3c198028edf7a2b3"}},{"arxiv_id":"2410.14030","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-flows-for-unveiling-systemic","title":"Graph Neural Flows for Unveiling Systemic Interactions Among Irregularly Sampled Time Series","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmerca/GNeuralFlow","path":"nfe/models/mask.py","file_url":"https://github.com/gmerca/GNeuralFlow/blob/HEAD/nfe/models/mask.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":"0e143234bbc4f077","code_sha256_prefix":"0e143234bbc4f077","mcp_get_code":{"code_sha256":"0e143234bbc4f077"}},{"arxiv_id":"2402.11156","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-low-rank-matrix-estimation","title":"Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jajajang/lowpopart","path":"calcsubset.py","file_url":"https://github.com/jajajang/lowpopart/blob/HEAD/calcsubset.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":"4cf818bbd16056ad","code_sha256_prefix":"4cf818bbd16056ad","mcp_get_code":{"code_sha256":"4cf818bbd16056ad"}},{"arxiv_id":"2312.17168","arxiv_id_is_arxiv":true,"paper":"/paper/can-active-sampling-reduce-causal-confusion","title":"Can Active Sampling Reduce Causal Confusion in Offline Reinforcement Learning?","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gunshi/offline_active_rl","path":"offline_active_rl/acquisitions.py","file_url":"https://github.com/gunshi/offline_active_rl/blob/HEAD/offline_active_rl/acquisitions.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":"8976987f31c76cdb","code_sha256_prefix":"8976987f31c76cdb","mcp_get_code":{"code_sha256":"8976987f31c76cdb"}},{"arxiv_id":"2311.14156","arxiv_id_is_arxiv":true,"paper":"/paper/variational-annealing-on-graphs-for","title":"Variational Annealing on Graphs for Combinatorial Optimization","date":"2023-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/vag-co","path":"VAG_CO/GreedyAlgorithms/GreedyGeneral.py","file_url":"https://github.com/ml-jku/vag-co/blob/HEAD/VAG_CO/GreedyAlgorithms/GreedyGeneral.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, ml-jku/vag-co when it was checked","code_sha256":"54144a0233d5f681","code_sha256_prefix":"54144a0233d5f681","mcp_get_code":{"code_sha256":"54144a0233d5f681"}},{"arxiv_id":"2306.15058","arxiv_id_is_arxiv":true,"paper":"/paper/batchgfn-generative-flow-networks-for-batch","title":"BatchGFN: Generative Flow Networks for Batch Active Learning","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-a-malik/batchgfn","path":"batchgfn/acquisitions/topk.py","file_url":"https://github.com/s-a-malik/batchgfn/blob/HEAD/batchgfn/acquisitions/topk.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":"a4f7d78be6c6ca4f","code_sha256_prefix":"a4f7d78be6c6ca4f","mcp_get_code":{"code_sha256":"a4f7d78be6c6ca4f"}},{"arxiv_id":"2302.08981","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-batch-active-learning-for","title":"Black-Box Batch Active Learning for Regression","date":"2023-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uqhwen2/MACAL","path":"causal_bald/library/acquisitions.py","file_url":"https://github.com/uqhwen2/MACAL/blob/HEAD/causal_bald/library/acquisitions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uqhwen2/MACAL when it was checked","code_sha256":"19f07f2e51d71313","code_sha256_prefix":"19f07f2e51d71313","mcp_get_code":{"code_sha256":"19f07f2e51d71313"}},{"arxiv_id":"2206.05825","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-approach-to-reinforcement-learning","title":"A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games","date":"2022-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssokota/mmd","path":"examples/h2h/evaluate.py","file_url":"https://github.com/ssokota/mmd/blob/HEAD/examples/h2h/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01d9233798b0f630","code_sha256_prefix":"01d9233798b0f630","mcp_get_code":{"code_sha256":"01d9233798b0f630"}},{"arxiv_id":"2204.08932","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-imagine-diversify-memory-for","title":"Learning to Imagine: Diversify Memory for Incremental Learning using Unlabeled Data","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TOM-tym/Learn-to-Imagine","path":"CIFAR100/inclearn/lib/herding.py","file_url":"https://github.com/TOM-tym/Learn-to-Imagine/blob/HEAD/CIFAR100/inclearn/lib/herding.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":"1e3aea8df18626bf","code_sha256_prefix":"1e3aea8df18626bf","mcp_get_code":{"code_sha256":"1e3aea8df18626bf"}},{"arxiv_id":"2204.08491","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-helps-pretrained-models-learn","title":"Active Learning Helps Pretrained Models Learn the Intended Task","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alextamkin/active-learning-pretrained-models","path":"models/acquisition.py","file_url":"https://github.com/alextamkin/active-learning-pretrained-models/blob/HEAD/models/acquisition.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":"2152d1eded7cbdc7","code_sha256_prefix":"2152d1eded7cbdc7","mcp_get_code":{"code_sha256":"2152d1eded7cbdc7"}},{"arxiv_id":"2111.02275","arxiv_id_is_arxiv":true,"paper":"/paper/causal-bald-deep-bayesian-active-learning-of","title":"Causal-BALD: Deep Bayesian Active Learning of Outcomes to Infer Treatment-Effects from Observational Data","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/causal-bald","path":"causal_bald/library/acquisitions.py","file_url":"https://github.com/OATML/causal-bald/blob/HEAD/causal_bald/library/acquisitions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1d75b1a3ca1e0b9","code_sha256_prefix":"d1d75b1a3ca1e0b9","mcp_get_code":{"code_sha256":"d1d75b1a3ca1e0b9"}},{"arxiv_id":"2111.02275","arxiv_id_is_arxiv":true,"paper":"/paper/causal-bald-deep-bayesian-active-learning-of","title":"Causal-BALD: Deep Bayesian Active Learning of Outcomes to Infer Treatment-Effects from Observational Data","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anndvision/causal-bald","path":"causal_bald/library/acquisitions.py","file_url":"https://github.com/anndvision/causal-bald/blob/HEAD/causal_bald/library/acquisitions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from uqhwen2/MACAL, and GitHub detected no licence in that repository when it was checked","code_sha256":"19f07f2e51d71313","code_sha256_prefix":"19f07f2e51d71313","mcp_get_code":{"code_sha256":"19f07f2e51d71313"}},{"arxiv_id":"2110.00284","arxiv_id_is_arxiv":true,"paper":"/paper/learning-reward-functions-from-scale-feedback","title":"Learning Reward Functions from Scale Feedback","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-iliad/reward-learning-scale-feedback","path":"algos.py","file_url":"https://github.com/stanford-iliad/reward-learning-scale-feedback/blob/HEAD/algos.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":"dacb1672d08b7dad","code_sha256_prefix":"dacb1672d08b7dad","mcp_get_code":{"code_sha256":"dacb1672d08b7dad"}},{"arxiv_id":"1803.11175","arxiv_id_is_arxiv":true,"paper":"/paper/universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ceshine/textrank_summary_benchmark","path":"baselines.py","file_url":"https://github.com/ceshine/textrank_summary_benchmark/blob/HEAD/baselines.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":"06039e3720a58652","code_sha256_prefix":"06039e3720a58652","mcp_get_code":{"code_sha256":"06039e3720a58652"}}],"record_sha256":"b0359f2bf71793b520e2e4d87402e07eb0848cb2b8db5c5ed5a61453cc5cafd2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}