{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X3MR44NZ2BKS7J7MVIKZXAAL66","short_pith_number":"pith:X3MR44NZ","schema_version":"1.0","canonical_sha256":"bed91e71b9d0552fa7ecaa159b800bf7be9c59c3ef48f4ad1892b1e228ea4e7a","source":{"kind":"arxiv","id":"2606.06483","version":1},"attestation_state":"computed","paper":{"title":"Statistically and Computationally Optimal Estimation and Inference of Common Subspaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","math.SP","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Joshua Agterberg","submitted_at":"2026-06-04T17:58:14Z","abstract_excerpt":"Given multiple data matrices, many problems in statistics and data science rely on estimating a common subspace that captures certain structure shared by all the data matrices. In this paper we investigate the statistical and computational limits for the common subspace model in which one observes a collection of symmetric low-rank matrices perturbed by noise, where each low-rank matrix shares the same common subspace. Our main results identify several regimes of the signal-to-noise ratio (SNR) such that estimation and inference are statistically or computationally optimal, and we refer to the"},"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":"2606.06483","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-06-04T17:58:14Z","cross_cats_sorted":["math.OC","math.SP","stat.ME","stat.TH"],"title_canon_sha256":"4eb037bbf7599d8ff03f38e9db97cf0a8a677da3906a1064f6b7ed1a732c0952","abstract_canon_sha256":"77ae3ffccbbb65ec79e943009d2ec803812d61d3a0b7eed08918de2152ed9a8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:46.883032Z","signature_b64":"RAnthiPv1cOe2bAsNw5FEWXCOWd1xlgMtbkXhBz1SvBauPVu5TWFnwD+zu0seIKIy5WJ2qqFNWSlb93nk3hMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bed91e71b9d0552fa7ecaa159b800bf7be9c59c3ef48f4ad1892b1e228ea4e7a","last_reissued_at":"2026-06-05T01:15:46.882662Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:46.882662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistically and Computationally Optimal Estimation and Inference of Common Subspaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","math.SP","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Joshua Agterberg","submitted_at":"2026-06-04T17:58:14Z","abstract_excerpt":"Given multiple data matrices, many problems in statistics and data science rely on estimating a common subspace that captures certain structure shared by all the data matrices. In this paper we investigate the statistical and computational limits for the common subspace model in which one observes a collection of symmetric low-rank matrices perturbed by noise, where each low-rank matrix shares the same common subspace. Our main results identify several regimes of the signal-to-noise ratio (SNR) such that estimation and inference are statistically or computationally optimal, and we refer to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06483","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.06483/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.06483","created_at":"2026-06-05T01:15:46.882724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06483v1","created_at":"2026-06-05T01:15:46.882724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06483","created_at":"2026-06-05T01:15:46.882724+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3MR44NZ2BKS","created_at":"2026-06-05T01:15:46.882724+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3MR44NZ2BKS7J7M","created_at":"2026-06-05T01:15:46.882724+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3MR44NZ","created_at":"2026-06-05T01:15:46.882724+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/X3MR44NZ2BKS7J7MVIKZXAAL66","json":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66.json","graph_json":"https://pith.science/api/pith-number/X3MR44NZ2BKS7J7MVIKZXAAL66/graph.json","events_json":"https://pith.science/api/pith-number/X3MR44NZ2BKS7J7MVIKZXAAL66/events.json","paper":"https://pith.science/paper/X3MR44NZ"},"agent_actions":{"view_html":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66","download_json":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66.json","view_paper":"https://pith.science/paper/X3MR44NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06483&json=true","fetch_graph":"https://pith.science/api/pith-number/X3MR44NZ2BKS7J7MVIKZXAAL66/graph.json","fetch_events":"https://pith.science/api/pith-number/X3MR44NZ2BKS7J7MVIKZXAAL66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66/action/storage_attestation","attest_author":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66/action/author_attestation","sign_citation":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66/action/citation_signature","submit_replication":"https://pith.science/pith/X3MR44NZ2BKS7J7MVIKZXAAL66/action/replication_record"}},"created_at":"2026-06-05T01:15:46.882724+00:00","updated_at":"2026-06-05T01:15:46.882724+00:00"}