{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q4O2LY3YF7ULADN7UWPHWIF7T5","short_pith_number":"pith:Q4O2LY3Y","schema_version":"1.0","canonical_sha256":"871da5e3782fe8b00dbfa59e7b20bf9f6af704646b24a929705bc7e3cabaa93b","source":{"kind":"arxiv","id":"2303.14851","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Subspace Estimation with Grassmannian Geodesics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"eess.SP","authors_text":"Cameron J. Blocker, Haroon Raja, Jeffrey A. Fessler, Laura Balzano","submitted_at":"2023-03-26T23:32:09Z","abstract_excerpt":"Dynamic subspace estimation, or subspace tracking, is a fundamental problem in statistical signal processing and machine learning. This paper considers a geodesic model for time-varying subspaces. The natural objective function for this model is non-convex. We propose a novel algorithm for minimizing this objective and estimating the parameters of the model from data with Grassmannian-constrained optimization. We show that with this algorithm, the objective is monotonically non-increasing. We demonstrate the performance of this model and our algorithm on synthetic data, video data, and dynamic"},"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":"2303.14851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2023-03-26T23:32:09Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"d794ce96726813a3313db32b543cf664b897cae5159e2b53e02e9d9460b92150","abstract_canon_sha256":"021717af628727abb7499c68808612b4bedd6773374ca70258c3abff5aad98bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:46.925707Z","signature_b64":"p5/5W1vhx54tQ/PR8Cqu7CBz3M7qlXm4Gi7LFPq7ZiMf77Wl8YZ7tOb/WEUosGe2urEXgMbeSMElGlpPVz+JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"871da5e3782fe8b00dbfa59e7b20bf9f6af704646b24a929705bc7e3cabaa93b","last_reissued_at":"2026-07-05T05:54:46.925198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:46.925198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Subspace Estimation with Grassmannian Geodesics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"eess.SP","authors_text":"Cameron J. Blocker, Haroon Raja, Jeffrey A. Fessler, Laura Balzano","submitted_at":"2023-03-26T23:32:09Z","abstract_excerpt":"Dynamic subspace estimation, or subspace tracking, is a fundamental problem in statistical signal processing and machine learning. This paper considers a geodesic model for time-varying subspaces. The natural objective function for this model is non-convex. We propose a novel algorithm for minimizing this objective and estimating the parameters of the model from data with Grassmannian-constrained optimization. We show that with this algorithm, the objective is monotonically non-increasing. We demonstrate the performance of this model and our algorithm on synthetic data, video data, and dynamic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14851","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/2303.14851/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":"2303.14851","created_at":"2026-07-05T05:54:46.925255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.14851v1","created_at":"2026-07-05T05:54:46.925255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14851","created_at":"2026-07-05T05:54:46.925255+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4O2LY3YF7UL","created_at":"2026-07-05T05:54:46.925255+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4O2LY3YF7ULADN7","created_at":"2026-07-05T05:54:46.925255+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4O2LY3Y","created_at":"2026-07-05T05:54:46.925255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26025","citing_title":"A Dynamic Subspace Approach for Low-rank Approximation of Large-scale Nonlinear Systems","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5","json":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5.json","graph_json":"https://pith.science/api/pith-number/Q4O2LY3YF7ULADN7UWPHWIF7T5/graph.json","events_json":"https://pith.science/api/pith-number/Q4O2LY3YF7ULADN7UWPHWIF7T5/events.json","paper":"https://pith.science/paper/Q4O2LY3Y"},"agent_actions":{"view_html":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5","download_json":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5.json","view_paper":"https://pith.science/paper/Q4O2LY3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.14851&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4O2LY3YF7ULADN7UWPHWIF7T5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4O2LY3YF7ULADN7UWPHWIF7T5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5/action/storage_attestation","attest_author":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5/action/author_attestation","sign_citation":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5/action/citation_signature","submit_replication":"https://pith.science/pith/Q4O2LY3YF7ULADN7UWPHWIF7T5/action/replication_record"}},"created_at":"2026-07-05T05:54:46.925255+00:00","updated_at":"2026-07-05T05:54:46.925255+00:00"}