{"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/covariance","entry":"covariance","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":9,"n_places_pointer_only":0,"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":3,"ran_fixture":0,"ran":4,"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":"2401.05064","arxiv_id_is_arxiv":true,"paper":"/paper/singer-identity-representation-learning-using-1","title":"Singer Identity Representation Learning using Self-Supervised Techniques","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SonyCSLParis/ssl-singer-identity","path":"singer_identity/losses.py","file_url":"https://github.com/SonyCSLParis/ssl-singer-identity/blob/HEAD/singer_identity/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b932b18b287d638","code_sha256_prefix":"3b932b18b287d638","mcp_get_code":{"code_sha256":"3b932b18b287d638"}},{"arxiv_id":"2308.09942","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-robustness-of-open-world-test-time","title":"On the Robustness of Open-World Test-Time Training: Self-Training with Dynamic Prototype Expansion","date":"2023-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushu-li/owttt","path":"imagenet/utils/offline.py","file_url":"https://github.com/yushu-li/owttt/blob/HEAD/imagenet/utils/offline.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":"f872e8da97313523","code_sha256_prefix":"f872e8da97313523","mcp_get_code":{"code_sha256":"f872e8da97313523"}},{"arxiv_id":"2302.02004","arxiv_id_is_arxiv":true,"paper":"/paper/koopman-operator-learning-sharp-spectral","title":"Sharp Spectral Rates for Koopman Operator Learning","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Machine-Learning-Dynamical-Systems/kooplearn","path":"src/kooplearn/_linalg.py","file_url":"https://github.com/Machine-Learning-Dynamical-Systems/kooplearn/blob/HEAD/src/kooplearn/_linalg.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":"29532cdf3f0299d4","code_sha256_prefix":"29532cdf3f0299d4","mcp_get_code":{"code_sha256":"29532cdf3f0299d4"}},{"arxiv_id":"2211.06678","arxiv_id_is_arxiv":true,"paper":"/paper/learning-dynamical-systems-an-example-from","title":"Learning dynamical systems: an example from open quantum system dynamics","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSML-IIT-UCL/kooplearn","path":"src/kooplearn/_linalg.py","file_url":"https://github.com/CSML-IIT-UCL/kooplearn/blob/HEAD/src/kooplearn/_linalg.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":"29532cdf3f0299d4","code_sha256_prefix":"29532cdf3f0299d4","mcp_get_code":{"code_sha256":"29532cdf3f0299d4"}},{"arxiv_id":"2209.10677","arxiv_id_is_arxiv":true,"paper":"/paper/nashae-disentangling-representations-through","title":"NashAE: Disentangling Representations through Adversarial Covariance Minimization","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericyeats/nashae-beamsynthesis","path":"ae_utils_exp.py","file_url":"https://github.com/ericyeats/nashae-beamsynthesis/blob/HEAD/ae_utils_exp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7509d4176014cc1","code_sha256_prefix":"d7509d4176014cc1","mcp_get_code":{"code_sha256":"d7509d4176014cc1"}},{"arxiv_id":"2206.02721","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-realistic-test-time-training","title":"Revisiting Realistic Test-Time Training: Sequential Inference and Adaptation by Anchored Clustering","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/TTAC","path":"cifar/discrepancy.py","file_url":"https://github.com/Gorilla-Lab-SCUT/TTAC/blob/HEAD/cifar/discrepancy.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":"f872e8da97313523","code_sha256_prefix":"f872e8da97313523","mcp_get_code":{"code_sha256":"f872e8da97313523"}},{"arxiv_id":"2008.01998","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-variance-control-of-the-score","title":"Optimal Variance Control of the Score Function Gradient Estimator for Importance Weighted Bounds","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlievin/ovis","path":"ovis/analysis/utils.py","file_url":"https://github.com/vlievin/ovis/blob/HEAD/ovis/analysis/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":"f6b66fec0aad6e85","code_sha256_prefix":"f6b66fec0aad6e85","mcp_get_code":{"code_sha256":"f6b66fec0aad6e85"}},{"arxiv_id":"2007.08216","arxiv_id_is_arxiv":true,"paper":"/paper/graph-topology-inference-benchmarks-for","title":"Graph topology inference benchmarks for machine learning","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cadurosar/benchmark_graphinference","path":"generate_graph.py","file_url":"https://github.com/cadurosar/benchmark_graphinference/blob/HEAD/generate_graph.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":"2e949edefabbe743","code_sha256_prefix":"2e949edefabbe743","mcp_get_code":{"code_sha256":"2e949edefabbe743"}},{"arxiv_id":"1607.01719","arxiv_id_is_arxiv":true,"paper":"/paper/deep-coral-correlation-alignment-for-deep","title":"Deep CORAL: Correlation Alignment for Deep Domain Adaptation","date":"2016-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevinmusgrave/pytorch-adapt","path":"src/pytorch_adapt/layers/coral_loss.py","file_url":"https://github.com/kevinmusgrave/pytorch-adapt/blob/HEAD/src/pytorch_adapt/layers/coral_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e5d22eb6001e5ea","code_sha256_prefix":"9e5d22eb6001e5ea","mcp_get_code":{"code_sha256":"9e5d22eb6001e5ea"}}],"record_sha256":"0e117b60ddfac4ecf7158703d83ac551e8f5ff1c994fb0dc29cfbda4beefa8fc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}