{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:35K65HFN6DTGZIVSM52I2ZM2JT","short_pith_number":"pith:35K65HFN","canonical_record":{"source":{"id":"1606.03168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"title_canon_sha256":"75811c46e80e803cebf1cff2cda65481a78aef3d2cbda72a827c7f41ef2cecdc","abstract_canon_sha256":"95c7b9537fcf96d66abc56734891c31816d9ece6a298e2e9733a7fb4df6a5674"},"schema_version":"1.0"},"canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","source":{"kind":"arxiv","id":"1606.03168","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03168","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03168v3","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03168","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"35K65HFN6DTG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35K65HFN6DTGZIVS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35K65HFN","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:35K65HFN6DTGZIVSM52I2ZM2JT","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"title_canon_sha256":"75811c46e80e803cebf1cff2cda65481a78aef3d2cbda72a827c7f41ef2cecdc","abstract_canon_sha256":"95c7b9537fcf96d66abc56734891c31816d9ece6a298e2e9733a7fb4df6a5674"},"schema_version":"1.0"},"canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.889495Z","signature_b64":"F5xeSXpfkkBHAY6YeJ9bR1BMcBgTWTm5PxEropFHK1ipmEW2iVK7HUyFDwIxQ9Kcsx0sR/DDbIFlKMlHg7DVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","last_reissued_at":"2026-05-18T01:00:52.888790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.888790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03168","source_version":3,"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-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3NWLggBuudwUd9Sc36uS0KyxIVRNN6Ux8x18vL/8IhWexHOBD/SozJY2Q1++O+IH+Uu7Yu076KRX/PxRNXeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:52:59.390082Z"},"content_sha256":"d12a5426335ad09b193f0ae3c8ed96cf594a3e58c9f470267fefd5f3e2b5e0f1","schema_version":"1.0","event_id":"sha256:d12a5426335ad09b193f0ae3c8ed96cf594a3e58c9f470267fefd5f3e2b5e0f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:35K65HFN6DTGZIVSM52I2ZM2JT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"primary_cat":"math.OC","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Sujay Sanghavi","submitted_at":"2016-06-10T03:18:01Z","abstract_excerpt":"A rank-$r$ matrix $X \\in \\mathbb{R}^{m \\times n}$ can be written as a product $U V^\\top$, where $U \\in \\mathbb{R}^{m \\times r}$ and $V \\in \\mathbb{R}^{n \\times r}$. One could exploit this observation in optimization: e.g., consider the minimization of a convex function $f(X)$ over rank-$r$ matrices, where the set of rank-$r$ matrices is modeled via the factorization $UV^\\top$. Though such parameterization reduces the number of variables, and is more computationally efficient (of particular interest is the case $r \\ll \\min\\{m, n\\}$), it comes at a cost: $f(UV^\\top)$ becomes a non-convex functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03168","kind":"arxiv","version":3},"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-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKbTJeH8RaK8P9fzRyB7PXgXSTXtsBPm/MZTVSpnY15OtZFv44g2xGjJpuwdVQYx6h+SihPs2hmyy7nU1QbLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:52:59.390588Z"},"content_sha256":"bd3f76f30d83e49335c5142c6abaae3e906011143c633d9249ffbf5a8b5e6226","schema_version":"1.0","event_id":"sha256:bd3f76f30d83e49335c5142c6abaae3e906011143c633d9249ffbf5a8b5e6226"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/bundle.json","state_url":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35K65HFN6DTGZIVSM52I2ZM2JT/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-26T08:52:59Z","links":{"resolver":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT","bundle":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/bundle.json","state":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35K65HFN6DTGZIVSM52I2ZM2JT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:35K65HFN6DTGZIVSM52I2ZM2JT","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":"95c7b9537fcf96d66abc56734891c31816d9ece6a298e2e9733a7fb4df6a5674","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","title_canon_sha256":"75811c46e80e803cebf1cff2cda65481a78aef3d2cbda72a827c7f41ef2cecdc"},"schema_version":"1.0","source":{"id":"1606.03168","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03168","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03168v3","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03168","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"35K65HFN6DTG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35K65HFN6DTGZIVS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35K65HFN","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:bd3f76f30d83e49335c5142c6abaae3e906011143c633d9249ffbf5a8b5e6226","target":"graph","created_at":"2026-05-18T01:00:52Z","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":"A rank-$r$ matrix $X \\in \\mathbb{R}^{m \\times n}$ can be written as a product $U V^\\top$, where $U \\in \\mathbb{R}^{m \\times r}$ and $V \\in \\mathbb{R}^{n \\times r}$. One could exploit this observation in optimization: e.g., consider the minimization of a convex function $f(X)$ over rank-$r$ matrices, where the set of rank-$r$ matrices is modeled via the factorization $UV^\\top$. Though such parameterization reduces the number of variables, and is more computationally efficient (of particular interest is the case $r \\ll \\min\\{m, n\\}$), it comes at a cost: $f(UV^\\top)$ becomes a non-convex functio","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Sujay Sanghavi","cross_cats":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03168","kind":"arxiv","version":3},"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:d12a5426335ad09b193f0ae3c8ed96cf594a3e58c9f470267fefd5f3e2b5e0f1","target":"record","created_at":"2026-05-18T01:00:52Z","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":"95c7b9537fcf96d66abc56734891c31816d9ece6a298e2e9733a7fb4df6a5674","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","title_canon_sha256":"75811c46e80e803cebf1cff2cda65481a78aef3d2cbda72a827c7f41ef2cecdc"},"schema_version":"1.0","source":{"id":"1606.03168","kind":"arxiv","version":3}},"canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","first_computed_at":"2026-05-18T01:00:52.888790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:52.888790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F5xeSXpfkkBHAY6YeJ9bR1BMcBgTWTm5PxEropFHK1ipmEW2iVK7HUyFDwIxQ9Kcsx0sR/DDbIFlKMlHg7DVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:52.889495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03168","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d12a5426335ad09b193f0ae3c8ed96cf594a3e58c9f470267fefd5f3e2b5e0f1","sha256:bd3f76f30d83e49335c5142c6abaae3e906011143c633d9249ffbf5a8b5e6226"],"state_sha256":"c66eccee642ba30a79154d7b3f4a13ddc3b1249582f485a25f2d4bec3ef53817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uq0oAnNu+PJ7cmIquHggO3MqHZHEPwVKL3v/fXBWqKiowbg2H1ieRXizFjjp3f8az8lIRGY2quCU8fLDXlIZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:52:59.394542Z","bundle_sha256":"19d0ed1127d2d5276c0d787cf1edb446f26f57154698c293690f3ecc62531a49"}}