{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G2HA7ENDSMUKT7IOFEFMT23K7A","short_pith_number":"pith:G2HA7END","schema_version":"1.0","canonical_sha256":"368e0f91a39328a9fd0e290ac9eb6af81954a43f5e15cfc438b88af5c25df3d8","source":{"kind":"arxiv","id":"1612.02875","version":2},"attestation_state":"computed","paper":{"title":"A Divide and Conquer Strategy for High Dimensional Bayesian Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Barbara Engelhardt, Debdeep Pati, Gautam Sabnis, Natesh Pillai","submitted_at":"2016-12-09T00:42:47Z","abstract_excerpt":"We propose a distributed computing framework, based on a divide and conquer strategy and hierarchical modeling, to accelerate posterior inference for high-dimensional Bayesian factor models. Our approach distributes the task of high-dimensional covariance matrix estimation to multiple cores, solves each subproblem separately via a latent factor model, and then combines these estimates to produce a global estimate of the covariance matrix. Existing divide and conquer methods focus exclusively on dividing the total number of observations $n$ into subsamples while keeping the dimension $p$ fixed."},"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":"1612.02875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-09T00:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"ed8ade40c940d16e2b4b8c8590762092ee36d61152bf9f1c9e9989051a1bcc94","abstract_canon_sha256":"0e75472703d61acdb6219cc6a9551bcf4e734470ae54a78c9b7380ffcf7f643e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:47.508895Z","signature_b64":"/LHi3UcUgnU60/eVSDYXW7lVcuCy/Tvn4/VLa4dSUFhXEb/sjK+7qaI0OfbUqRAzfFJWkHR9XksGAIFhTHS+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368e0f91a39328a9fd0e290ac9eb6af81954a43f5e15cfc438b88af5c25df3d8","last_reissued_at":"2026-05-18T00:53:47.508516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:47.508516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Divide and Conquer Strategy for High Dimensional Bayesian Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Barbara Engelhardt, Debdeep Pati, Gautam Sabnis, Natesh Pillai","submitted_at":"2016-12-09T00:42:47Z","abstract_excerpt":"We propose a distributed computing framework, based on a divide and conquer strategy and hierarchical modeling, to accelerate posterior inference for high-dimensional Bayesian factor models. Our approach distributes the task of high-dimensional covariance matrix estimation to multiple cores, solves each subproblem separately via a latent factor model, and then combines these estimates to produce a global estimate of the covariance matrix. Existing divide and conquer methods focus exclusively on dividing the total number of observations $n$ into subsamples while keeping the dimension $p$ fixed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02875","kind":"arxiv","version":2},"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":"1612.02875","created_at":"2026-05-18T00:53:47.508574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02875v2","created_at":"2026-05-18T00:53:47.508574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02875","created_at":"2026-05-18T00:53:47.508574+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2HA7ENDSMUK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2HA7ENDSMUKT7IO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2HA7END","created_at":"2026-05-18T12:30:15.759754+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/G2HA7ENDSMUKT7IOFEFMT23K7A","json":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A.json","graph_json":"https://pith.science/api/pith-number/G2HA7ENDSMUKT7IOFEFMT23K7A/graph.json","events_json":"https://pith.science/api/pith-number/G2HA7ENDSMUKT7IOFEFMT23K7A/events.json","paper":"https://pith.science/paper/G2HA7END"},"agent_actions":{"view_html":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A","download_json":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A.json","view_paper":"https://pith.science/paper/G2HA7END","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02875&json=true","fetch_graph":"https://pith.science/api/pith-number/G2HA7ENDSMUKT7IOFEFMT23K7A/graph.json","fetch_events":"https://pith.science/api/pith-number/G2HA7ENDSMUKT7IOFEFMT23K7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A/action/storage_attestation","attest_author":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A/action/author_attestation","sign_citation":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A/action/citation_signature","submit_replication":"https://pith.science/pith/G2HA7ENDSMUKT7IOFEFMT23K7A/action/replication_record"}},"created_at":"2026-05-18T00:53:47.508574+00:00","updated_at":"2026-05-18T00:53:47.508574+00:00"}