{"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":"/paper/beyond-task-diversity-provable-representation","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","arxiv_id":"2501.13390","date":"2025-01-23","proceeding":null,"authors":["Thang Duong","Zhi Wang","Chicheng Zhang"],"abstract":"We study lifelong learning in linear bandits, where a learner interacts with a sequence of linear bandit tasks whose parameters lie in an $m$-dimensional subspace of $\\mathbb{R}^d$, thereby sharing a low-rank representation. Current literature typically assumes that the tasks are diverse, i.e., their parameters uniformly span the $m$-dimensional subspace. This assumption allows the low-rank representation to be learned before all tasks are revealed, which can be unrealistic in real-world applications. In this work, we present the first nontrivial result for sequential multi-task linear bandits without the task diversity assumption. We develop an algorithm that efficiently learns and transfers low-rank representations. When facing $N$ tasks, each played over $\\tau$ rounds, our algorithm achieves a regret guarantee of $\\tilde{O}\\big (Nm \\sqrt{\\tau} + N^{\\frac{2}{3}} \\tau^{\\frac{2}{3}} d m^{\\frac13} + Nd^2 + \\tau m d \\big)$ under the ellipsoid action set assumption. This result can significantly improve upon the baseline of $\\tilde{O} \\left (Nd \\sqrt{\\tau}\\right)$ that does not leverage the low-rank structure when the number of tasks $N$ is sufficiently large and $m \\ll d$. We also demonstrate empirically on synthetic data that our algorithm outperforms baseline algorithms, which rely on the task diversity assumption.","url_abs":"https://arxiv.org/abs/2501.13390v1","url_pdf":"https://arxiv.org/pdf/2501.13390v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"beyond-task-diversity-provable-representation","repo_url":"https://github.com/duongnhatthang/BOSS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"lifelong-learning","task_name":"Lifelong learning"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2501.13390","atlas_url":"https://app.syntology.ai/?focus=2501.13390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13390"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2501.13390"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2501.13390"},"call":"get_harvested_code_for_paper(arxiv_id=\"2501.13390\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2501.13390"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2501.13390\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2501.13390"},"call":"get_concepts_for_paper(arxiv_id=\"2501.13390\")"}],"by_repo":[{"repo":"duongnhatthang/BOSS","kind":"official","samples":13,"ran":11,"instrument":7,"unverified":2}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"881aa5b906735f3a","source_kind":"harvested","method_name":"algorithm for sequential multitask linear bandits","realizes_method":"algorithm for sequential multitask linear bandits","graph_method":"algorithm for sequential multitask linear bandits","realizes_severed":false,"claim":"Implements a sequential multitask linear bandits algorithm using Warmuth's Uncentered Online PCA for subspace estimation to transfer representations across tasks.","centrality":"contribution","entry":"BRESS","entry_sha256":"028b1cf6e8c24f57","n_bricks":12,"bricks":[{"entry":"BRESS","code_sha256":"028b1cf6e8c24f57","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"BOSS_protocol","code_sha256":"b7d10b994438c1e7","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"PEGE","code_sha256":"b83462773d18ce64","role":"helper","order":2,"level":1,"status":"ran"},{"entry":"UncenteredOnlinePCA","code_sha256":"e7d62a6a5165c21c","role":"model","order":3,"level":0,"status":"unverified"},{"entry":"round","code_sha256":"b252b4c7aaa80382","role":"helper","order":4,"level":1,"status":"ran_violates"},{"entry":"sherman_morrison","code_sha256":"160fb54f95fd616c","role":"helper","order":5,"level":1,"status":"ran_fixture"},{"entry":"OnlinePCAState","code_sha256":"74b57a8133d15869","role":"helper","order":6,"level":1,"status":"ran"},{"entry":"matrix_capping","code_sha256":"7c3cf77397eaa4ef","role":"helper","order":7,"level":1,"status":"ran_fixture"},{"entry":"matrix_mixture_decomposition","code_sha256":"c4f8605400501906","role":"helper","order":8,"level":1,"status":"ran_fixture"},{"entry":"algorithm4_capping","code_sha256":"57f078b979f64545","role":"helper","order":9,"level":1,"status":"ran_fixture"},{"entry":"algorithm2_mixture_decomposition","code_sha256":"f4955a7f2e405c56","role":"helper","order":10,"level":1,"status":"ran_fixture"},{"entry":"mixture_decomposition","code_sha256":"91ce37d94ab22d45","role":"helper","order":11,"level":1,"status":"ran_fixture"}],"ran_individually":10,"ran_individually_constructed":3,"ran_individually_by_status":{"ran":3,"ran_fixture":6,"ran_violates":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"2c900765baa3","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"2c900765baa3","realizes_method":"algorithm for sequential multitask linear bandits","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["881aa5b906735f3a"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2501.13390"},"call":"assembly(arxiv_id=\"2501.13390\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2501.13390.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2501.13390.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/duongnhatthang/BOSS","reach":null}],"summary":{"ran":3,"ran_fixture":7,"ran_violates":1,"unverified":2},"n_samples":13,"n_ran":11,"n_constructed":3,"n_ran_checked":4,"n_instrument":7,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":13,"ran":11,"n_ran_checked":4,"n_instrument":7,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":8,"n_ran_without_level_date":3,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"b7d10b994438c1e7","code_sha256_prefix":"b7d10b994438c1e7","entry":"BOSS_protocol","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"BOSS_protocol","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b7d10b994438c1e7"}},{"code_sha256":"74b57a8133d15869","code_sha256_prefix":"74b57a8133d15869","entry":"OnlinePCAState","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"OnlinePCAState","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"74b57a8133d15869"}},{"code_sha256":"b83462773d18ce64","code_sha256_prefix":"b83462773d18ce64","entry":"PEGE","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"PEGE","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b83462773d18ce64"}},{"code_sha256":"f4955a7f2e405c56","code_sha256_prefix":"f4955a7f2e405c56","entry":"algorithm2_mixture_decomposition","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"w:ndarray/1/float, d:int/0/int, rng:Generator/0/?","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f4955a7f2e405c56"}},{"code_sha256":"57f078b979f64545","code_sha256_prefix":"57f078b979f64545","entry":"algorithm4_capping","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"w:ndarray/1/float, d:int/0/int, tol:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"57f078b979f64545"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"57f078b979f64545"}},{"code_sha256":"bca3c405350105f4","code_sha256_prefix":"bca3c405350105f4","entry":"gen_params","repo":"duongnhatthang/boss","repo_kind":"official","path":"evaluation.py","file_url":"https://github.com/duongnhatthang/boss/blob/HEAD/evaluation.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"B:ndarray/2/float, input_dict:dict/0/?, task_idx:int/0/int, n_revealed:int/0/int","fixture_out_type":"tuple","code_page":"/code/gen-params","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bca3c405350105f4"}},{"code_sha256":"7c3cf77397eaa4ef","code_sha256_prefix":"7c3cf77397eaa4ef","entry":"matrix_capping","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"W:ndarray/2/float, d:int/0/int, tol:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7c3cf77397eaa4ef"}},{"code_sha256":"c4f8605400501906","code_sha256_prefix":"c4f8605400501906","entry":"matrix_mixture_decomposition","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"W:ndarray/2/float, d:int/0/int, rng:Generator/0/?","fixture_out_type":"ndarray","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c4f8605400501906"}},{"code_sha256":"91ce37d94ab22d45","code_sha256_prefix":"91ce37d94ab22d45","entry":"mixture_decomposition","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"w:ndarray/1/float, d:int/0/int, tol:float/0/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"91ce37d94ab22d45"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"91ce37d94ab22d45"}},{"code_sha256":"b252b4c7aaa80382","code_sha256_prefix":"b252b4c7aaa80382","entry":"round","repo":"duongnhatthang/boss","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/boss/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"X:ndarray/1/float, precision:float/0/float","fixture_out_type":"ndarray","retrieve_with":{"tool":"get_code","code_sha256":"b252b4c7aaa80382"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b252b4c7aaa80382"}},{"code_sha256":"160fb54f95fd616c","code_sha256_prefix":"160fb54f95fd616c","entry":"sherman_morrison","repo":"duongnhatthang/boss","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/boss/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"X:ndarray/1/float, V:ndarray/2/float, w:float/0/float","fixture_out_type":"ndarray","retrieve_with":{"tool":"get_code","code_sha256":"160fb54f95fd616c"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"160fb54f95fd616c"}},{"code_sha256":"028b1cf6e8c24f57","code_sha256_prefix":"028b1cf6e8c24f57","entry":"BRESS","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"028b1cf6e8c24f57"}},{"code_sha256":"e7d62a6a5165c21c","code_sha256_prefix":"e7d62a6a5165c21c","entry":"UncenteredOnlinePCA","repo":"duongnhatthang/BOSS","repo_kind":"official","path":"model.py","file_url":"https://github.com/duongnhatthang/BOSS/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e7d62a6a5165c21c"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f0030d2ff7a7afaed546ffef0e199421715aaf8eadd174731a2b4181a245bd18","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}