{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5CUFHHH3EIFX63RDP2HNM4BYIB","short_pith_number":"pith:5CUFHHH3","canonical_record":{"source":{"id":"1711.00946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T21:30:00Z","cross_cats_sorted":["cs.SY","math.OC","stat.ML"],"title_canon_sha256":"7630b86c9b79ba246e82d3f61311395372546d37a8611729c9aa173667dd48cd","abstract_canon_sha256":"35c74c0308b121ef82bd24ca17149a3fe647a5df1520bbac7d112ee2cd91b2d2"},"schema_version":"1.0"},"canonical_sha256":"e8a8539cfb220b7f6e237e8ed67038407f3798b2f1641ab00166c5c8d6fe0bc3","source":{"kind":"arxiv","id":"1711.00946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00946","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00946v1","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00946","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"5CUFHHH3EIFX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CUFHHH3EIFX63RD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CUFHHH3","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5CUFHHH3EIFX63RDP2HNM4BYIB","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T21:30:00Z","cross_cats_sorted":["cs.SY","math.OC","stat.ML"],"title_canon_sha256":"7630b86c9b79ba246e82d3f61311395372546d37a8611729c9aa173667dd48cd","abstract_canon_sha256":"35c74c0308b121ef82bd24ca17149a3fe647a5df1520bbac7d112ee2cd91b2d2"},"schema_version":"1.0"},"canonical_sha256":"e8a8539cfb220b7f6e237e8ed67038407f3798b2f1641ab00166c5c8d6fe0bc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:11.044447Z","signature_b64":"W8M+ySv0DUiRiCxrvN+jOh8U/lqlGr9QOOtnZ5I05m4fU/pni6ukGXcmeKaEwDwOPvvUucIc684Bmokzg+E8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a8539cfb220b7f6e237e8ed67038407f3798b2f1641ab00166c5c8d6fe0bc3","last_reissued_at":"2026-05-18T00:31:11.043669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:11.043669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00946","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-18T00:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3C17I3gwl8IC2+UA77yvPuQjVzXnI5LlUa+52MfRMKs7n239lcfKVvr1vkRiRoq0DdjeFKpLPKMJVSjI3/rfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:12:59.598962Z"},"content_sha256":"ef9f407e32b10d79d119e6028a121a5d311c3af4eb7eda5f78f77f75cdc5fb77","schema_version":"1.0","event_id":"sha256:ef9f407e32b10d79d119e6028a121a5d311c3af4eb7eda5f78f77f75cdc5fb77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5CUFHHH3EIFX63RDP2HNM4BYIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Linear Dynamical Systems via Spectral Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","submitted_at":"2017-11-02T21:30:00Z","abstract_excerpt":"We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for convexity of the loss functions. From this arises a polynomial-time algorithm with a near-optimal regret guarantee, with an analogous sample complexity bound for agnostic learning. Our algorithm is based on a novel filtering technique, which may be of independent interest: we convol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00946","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-18T00:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OiAacIkaplFdPA7AEsiUvdY4LhghURaBS36sO3f3uKp8Mul68BO3FCDdEzTzVoWfCgIonfGac0O6dm5tsOx9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:12:59.599379Z"},"content_sha256":"bfde7a245895141c740820d7a6a5a3f7ca1cd3f68da21e79c9036f4a6fd6142c","schema_version":"1.0","event_id":"sha256:bfde7a245895141c740820d7a6a5a3f7ca1cd3f68da21e79c9036f4a6fd6142c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/bundle.json","state_url":"https://pith.science/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/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-06-05T22:12:59Z","links":{"resolver":"https://pith.science/pith/5CUFHHH3EIFX63RDP2HNM4BYIB","bundle":"https://pith.science/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/bundle.json","state":"https://pith.science/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CUFHHH3EIFX63RDP2HNM4BYIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5CUFHHH3EIFX63RDP2HNM4BYIB","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":"35c74c0308b121ef82bd24ca17149a3fe647a5df1520bbac7d112ee2cd91b2d2","cross_cats_sorted":["cs.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T21:30:00Z","title_canon_sha256":"7630b86c9b79ba246e82d3f61311395372546d37a8611729c9aa173667dd48cd"},"schema_version":"1.0","source":{"id":"1711.00946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00946","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00946v1","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00946","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"5CUFHHH3EIFX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5CUFHHH3EIFX63RD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5CUFHHH3","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:bfde7a245895141c740820d7a6a5a3f7ca1cd3f68da21e79c9036f4a6fd6142c","target":"graph","created_at":"2026-05-18T00:31:11Z","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":"We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for convexity of the loss functions. From this arises a polynomial-time algorithm with a near-optimal regret guarantee, with an analogous sample complexity bound for agnostic learning. Our algorithm is based on a novel filtering technique, which may be of independent interest: we convol","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","cross_cats":["cs.SY","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T21:30:00Z","title":"Learning Linear Dynamical Systems via Spectral Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00946","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:ef9f407e32b10d79d119e6028a121a5d311c3af4eb7eda5f78f77f75cdc5fb77","target":"record","created_at":"2026-05-18T00:31:11Z","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":"35c74c0308b121ef82bd24ca17149a3fe647a5df1520bbac7d112ee2cd91b2d2","cross_cats_sorted":["cs.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T21:30:00Z","title_canon_sha256":"7630b86c9b79ba246e82d3f61311395372546d37a8611729c9aa173667dd48cd"},"schema_version":"1.0","source":{"id":"1711.00946","kind":"arxiv","version":1}},"canonical_sha256":"e8a8539cfb220b7f6e237e8ed67038407f3798b2f1641ab00166c5c8d6fe0bc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8a8539cfb220b7f6e237e8ed67038407f3798b2f1641ab00166c5c8d6fe0bc3","first_computed_at":"2026-05-18T00:31:11.043669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:11.043669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8M+ySv0DUiRiCxrvN+jOh8U/lqlGr9QOOtnZ5I05m4fU/pni6ukGXcmeKaEwDwOPvvUucIc684Bmokzg+E8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:11.044447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9f407e32b10d79d119e6028a121a5d311c3af4eb7eda5f78f77f75cdc5fb77","sha256:bfde7a245895141c740820d7a6a5a3f7ca1cd3f68da21e79c9036f4a6fd6142c"],"state_sha256":"a3a5b7cab74db9d9a2cdcdbed5514466ca705637e1b76d94e137079ab400b98f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13ES1aZbV56/tWORy9WOBAVonsgrKCWyURcUDJs8KmtnSYfZgG861sKnjSfsMWw/NUHnNyIbiMs/diWPCW0lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:12:59.602442Z","bundle_sha256":"dadc9fe6602bf77c4ac88793de7bf93f434597c1c2f4395452a3a54b7e14a058"}}