{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F4JYBATAUIH6JNDXPNEFCGY24H","short_pith_number":"pith:F4JYBATA","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"},"canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","source":{"kind":"arxiv","id":"1312.2132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2132","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2132v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2132","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"F4JYBATAUIH6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4JYBATAUIH6JNDX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4JYBATA","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F4JYBATAUIH6JNDXPNEFCGY24H","target":"record","payload":{"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"},"canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","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"},"source_kind":"arxiv","source_id":"1312.2132","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FqZ+TYvxM2iNffb02+8PG2JZ1HSV3IZGpX8JnpsWkPK8cWvNle7HLq/K2jiFeq7CdWCebEYIJn1+sW4EwfdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:08.202663Z"},"content_sha256":"f99796e626b2579c94e28ca6535fa2d9524462bbfab3b60b7ab71598a6eb7653","schema_version":"1.0","event_id":"sha256:f99796e626b2579c94e28ca6535fa2d9524462bbfab3b60b7ab71598a6eb7653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F4JYBATAUIH6JNDXPNEFCGY24H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5cm3BCFfCN0fwTR4k3thAj45kETn4JtvzUDRVH1IIHGkORL0MJ6l09q3I8fw8CP0s65+IwupzIkhOjNMGkUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:08.203327Z"},"content_sha256":"849c513ac37dc90736c040fee9c302327e4668144fe8d19f8824a870ba3d39f7","schema_version":"1.0","event_id":"sha256:849c513ac37dc90736c040fee9c302327e4668144fe8d19f8824a870ba3d39f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/bundle.json","state_url":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4JYBATAUIH6JNDXPNEFCGY24H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T07:36:08Z","links":{"resolver":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H","bundle":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/bundle.json","state":"https://pith.science/pith/F4JYBATAUIH6JNDXPNEFCGY24H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4JYBATAUIH6JNDXPNEFCGY24H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F4JYBATAUIH6JNDXPNEFCGY24H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"962098def8547acb89d7a2c752987021d600c1d53b486e8481009efa20e3fc6b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-07T19:19:03Z","title_canon_sha256":"75e31504776fb0eba894db7b15eb2209dc99bcc2a1f4a2e633d8660d6fc963a2"},"schema_version":"1.0","source":{"id":"1312.2132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2132","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2132v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2132","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"F4JYBATAUIH6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4JYBATAUIH6JNDX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4JYBATA","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:849c513ac37dc90736c040fee9c302327e4668144fe8d19f8824a870ba3d39f7","target":"graph","created_at":"2026-05-18T03:05:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dorsa Sadigh, Henrik Ohlsson, Sanjit A. Seshia, S. Shankar Sastry","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-07T19:19:03Z","title":"Robust Subspace System Identification via Weighted Nuclear Norm Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2132","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f99796e626b2579c94e28ca6535fa2d9524462bbfab3b60b7ab71598a6eb7653","target":"record","created_at":"2026-05-18T03:05:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"962098def8547acb89d7a2c752987021d600c1d53b486e8481009efa20e3fc6b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-07T19:19:03Z","title_canon_sha256":"75e31504776fb0eba894db7b15eb2209dc99bcc2a1f4a2e633d8660d6fc963a2"},"schema_version":"1.0","source":{"id":"1312.2132","kind":"arxiv","version":1}},"canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f13808260a20fe4b4777b48511b1ae1e39ff461eb0d8006d980409bf1f18408","first_computed_at":"2026-05-18T03:05:17.172492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:17.172492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vn3bi2YfJgNz0fEjaMmInmYb3vkmzRlb5V/bvKHcaDqnS9d1nG1MTyk6FXJbbQk7nQpEMFgtM2B+uAkTY3cnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:17.172990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f99796e626b2579c94e28ca6535fa2d9524462bbfab3b60b7ab71598a6eb7653","sha256:849c513ac37dc90736c040fee9c302327e4668144fe8d19f8824a870ba3d39f7"],"state_sha256":"28513e49e0c4e9f134eb83be1e9a4bccfdf7cd779c1d5dc64a86e33f313aef4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHpbdeSNA2Ez/UUbX/lTpOOj4EtlLOo+S4DC9QGJEIVRy/ytmRtYnbloQkuvsMsbWLErt+rTwQ7OAH2QTuR5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:36:08.206816Z","bundle_sha256":"fec9bd79f68fbb0528629ec7913fc60a9c607f778b48af611f50995c47a6d6d6"}}