{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DI2EES4NHPM3QNDIFD6VBW4GHZ","short_pith_number":"pith:DI2EES4N","schema_version":"1.0","canonical_sha256":"1a34424b8d3bd9b8346828fd50db863e724e09fb86d53fca8908535a8972daab","source":{"kind":"arxiv","id":"1307.1674","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Optimization of PCA with Capped MSG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew Cotter, Nathan Srebro, Raman Arora","submitted_at":"2013-07-05T17:39:40Z","abstract_excerpt":"We study PCA as a stochastic optimization problem and propose a novel stochastic approximation algorithm which we refer to as \"Matrix Stochastic Gradient\" (MSG), as well as a practical variant, Capped MSG. We study the method both theoretically and empirically."},"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":"1307.1674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-05T17:39:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1620bba46723343c8198a681ac778485676b6b17b7c57f4d14e5d6e85483604e","abstract_canon_sha256":"d1f770fa2c53268f812e1ccc24372ab13fca50cee29b43a0056e7638ac6fe4cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:12.241562Z","signature_b64":"gLI5aJtfU6IWI9uwbpTxmxjAOk/4zmCUy/pKQI5QcV/FJxYUWTLOwYmFiaAacDXui9BmPXepV3J+BygnGo35CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a34424b8d3bd9b8346828fd50db863e724e09fb86d53fca8908535a8972daab","last_reissued_at":"2026-05-18T03:19:12.241021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:12.241021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization of PCA with Capped MSG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew Cotter, Nathan Srebro, Raman Arora","submitted_at":"2013-07-05T17:39:40Z","abstract_excerpt":"We study PCA as a stochastic optimization problem and propose a novel stochastic approximation algorithm which we refer to as \"Matrix Stochastic Gradient\" (MSG), as well as a practical variant, Capped MSG. We study the method both theoretically and empirically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1674","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":"1307.1674","created_at":"2026-05-18T03:19:12.241097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1674v1","created_at":"2026-05-18T03:19:12.241097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1674","created_at":"2026-05-18T03:19:12.241097+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI2EES4NHPM3","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI2EES4NHPM3QNDI","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI2EES4N","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/DI2EES4NHPM3QNDIFD6VBW4GHZ","json":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ.json","graph_json":"https://pith.science/api/pith-number/DI2EES4NHPM3QNDIFD6VBW4GHZ/graph.json","events_json":"https://pith.science/api/pith-number/DI2EES4NHPM3QNDIFD6VBW4GHZ/events.json","paper":"https://pith.science/paper/DI2EES4N"},"agent_actions":{"view_html":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ","download_json":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ.json","view_paper":"https://pith.science/paper/DI2EES4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1674&json=true","fetch_graph":"https://pith.science/api/pith-number/DI2EES4NHPM3QNDIFD6VBW4GHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DI2EES4NHPM3QNDIFD6VBW4GHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ/action/storage_attestation","attest_author":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ/action/author_attestation","sign_citation":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ/action/citation_signature","submit_replication":"https://pith.science/pith/DI2EES4NHPM3QNDIFD6VBW4GHZ/action/replication_record"}},"created_at":"2026-05-18T03:19:12.241097+00:00","updated_at":"2026-05-18T03:19:12.241097+00:00"}