{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F4JYBATAUIH6JNDXPNEFCGY24H","short_pith_number":"pith:F4JYBATA","schema_version":"1.0","canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","source":{"kind":"arxiv","id":"1312.2132","version":1},"attestation_state":"computed","paper":{"title":"Robust Subspace System Identification via Weighted Nuclear Norm Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SY","authors_text":"Dorsa Sadigh, Henrik Ohlsson, Sanjit A. Seshia, S. Shankar Sastry","submitted_at":"2013-12-07T19:19:03Z","abstract_excerpt":"Subspace identification is a classical and very well studied problem in system identification. The problem was recently posed as a convex optimization problem via the nuclear norm relaxation. Inspired by robust PCA, we extend this framework to handle outliers. The proposed framework takes the form of a convex optimization problem with an objective that trades off fit, rank and sparsity. As in robust PCA, it can be problematic to find a suitable regularization parameter. We show how the space in which a suitable parameter should be sought can be limited to a bounded open set of the two dimensio"},"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":"1312.2132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-07T19:19:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"75e31504776fb0eba894db7b15eb2209dc99bcc2a1f4a2e633d8660d6fc963a2","abstract_canon_sha256":"962098def8547acb89d7a2c752987021d600c1d53b486e8481009efa20e3fc6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:17.172990Z","signature_b64":"Vn3bi2YfJgNz0fEjaMmInmYb3vkmzRlb5V/bvKHcaDqnS9d1nG1MTyk6FXJbbQk7nQpEMFgtM2B+uAkTY3cnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","last_reissued_at":"2026-05-18T03:05:17.172492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:17.172492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Subspace System Identification via Weighted Nuclear Norm Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SY","authors_text":"Dorsa Sadigh, Henrik Ohlsson, Sanjit A. Seshia, S. Shankar Sastry","submitted_at":"2013-12-07T19:19:03Z","abstract_excerpt":"Subspace identification is a classical and very well studied problem in system identification. The problem was recently posed as a convex optimization problem via the nuclear norm relaxation. Inspired by robust PCA, we extend this framework to handle outliers. The proposed framework takes the form of a convex optimization problem with an objective that trades off fit, rank and sparsity. As in robust PCA, it can be problematic to find a suitable regularization parameter. We show how the space in which a suitable parameter should be sought can be limited to a bounded open set of the two dimensio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2132","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":"1312.2132","created_at":"2026-05-18T03:05:17.172568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2132v1","created_at":"2026-05-18T03:05:17.172568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2132","created_at":"2026-05-18T03:05:17.172568+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4JYBATAUIH6","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4JYBATAUIH6JNDX","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4JYBATA","created_at":"2026-05-18T12:27:43.054852+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/F4JYBATAUIH6JNDXPNEFCGY24H","json":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H.json","graph_json":"https://pith.science/api/pith-number/F4JYBATAUIH6JNDXPNEFCGY24H/graph.json","events_json":"https://pith.science/api/pith-number/F4JYBATAUIH6JNDXPNEFCGY24H/events.json","paper":"https://pith.science/paper/F4JYBATA"},"agent_actions":{"view_html":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H","download_json":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H.json","view_paper":"https://pith.science/paper/F4JYBATA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2132&json=true","fetch_graph":"https://pith.science/api/pith-number/F4JYBATAUIH6JNDXPNEFCGY24H/graph.json","fetch_events":"https://pith.science/api/pith-number/F4JYBATAUIH6JNDXPNEFCGY24H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/action/storage_attestation","attest_author":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/action/author_attestation","sign_citation":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/action/citation_signature","submit_replication":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/action/replication_record"}},"created_at":"2026-05-18T03:05:17.172568+00:00","updated_at":"2026-05-18T03:05:17.172568+00:00"}