{"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/timer-2","entry":"Timer","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":12,"n_samples_constructed":10,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":5,"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":0,"ran_fixture":0,"ran":12,"unverified":0},"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":"2605.14686","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14686","title":"ReMIA: a Powerful and Efficient Alternative to Membership Inference Attacks against Synthetic Data Generators","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"aindo-com/remia","path":"src/remia.py","file_url":"https://github.com/aindo-com/remia/blob/HEAD/src/remia.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":"05e023d4fe9438b8","code_sha256_prefix":"05e023d4fe9438b8","mcp_get_code":{"code_sha256":"05e023d4fe9438b8"}},{"arxiv_id":"2502.00846","arxiv_id_is_arxiv":true,"paper":"/paper/federated-generalised-variational-inference-a","title":"Federated Generalised Variational Inference: A Robust Probabilistic Federated Learning Framework","date":"2025-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Terje-M/FedGVI","path":"code/fedgvi_experiments/servers/fedgvi_server.py","file_url":"https://github.com/Terje-M/FedGVI/blob/HEAD/code/fedgvi_experiments/servers/fedgvi_server.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, Terje-M/FedGVI when it was checked","code_sha256":"b1c4931c0559950b","code_sha256_prefix":"b1c4931c0559950b","mcp_get_code":{"code_sha256":"b1c4931c0559950b"}},{"arxiv_id":"2406.11370","arxiv_id_is_arxiv":true,"paper":"/paper/fairer-preferences-elicit-improved-human","title":"Fairer Preferences Elicit Improved Human-Aligned Large Language Model Judgments","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/zepo","path":"zepo.py","file_url":"https://github.com/cambridgeltl/zepo/blob/HEAD/zepo.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":"39083ac397faebe6","code_sha256_prefix":"39083ac397faebe6","mcp_get_code":{"code_sha256":"39083ac397faebe6"}},{"arxiv_id":"2402.15017","arxiv_id_is_arxiv":true,"paper":"/paper/towards-few-shot-adaptation-of-foundation","title":"Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oliverxuzy/foudation-model_multitask","path":"finetune.py","file_url":"https://github.com/oliverxuzy/foudation-model_multitask/blob/HEAD/finetune.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, oliverxuzy/foudation-model_multitask when it was checked","code_sha256":"103e5bf76abe5b7d","code_sha256_prefix":"103e5bf76abe5b7d","mcp_get_code":{"code_sha256":"103e5bf76abe5b7d"}},{"arxiv_id":"2402.07226","arxiv_id_is_arxiv":true,"paper":"/paper/stitching-sub-trajectories-with-conditional","title":"Stitching Sub-Trajectories with Conditional Diffusion Model for Goal-Conditioned Offline RL","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlatjddbs/SSD","path":"dc/dc.py","file_url":"https://github.com/rlatjddbs/SSD/blob/HEAD/dc/dc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rlatjddbs/SSD when it was checked","code_sha256":"92d5319d3f565de2","code_sha256_prefix":"92d5319d3f565de2","mcp_get_code":{"code_sha256":"92d5319d3f565de2"}},{"arxiv_id":"2306.01685","arxiv_id_is_arxiv":true,"paper":"/paper/mkor-momentum-enabled-kronecker-factor-based","title":"MKOR: Momentum-Enabled Kronecker-Factor-Based Optimizer Using Rank-1 Updates","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohammad-mozaffari/mkor","path":"mkor/mkor.py","file_url":"https://github.com/mohammad-mozaffari/mkor/blob/HEAD/mkor/mkor.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, mohammad-mozaffari/mkor when it was checked","code_sha256":"61eef187833440e6","code_sha256_prefix":"61eef187833440e6","mcp_get_code":{"code_sha256":"61eef187833440e6"}},{"arxiv_id":"2210.05150","arxiv_id_is_arxiv":true,"paper":"/paper/dhrl-a-graph-based-approach-for-long-horizon","title":"DHRL: A Graph-Based Approach for Long-Horizon and Sparse Hierarchical Reinforcement Learning","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaylee0301/dhrl_official","path":"DHRL/rl/algo/dhrl.py","file_url":"https://github.com/jaylee0301/dhrl_official/blob/HEAD/DHRL/rl/algo/dhrl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0a70a9d3e815dfb","code_sha256_prefix":"e0a70a9d3e815dfb","mcp_get_code":{"code_sha256":"e0a70a9d3e815dfb"}},{"arxiv_id":"2210.04642","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-via-planning-for-information","title":"Exploration via Planning for Information about the Optimal Trajectory","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rehoss/lbmpc_semimarkov","path":"lbmpc_semimarkov/acq/acquisition.py","file_url":"https://github.com/rehoss/lbmpc_semimarkov/blob/HEAD/lbmpc_semimarkov/acq/acquisition.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":"0ab042ab92eeb876","code_sha256_prefix":"0ab042ab92eeb876","mcp_get_code":{"code_sha256":"0ab042ab92eeb876"}},{"arxiv_id":"2106.01613","arxiv_id_is_arxiv":true,"paper":"/paper/node-gam-neural-generalized-additive-model","title":"NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learning","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzzace2000/nodegam","path":"nodegam/arch.py","file_url":"https://github.com/zzzace2000/nodegam/blob/HEAD/nodegam/arch.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":"328250adf4274596","code_sha256_prefix":"328250adf4274596","mcp_get_code":{"code_sha256":"328250adf4274596"}},{"arxiv_id":"2104.09460","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-algorithm-execution-estimating","title":"Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willieneis/bayesian-algorithm-execution","path":"bax/acq/acquisition.py","file_url":"https://github.com/willieneis/bayesian-algorithm-execution/blob/HEAD/bax/acq/acquisition.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, willieneis/bayesian-algorithm-execution when it was checked","code_sha256":"a8822bf268bce5b0","code_sha256_prefix":"a8822bf268bce5b0","mcp_get_code":{"code_sha256":"a8822bf268bce5b0"}},{"arxiv_id":"2010.05273","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-via-posterior-averaging-a-1","title":"Federated Learning via Posterior Averaging: A New Perspective and Practical Algorithms","date":"2020-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alshedivat/fedpa","path":"federated/learning/algorithms.py","file_url":"https://github.com/alshedivat/fedpa/blob/HEAD/federated/learning/algorithms.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":"d2449ec852478290","code_sha256_prefix":"d2449ec852478290","mcp_get_code":{"code_sha256":"d2449ec852478290"}},{"arxiv_id":"2002.06774","arxiv_id_is_arxiv":true,"paper":"/paper/residual-continual-learning","title":"Residual Continual Learning","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parvex/residual-continual-learning-benchmark","path":"agents/regularization.py","file_url":"https://github.com/parvex/residual-continual-learning-benchmark/blob/HEAD/agents/regularization.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":"a734a8b4d53236df","code_sha256_prefix":"a734a8b4d53236df","mcp_get_code":{"code_sha256":"a734a8b4d53236df"}}],"record_sha256":"b43d6ceca03df026d7bb02d37b312092239c720c1b0fc055eaeeafd53bbd427e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}