{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3LCCX2R42LUBJJPWBZESU7XSVQ","short_pith_number":"pith:3LCCX2R4","schema_version":"1.0","canonical_sha256":"dac42bea3cd2e814a5f60e492a7ef2ac110578b6ac11ffd28dddf90d74ec2e76","source":{"kind":"arxiv","id":"1803.04431","version":1},"attestation_state":"computed","paper":{"title":"Scalable Algorithms for Learning High-Dimensional Linear Mixed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kimberly Roche, Sayan Mukherjee, Xiang Zhou, Zilong Tan","submitted_at":"2018-03-12T18:07:40Z","abstract_excerpt":"Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data. State-of-the-art learning algorithms require computational complexity which depends at least linearly on the dimension $p$ of the covariates, and often use heuristics that do not offer theoretical guarantees. We present scalable algorithms for learning high-dimensional LMMs with sublinear computational complexity dependence on $p$. Key to our approach are novel "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.04431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-12T18:07:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af791ffbec2d510f6f654d05f7bfecacd2a520f7989831be99fdb8bbc520c8a9","abstract_canon_sha256":"b180a7b82c3e76deb544f7cc5d385b919c75d3b91616650d4a1a8257559d9177"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:54.685961Z","signature_b64":"Pvn86vnJBjqhpToYJjEuuEvnXt+fhL9mjxqs+MHqt+lGxCDPrZifHbIWfMfvF0Vaw6ysleerHCA1UdtcS1HKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac42bea3cd2e814a5f60e492a7ef2ac110578b6ac11ffd28dddf90d74ec2e76","last_reissued_at":"2026-05-17T23:51:54.685497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:54.685497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Algorithms for Learning High-Dimensional Linear Mixed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kimberly Roche, Sayan Mukherjee, Xiang Zhou, Zilong Tan","submitted_at":"2018-03-12T18:07:40Z","abstract_excerpt":"Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data. State-of-the-art learning algorithms require computational complexity which depends at least linearly on the dimension $p$ of the covariates, and often use heuristics that do not offer theoretical guarantees. We present scalable algorithms for learning high-dimensional LMMs with sublinear computational complexity dependence on $p$. Key to our approach are novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04431","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.04431","created_at":"2026-05-17T23:51:54.685564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04431v1","created_at":"2026-05-17T23:51:54.685564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04431","created_at":"2026-05-17T23:51:54.685564+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LCCX2R42LUB","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LCCX2R42LUBJJPW","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LCCX2R4","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ","json":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ.json","graph_json":"https://pith.science/api/pith-number/3LCCX2R42LUBJJPWBZESU7XSVQ/graph.json","events_json":"https://pith.science/api/pith-number/3LCCX2R42LUBJJPWBZESU7XSVQ/events.json","paper":"https://pith.science/paper/3LCCX2R4"},"agent_actions":{"view_html":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ","download_json":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ.json","view_paper":"https://pith.science/paper/3LCCX2R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04431&json=true","fetch_graph":"https://pith.science/api/pith-number/3LCCX2R42LUBJJPWBZESU7XSVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3LCCX2R42LUBJJPWBZESU7XSVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ/action/storage_attestation","attest_author":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ/action/author_attestation","sign_citation":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ/action/citation_signature","submit_replication":"https://pith.science/pith/3LCCX2R42LUBJJPWBZESU7XSVQ/action/replication_record"}},"created_at":"2026-05-17T23:51:54.685564+00:00","updated_at":"2026-05-17T23:51:54.685564+00:00"}