{"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/detach","entry":"detach","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":4,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":1,"ran_fixture":1,"ran":6,"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":"2410.01086","arxiv_id_is_arxiv":true,"paper":"/paper/an-introduction-to-deep-survival-analysis","title":"An Introduction to Deep Survival Analysis Models for Predicting Time-to-Event Outcomes","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgehc/survival-intro","path":"SODEN/trainers.py","file_url":"https://github.com/georgehc/survival-intro/blob/HEAD/SODEN/trainers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, georgehc/survival-intro (NOASSERTION)","code_sha256":"7bfce1592a02f7e9","code_sha256_prefix":"7bfce1592a02f7e9","mcp_get_code":{"code_sha256":"7bfce1592a02f7e9"}},{"arxiv_id":"2106.04188","arxiv_id_is_arxiv":true,"paper":"/paper/stability-and-generalization-of-bilevel","title":"Stability and Generalization of Bilevel Programming in Hyperparameter Optimization","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baofff/stability_ho","path":"core/utils.py","file_url":"https://github.com/baofff/stability_ho/blob/HEAD/core/utils.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":"b1f0685d97787668","code_sha256_prefix":"b1f0685d97787668","mcp_get_code":{"code_sha256":"b1f0685d97787668"}},{"arxiv_id":"2010.02966","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-with-random-delays-1","title":"Reinforcement Learning with Random Delays","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmst/rlrd","path":"rlrd/nn.py","file_url":"https://github.com/rmst/rlrd/blob/HEAD/rlrd/nn.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":"9bf0c974e2a7db1f","code_sha256_prefix":"9bf0c974e2a7db1f","mcp_get_code":{"code_sha256":"9bf0c974e2a7db1f"}},{"arxiv_id":"2008.08637","arxiv_id_is_arxiv":true,"paper":"/paper/soden-a-scalable-continuous-time-survival","title":"SODEN: A Scalable Continuous-Time Survival Model through Ordinary Differential Equation Networks","date":"2020-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqima/soden","path":"trainers.py","file_url":"https://github.com/jiaqima/soden/blob/HEAD/trainers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from georgehc/survival-intro, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"7bfce1592a02f7e9","code_sha256_prefix":"7bfce1592a02f7e9","mcp_get_code":{"code_sha256":"7bfce1592a02f7e9"}},{"arxiv_id":"2007.13794","arxiv_id_is_arxiv":true,"paper":"/paper/neural-temporal-point-processes-for-modelling","title":"Neural Temporal Point Processes For Modelling Electronic Health Records","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"babylonhealth/neuralTPPs","path":"debug/regression.py","file_url":"https://github.com/babylonhealth/neuralTPPs/blob/HEAD/debug/regression.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":"766b61c71c5f3298","code_sha256_prefix":"766b61c71c5f3298","mcp_get_code":{"code_sha256":"766b61c71c5f3298"}},{"arxiv_id":"1911.11293","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-saliency-maps-for-explainable-ai-1","title":"Efficient Saliency Maps for Explainable AI","date":"2019-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LLNL/fastcam","path":"misc.py","file_url":"https://github.com/LLNL/fastcam/blob/HEAD/misc.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":"4ea7f36f95933b70","code_sha256_prefix":"4ea7f36f95933b70","mcp_get_code":{"code_sha256":"4ea7f36f95933b70"}},{"arxiv_id":"1906.05226","arxiv_id_is_arxiv":true,"paper":"/paper/continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramakanth-pasunuru/CAS-MAS","path":"utils.py","file_url":"https://github.com/ramakanth-pasunuru/CAS-MAS/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":"ae10f6a1349f797f","code_sha256_prefix":"ae10f6a1349f797f","mcp_get_code":{"code_sha256":"ae10f6a1349f797f"}},{"arxiv_id":"1905.10521","arxiv_id_is_arxiv":true,"paper":"/paper/bivariate-beta-lstm","title":"Bivariate Beta-LSTM","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtshs2/BetaLSTM","path":"music/train_music.py","file_url":"https://github.com/gtshs2/BetaLSTM/blob/HEAD/music/train_music.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gtshs2/BetaLSTM when it was checked","code_sha256":"83d1c2e11d595efa","code_sha256_prefix":"83d1c2e11d595efa","mcp_get_code":{"code_sha256":"83d1c2e11d595efa"}},{"arxiv_id":"1904.09408","arxiv_id_is_arxiv":true,"paper":"/paper/190409408","title":"Language Models with Transformers","date":"2019-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgraywang/gluon-nlp-1","path":"scripts/language_model/transformer_language_model.py","file_url":"https://github.com/cgraywang/gluon-nlp-1/blob/HEAD/scripts/language_model/transformer_language_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cgraywang/gluon-nlp-1 when it was checked","code_sha256":"53f636bb78c95254","code_sha256_prefix":"53f636bb78c95254","mcp_get_code":{"code_sha256":"53f636bb78c95254"}},{"arxiv_id":"1904.02399","arxiv_id_is_arxiv":true,"paper":"/paper/riemannian-normalizing-flow-on-variational","title":"Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kingofspace0wzz/wae-rnf-lm","path":"copula-lm/model.py","file_url":"https://github.com/kingofspace0wzz/wae-rnf-lm/blob/HEAD/copula-lm/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from gtshs2/BetaLSTM, and GitHub detected no licence in that repository when it was checked","code_sha256":"83d1c2e11d595efa","code_sha256_prefix":"83d1c2e11d595efa","mcp_get_code":{"code_sha256":"83d1c2e11d595efa"}},{"arxiv_id":"1903.07020","arxiv_id_is_arxiv":true,"paper":"/paper/zeno-robust-asynchronous-sgd-with-arbitrary","title":"Zeno++: Robust Fully Asynchronous SGD","date":"2019-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xcgoner/iclr2020_zeno_async","path":"train_wikitext.py","file_url":"https://github.com/xcgoner/iclr2020_zeno_async/blob/HEAD/train_wikitext.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":"86bd1f271c4f8fcb","code_sha256_prefix":"86bd1f271c4f8fcb","mcp_get_code":{"code_sha256":"86bd1f271c4f8fcb"}}],"record_sha256":"27a3477a5b70d36d78ab2497751f52eaa855701d638b2d3790f36522a64ab7e6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}