{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BZCEU7UFFXNFZ6KIQTUJGANJMO","short_pith_number":"pith:BZCEU7UF","canonical_record":{"source":{"id":"1609.05191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-16T19:42:34Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"949ee3dd7b89b3ae84af7f6112ac5e90d45e34d69b50a895efc687f6dc2bd1ae","abstract_canon_sha256":"84c29959a4622362adfc28d1453d96a3905f508039eb4b9a15cfc4e95884435a"},"schema_version":"1.0"},"canonical_sha256":"0e444a7e852dda5cf94884e89301a963bb8c2430a973a73d8a9e3de3b5e05bd6","source":{"kind":"arxiv","id":"1609.05191","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05191","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05191v2","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05191","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"BZCEU7UFFXNF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZCEU7UFFXNFZ6KI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZCEU7UF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BZCEU7UFFXNFZ6KIQTUJGANJMO","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-16T19:42:34Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"949ee3dd7b89b3ae84af7f6112ac5e90d45e34d69b50a895efc687f6dc2bd1ae","abstract_canon_sha256":"84c29959a4622362adfc28d1453d96a3905f508039eb4b9a15cfc4e95884435a"},"schema_version":"1.0"},"canonical_sha256":"0e444a7e852dda5cf94884e89301a963bb8c2430a973a73d8a9e3de3b5e05bd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:27.013113Z","signature_b64":"LFRNKRp+hXUtHRjlhPI5wdfR7caALVr2s9lD3Ry2iqmIpSmRATqtqLgaUMT7l5pJG3FfbyAh9yXVH3A/cNIXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e444a7e852dda5cf94884e89301a963bb8c2430a973a73d8a9e3de3b5e05bd6","last_reissued_at":"2026-05-17T23:54:27.012499Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:27.012499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05191","source_version":2,"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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McuCT7I+TvBwpymmjvcpi5eYmL55uGpMwx1sXvF5qr2IgDWeIELDs9g1iHAb2QtN35zn89YG8pzNETYb6r09DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:09:07.144396Z"},"content_sha256":"d3c43ea6d6b5676749db36032873d540c9e596bfd0665aeb7371c18853896a6c","schema_version":"1.0","event_id":"sha256:d3c43ea6d6b5676749db36032873d540c9e596bfd0665aeb7371c18853896a6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BZCEU7UFFXNFZ6KIQTUJGANJMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Descent Learns Linear Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Recht, Moritz Hardt, Tengyu Ma","submitted_at":"2016-09-16T19:42:34Z","abstract_excerpt":"We prove that stochastic gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical system from a sequence of noisy observations generated by the system. Even though the objective function is non-convex, we provide polynomial running time and sample complexity bounds under strong but natural assumptions. Linear systems identification has been studied for many decades, yet, to the best of our knowledge, these are the first polynomial guarantees for the problem we consider."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05191","kind":"arxiv","version":2},"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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiL8Wo7ach/TfokqQMbpkqanmwXoQeqalgJSjKj6O+HkumR5ZOe0wG+AsT1KP12JFHUbdq03hCIRy7OzOeCpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:09:07.144751Z"},"content_sha256":"3447348b8633a02077eed1197193cf35bdebf7537b353ce64d583d6349d15562","schema_version":"1.0","event_id":"sha256:3447348b8633a02077eed1197193cf35bdebf7537b353ce64d583d6349d15562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/bundle.json","state_url":"https://pith.science/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/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-03T16:09:07Z","links":{"resolver":"https://pith.science/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO","bundle":"https://pith.science/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/bundle.json","state":"https://pith.science/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZCEU7UFFXNFZ6KIQTUJGANJMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BZCEU7UFFXNFZ6KIQTUJGANJMO","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":"84c29959a4622362adfc28d1453d96a3905f508039eb4b9a15cfc4e95884435a","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-16T19:42:34Z","title_canon_sha256":"949ee3dd7b89b3ae84af7f6112ac5e90d45e34d69b50a895efc687f6dc2bd1ae"},"schema_version":"1.0","source":{"id":"1609.05191","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05191","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05191v2","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05191","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"BZCEU7UFFXNF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZCEU7UFFXNFZ6KI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZCEU7UF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:3447348b8633a02077eed1197193cf35bdebf7537b353ce64d583d6349d15562","target":"graph","created_at":"2026-05-17T23:54:27Z","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 prove that stochastic gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical system from a sequence of noisy observations generated by the system. Even though the objective function is non-convex, we provide polynomial running time and sample complexity bounds under strong but natural assumptions. Linear systems identification has been studied for many decades, yet, to the best of our knowledge, these are the first polynomial guarantees for the problem we consider.","authors_text":"Benjamin Recht, Moritz Hardt, Tengyu Ma","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-16T19:42:34Z","title":"Gradient Descent Learns Linear Dynamical Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05191","kind":"arxiv","version":2},"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:d3c43ea6d6b5676749db36032873d540c9e596bfd0665aeb7371c18853896a6c","target":"record","created_at":"2026-05-17T23:54:27Z","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":"84c29959a4622362adfc28d1453d96a3905f508039eb4b9a15cfc4e95884435a","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-16T19:42:34Z","title_canon_sha256":"949ee3dd7b89b3ae84af7f6112ac5e90d45e34d69b50a895efc687f6dc2bd1ae"},"schema_version":"1.0","source":{"id":"1609.05191","kind":"arxiv","version":2}},"canonical_sha256":"0e444a7e852dda5cf94884e89301a963bb8c2430a973a73d8a9e3de3b5e05bd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e444a7e852dda5cf94884e89301a963bb8c2430a973a73d8a9e3de3b5e05bd6","first_computed_at":"2026-05-17T23:54:27.012499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:27.012499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFRNKRp+hXUtHRjlhPI5wdfR7caALVr2s9lD3Ry2iqmIpSmRATqtqLgaUMT7l5pJG3FfbyAh9yXVH3A/cNIXDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:27.013113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05191","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c43ea6d6b5676749db36032873d540c9e596bfd0665aeb7371c18853896a6c","sha256:3447348b8633a02077eed1197193cf35bdebf7537b353ce64d583d6349d15562"],"state_sha256":"59c673d4df1349db7cd122ceabdbc6e7dfa12e48c4db639b231ab9d79a495725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Smu0BpJ9XY5hX3wQI/Q4G3Go7eA4gvm1PUC+j+soii3QXuZTURJEDWo/sGjbSLnr0kzyWybYROSXE9OuYKWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:09:07.146703Z","bundle_sha256":"b81672e6cad638256380d639702682ab99360d11189c1afb0aeb9db1ddd0cf0d"}}