{"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/get-range","entry":"get_range","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":2,"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":"2602.19531","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19531","title":"A Statistical Approach for Modeling Irregular Multivariate Time Series with Missing Observations","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"YerevaNN/mimic3-benchmarks","path":"mimic3models/feature_extractor.py","file_url":"https://github.com/YerevaNN/mimic3-benchmarks/blob/HEAD/mimic3models/feature_extractor.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":"cd61a75c2a59b7a9","code_sha256_prefix":"cd61a75c2a59b7a9","mcp_get_code":{"code_sha256":"cd61a75c2a59b7a9"}},{"arxiv_id":"2210.14685","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-demonstrations-with-latent-space","title":"Leveraging Demonstrations with Latent Space Priors","date":"2022-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/latent-space-priors","path":"hucc/models/prior.py","file_url":"https://github.com/facebookresearch/latent-space-priors/blob/HEAD/hucc/models/prior.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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, facebookresearch/latent-space-priors (NOASSERTION)","code_sha256":"99f9f327d53aff63","code_sha256_prefix":"99f9f327d53aff63","mcp_get_code":{"code_sha256":"99f9f327d53aff63"}},{"arxiv_id":"1909.11966","arxiv_id_is_arxiv":true,"paper":"/paper/dual-stream-pyramid-registration-network","title":"Dual-Stream Pyramid Registration Network","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olddriverjinx/reimplemention-of-dual-prnet","path":"data_util/liver.py","file_url":"https://github.com/olddriverjinx/reimplemention-of-dual-prnet/blob/HEAD/data_util/liver.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":"3a4da2a87b9cc362","code_sha256_prefix":"3a4da2a87b9cc362","mcp_get_code":{"code_sha256":"3a4da2a87b9cc362"}},{"arxiv_id":"1907.12353","arxiv_id_is_arxiv":true,"paper":"/paper/recursive-cascaded-networks-for-unsupervised","title":"Recursive Cascaded Networks for Unsupervised Medical Image Registration","date":"2019-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Recursive-Cascaded-Networks","path":"data_util/liver.py","file_url":"https://github.com/microsoft/Recursive-Cascaded-Networks/blob/HEAD/data_util/liver.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":"3a4da2a87b9cc362","code_sha256_prefix":"3a4da2a87b9cc362","mcp_get_code":{"code_sha256":"3a4da2a87b9cc362"}},{"arxiv_id":"1804.05146","arxiv_id_is_arxiv":true,"paper":"/paper/a-comparison-of-methods-for-model-selection","title":"A comparison of methods for model selection when estimating individual treatment effects","date":"2018-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tonyduan/hte-prediction-rcts","path":"src/evaluate.py","file_url":"https://github.com/tonyduan/hte-prediction-rcts/blob/HEAD/src/evaluate.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":"1dcdabe69815a74e","code_sha256_prefix":"1dcdabe69815a74e","mcp_get_code":{"code_sha256":"1dcdabe69815a74e"}},{"arxiv_id":"1703.07771","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dongximing/Mimic3","path":"mimic3models/feature_extractor.py","file_url":"https://github.com/Dongximing/Mimic3/blob/HEAD/mimic3models/feature_extractor.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":"cd61a75c2a59b7a9","code_sha256_prefix":"cd61a75c2a59b7a9","mcp_get_code":{"code_sha256":"cd61a75c2a59b7a9"}},{"arxiv_id":"0909.4061","arxiv_id_is_arxiv":true,"paper":"/paper/finding-structure-with-randomness","title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","date":null,"month_inferred_from_arxiv_id":"2009-09","title_source":"archive","repo":"philliphelms/rsvd","path":"rsvd.py","file_url":"https://github.com/philliphelms/rsvd/blob/HEAD/rsvd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, philliphelms/rsvd when it was checked","code_sha256":"8aa277e8f42b3802","code_sha256_prefix":"8aa277e8f42b3802","mcp_get_code":{"code_sha256":"8aa277e8f42b3802"}}],"record_sha256":"cb66f82cab7d5e6971a49f70a3f448554591ac2457680640952122afbf231466","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}