{"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/create-classifier","entry":"create_classifier","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":3,"ran_fixture":0,"ran":1,"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":"2602.03215","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03215","title":"Latent Neural Ordinary Differential Equations for Model-Informed Precision Dosing: Overcoming Structural Assumptions in Pharmacokinetics","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"BenJMaurel/PharmaNODE","path":"code/lib/latent_ode.py","file_url":"https://github.com/BenJMaurel/PharmaNODE/blob/HEAD/code/lib/latent_ode.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, BenJMaurel/PharmaNODE when it was checked","code_sha256":"fc9a64735be0911c","code_sha256_prefix":"fc9a64735be0911c","mcp_get_code":{"code_sha256":"fc9a64735be0911c"}},{"arxiv_id":"2402.19460","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-uncertainty-disentanglement","title":"Benchmarking Uncertainty Disentanglement: Specialized Uncertainties for Specialized Tasks","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmucsanyi/bud","path":"bud/layers/classifier.py","file_url":"https://github.com/bmucsanyi/bud/blob/HEAD/bud/layers/classifier.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":"21e3373d80025972","code_sha256_prefix":"21e3373d80025972","mcp_get_code":{"code_sha256":"21e3373d80025972"}},{"arxiv_id":"2402.12980","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-adjustment-for-complex-covariates","title":"Efficient adjustment for complex covariates: Gaining efficiency with DOPE","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexanderchristgau/outcomeadaptedadjustment","path":"estimators.py","file_url":"https://github.com/alexanderchristgau/outcomeadaptedadjustment/blob/HEAD/estimators.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, alexanderchristgau/outcomeadaptedadjustment when it was checked","code_sha256":"9ffb5736a7b8605a","code_sha256_prefix":"9ffb5736a7b8605a","mcp_get_code":{"code_sha256":"9ffb5736a7b8605a"}},{"arxiv_id":"2402.04129","arxiv_id_is_arxiv":true,"paper":"/paper/ovor-oneprompt-with-virtual-outlier","title":"OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/timm","path":"timm/layers/classifier.py","file_url":"https://github.com/pprp/timm/blob/HEAD/timm/layers/classifier.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":"f3958c754a8750d7","code_sha256_prefix":"f3958c754a8750d7","mcp_get_code":{"code_sha256":"f3958c754a8750d7"}},{"arxiv_id":"2312.10114","arxiv_id_is_arxiv":true,"paper":"/paper/fomo-bench-a-multi-modal-multi-scale-and","title":"FoMo-Bench: a multi-modal, multi-scale and multi-task Forest Monitoring Benchmark for remote sensing foundation models","date":"2023-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rolnicklab/fomo-bench","path":"utilities/model_utilities.py","file_url":"https://github.com/rolnicklab/fomo-bench/blob/HEAD/utilities/model_utilities.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":"ed7f2450e81dbcf8","code_sha256_prefix":"ed7f2450e81dbcf8","mcp_get_code":{"code_sha256":"ed7f2450e81dbcf8"}},{"arxiv_id":"2302.12604","arxiv_id_is_arxiv":true,"paper":"/paper/neural-laplace-control-for-continuous-time","title":"Neural Laplace Control for Continuous-time Delayed Systems","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/neurallaplacecontrol","path":"baseline_models/latent_ode_lib/base_models.py","file_url":"https://github.com/vanderschaarlab/neurallaplacecontrol/blob/HEAD/baseline_models/latent_ode_lib/base_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 BenJMaurel/PharmaNODE, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc9a64735be0911c","code_sha256_prefix":"fc9a64735be0911c","mcp_get_code":{"code_sha256":"fc9a64735be0911c"}},{"arxiv_id":"2206.04843","arxiv_id_is_arxiv":true,"paper":"/paper/neural-laplace-learning-diverse-classes-of","title":"Neural Laplace: Learning diverse classes of differential equations in the Laplace domain","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samholt/neurallaplace","path":"experiments/baseline_models/ode_models.py","file_url":"https://github.com/samholt/neurallaplace/blob/HEAD/experiments/baseline_models/ode_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 BenJMaurel/PharmaNODE, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc9a64735be0911c","code_sha256_prefix":"fc9a64735be0911c","mcp_get_code":{"code_sha256":"fc9a64735be0911c"}},{"arxiv_id":"2009.08372","arxiv_id_is_arxiv":true,"paper":"/paper/a-principle-of-least-action-for-the-training","title":"A Principle of Least Action for the Training of Neural Networks","date":"2020-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skander-karkar/LAP","path":"utils.py","file_url":"https://github.com/skander-karkar/LAP/blob/HEAD/utils.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, skander-karkar/LAP when it was checked","code_sha256":"b3f58f8ed60a82d6","code_sha256_prefix":"b3f58f8ed60a82d6","mcp_get_code":{"code_sha256":"b3f58f8ed60a82d6"}},{"arxiv_id":"1907.03907","arxiv_id_is_arxiv":true,"paper":"/paper/latent-odes-for-irregularly-sampled-time","title":"Latent ODEs for Irregularly-Sampled Time Series","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gkrudah/ODEnet","path":"lib/base_models.py","file_url":"https://github.com/gkrudah/ODEnet/blob/HEAD/lib/base_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 BenJMaurel/PharmaNODE, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc9a64735be0911c","code_sha256_prefix":"fc9a64735be0911c","mcp_get_code":{"code_sha256":"fc9a64735be0911c"}},{"arxiv_id":"1805.09501","arxiv_id_is_arxiv":true,"paper":"/paper/autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TillBeemelmanns/auto-augment-tf2-operations","path":"utils/classification_example.py","file_url":"https://github.com/TillBeemelmanns/auto-augment-tf2-operations/blob/HEAD/utils/classification_example.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":"250ec7daec9a09f3","code_sha256_prefix":"250ec7daec9a09f3","mcp_get_code":{"code_sha256":"250ec7daec9a09f3"}}],"record_sha256":"a3d38eb3c67860c4f1dd8afa8a0e32fc05d35108fa09eabd7d67fe9f0218a975","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}