{"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/gaussian-2","entry":"Gaussian","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":6,"n_samples_constructed":2,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":5,"unverified":2},"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":"2501.03729","arxiv_id_is_arxiv":true,"paper":"/paper/realistic-test-time-adaptation-of-vision","title":"Realistic Test-Time Adaptation of Vision-Language Models","date":"2025-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaxZanella/StatA","path":"solvers/StatA.py","file_url":"https://github.com/MaxZanella/StatA/blob/HEAD/solvers/StatA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, MaxZanella/StatA, is not in the permissive set Syntology serves inline","code_sha256":"628bc1963ce6c63e","code_sha256_prefix":"628bc1963ce6c63e","mcp_get_code":{"code_sha256":"628bc1963ce6c63e"}},{"arxiv_id":"2308.10468","arxiv_id_is_arxiv":true,"paper":"/paper/steerer-resolving-scale-variations-for","title":"STEERER: Resolving Scale Variations for Counting and Localization via Selective Inheritance Learning","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taohan10200/STEERER","path":"lib/models/build_counter.py","file_url":"https://github.com/taohan10200/STEERER/blob/HEAD/lib/models/build_counter.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":"68ad0daec64d1269","code_sha256_prefix":"68ad0daec64d1269","mcp_get_code":{"code_sha256":"68ad0daec64d1269"}},{"arxiv_id":"2107.11350","arxiv_id_is_arxiv":true,"paper":"/paper/heteroscedastic-temporal-variational","title":"Heteroscedastic Temporal Variational Autoencoder For Irregular Time Series","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reml-lab/hetvae","path":"src/vae_models.py","file_url":"https://github.com/reml-lab/hetvae/blob/HEAD/src/vae_models.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":"3591ea5fef885b5f","code_sha256_prefix":"3591ea5fef885b5f","mcp_get_code":{"code_sha256":"3591ea5fef885b5f"}},{"arxiv_id":"2107.10161","arxiv_id_is_arxiv":true,"paper":"/paper/evidential-deep-learning-for-open-set-action","title":"Evidential Deep Learning for Open Set Action Recognition","date":"2021-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jun-cen/psl","path":"models/base/bnn.py","file_url":"https://github.com/jun-cen/psl/blob/HEAD/models/base/bnn.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, jun-cen/psl when it was checked","code_sha256":"0532a5136c392c2c","code_sha256_prefix":"0532a5136c392c2c","mcp_get_code":{"code_sha256":"0532a5136c392c2c"}},{"arxiv_id":"2103.16130","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-for-deep-object-detection-via","title":"Active Learning for Deep Object Detection via Probabilistic Modeling","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/AL-MDN","path":"layers/modules/multibox_loss_gmm.py","file_url":"https://github.com/NVlabs/AL-MDN/blob/HEAD/layers/modules/multibox_loss_gmm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, NVlabs/AL-MDN (NOASSERTION)","code_sha256":"1e060c92c3aad845","code_sha256_prefix":"1e060c92c3aad845","mcp_get_code":{"code_sha256":"1e060c92c3aad845"}},{"arxiv_id":"2002.05810","arxiv_id_is_arxiv":true,"paper":"/paper/rna-secondary-structure-prediction-by-1","title":"RNA Secondary Structure Prediction By Learning Unrolled Algorithms","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml4bio/e2efold","path":"e2efold/common/utils.py","file_url":"https://github.com/ml4bio/e2efold/blob/HEAD/e2efold/common/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":"133678d9013b3eeb","code_sha256_prefix":"133678d9013b3eeb","mcp_get_code":{"code_sha256":"133678d9013b3eeb"}},{"arxiv_id":"1909.11957","arxiv_id_is_arxiv":true,"paper":"/paper/drawing-early-bird-tickets-towards-more","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICE-EIC/Early-Bird-Tickets","path":"filter.py","file_url":"https://github.com/RICE-EIC/Early-Bird-Tickets/blob/HEAD/filter.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":"f33359b7e60c47c1","code_sha256_prefix":"f33359b7e60c47c1","mcp_get_code":{"code_sha256":"f33359b7e60c47c1"}},{"arxiv_id":"1605.04460","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-damped-lyman-absorbers-with","title":"Detecting Damped Lyman-$α$ Absorbers with Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2016-05","title_source":"archive","repo":"rmgarnett/gp_dla_detection","path":"CDDF_analysis/voigt.py","file_url":"https://github.com/rmgarnett/gp_dla_detection/blob/HEAD/CDDF_analysis/voigt.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":"a57bc207f6ddcefd","code_sha256_prefix":"a57bc207f6ddcefd","mcp_get_code":{"code_sha256":"a57bc207f6ddcefd"}}],"record_sha256":"6861ce955ebba361410b633843deaff06bec0062562fcc45f1501c0e406b883f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}