{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WLKE76TBGSH3SPUQOQNDTP254T","short_pith_number":"pith:WLKE76TB","canonical_record":{"source":{"id":"1706.05598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-18T01:18:42Z","cross_cats_sorted":["cs.DS","math.OC","math.PR","stat.ML"],"title_canon_sha256":"877dacfd6f3e0a10abf979253bf50a6de84b0b68ed91f5f7b499dd1292967ecf","abstract_canon_sha256":"6b16c85cd423912bf94f8e7b071ad99fda02d31abac8da37898054aa30ca2255"},"schema_version":"1.0"},"canonical_sha256":"b2d44ffa61348fb93e90741a39bf5de4e41c867b01185189e0fe9a0994e65bbd","source":{"kind":"arxiv","id":"1706.05598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05598","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05598v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05598","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"WLKE76TBGSH3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WLKE76TBGSH3SPUQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WLKE76TB","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WLKE76TBGSH3SPUQOQNDTP254T","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-18T01:18:42Z","cross_cats_sorted":["cs.DS","math.OC","math.PR","stat.ML"],"title_canon_sha256":"877dacfd6f3e0a10abf979253bf50a6de84b0b68ed91f5f7b499dd1292967ecf","abstract_canon_sha256":"6b16c85cd423912bf94f8e7b071ad99fda02d31abac8da37898054aa30ca2255"},"schema_version":"1.0"},"canonical_sha256":"b2d44ffa61348fb93e90741a39bf5de4e41c867b01185189e0fe9a0994e65bbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.428087Z","signature_b64":"vx7W6QkE5BIE/8JhWsQFQupTGmBc8YVICjFTOD9Urt35o5PnzvPns8TCAUPGFbP6ndQxz74w2SXrRWkcAhSzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2d44ffa61348fb93e90741a39bf5de4e41c867b01185189e0fe9a0994e65bbd","last_reissued_at":"2026-05-18T00:42:09.427654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.427654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05598","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehk/ViWd+TEHRDcyMUJ1nbEGW6fTsE7n4rpjKkoa2DznFtSR/K3LSLOLYStW4//QliUKudPcR7uQ0+vn70HwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:04:04.276933Z"},"content_sha256":"c7de66a5a8c9ac262eeb5e86572e2bf8649a3947881cbccd5dbc23dd9c25c399","schema_version":"1.0","event_id":"sha256:c7de66a5a8c9ac262eeb5e86572e2bf8649a3947881cbccd5dbc23dd9c25c399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WLKE76TBGSH3SPUQOQNDTP254T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimization Landscape of Tensor Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Rong Ge, Tengyu Ma","submitted_at":"2017-06-18T01:18:42Z","abstract_excerpt":"Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to have the geometric property that \"all local optima are (approximately) global optima\", and thus they can be solved efficiently by local search algorithms. However, establishing such property can be very difficult.\n  In this paper, we analyze the optimization landscape of the rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05598","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkkKc0+PUXbUmSCnEtQszK48whSvBAjyYG7uLRJOhR8QCvHYZ7qaqDTlsp/mIAvA/VDnJKUrZV+lnbTvm2IVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:04:04.277287Z"},"content_sha256":"5e61a55668c062bc99c9f34ab752eca27b3608f7108a000bf769a4cb7b9bac74","schema_version":"1.0","event_id":"sha256:5e61a55668c062bc99c9f34ab752eca27b3608f7108a000bf769a4cb7b9bac74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLKE76TBGSH3SPUQOQNDTP254T/bundle.json","state_url":"https://pith.science/pith/WLKE76TBGSH3SPUQOQNDTP254T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLKE76TBGSH3SPUQOQNDTP254T/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-28T16:04:04Z","links":{"resolver":"https://pith.science/pith/WLKE76TBGSH3SPUQOQNDTP254T","bundle":"https://pith.science/pith/WLKE76TBGSH3SPUQOQNDTP254T/bundle.json","state":"https://pith.science/pith/WLKE76TBGSH3SPUQOQNDTP254T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLKE76TBGSH3SPUQOQNDTP254T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WLKE76TBGSH3SPUQOQNDTP254T","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":"6b16c85cd423912bf94f8e7b071ad99fda02d31abac8da37898054aa30ca2255","cross_cats_sorted":["cs.DS","math.OC","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-18T01:18:42Z","title_canon_sha256":"877dacfd6f3e0a10abf979253bf50a6de84b0b68ed91f5f7b499dd1292967ecf"},"schema_version":"1.0","source":{"id":"1706.05598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05598","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05598v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05598","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"WLKE76TBGSH3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WLKE76TBGSH3SPUQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WLKE76TB","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5e61a55668c062bc99c9f34ab752eca27b3608f7108a000bf769a4cb7b9bac74","target":"graph","created_at":"2026-05-18T00:42:09Z","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":"Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to have the geometric property that \"all local optima are (approximately) global optima\", and thus they can be solved efficiently by local search algorithms. However, establishing such property can be very difficult.\n  In this paper, we analyze the optimization landscape of the rand","authors_text":"Rong Ge, Tengyu Ma","cross_cats":["cs.DS","math.OC","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-18T01:18:42Z","title":"On the Optimization Landscape of Tensor Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05598","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:c7de66a5a8c9ac262eeb5e86572e2bf8649a3947881cbccd5dbc23dd9c25c399","target":"record","created_at":"2026-05-18T00:42:09Z","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":"6b16c85cd423912bf94f8e7b071ad99fda02d31abac8da37898054aa30ca2255","cross_cats_sorted":["cs.DS","math.OC","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-18T01:18:42Z","title_canon_sha256":"877dacfd6f3e0a10abf979253bf50a6de84b0b68ed91f5f7b499dd1292967ecf"},"schema_version":"1.0","source":{"id":"1706.05598","kind":"arxiv","version":1}},"canonical_sha256":"b2d44ffa61348fb93e90741a39bf5de4e41c867b01185189e0fe9a0994e65bbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2d44ffa61348fb93e90741a39bf5de4e41c867b01185189e0fe9a0994e65bbd","first_computed_at":"2026-05-18T00:42:09.427654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:09.427654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vx7W6QkE5BIE/8JhWsQFQupTGmBc8YVICjFTOD9Urt35o5PnzvPns8TCAUPGFbP6ndQxz74w2SXrRWkcAhSzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:09.428087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7de66a5a8c9ac262eeb5e86572e2bf8649a3947881cbccd5dbc23dd9c25c399","sha256:5e61a55668c062bc99c9f34ab752eca27b3608f7108a000bf769a4cb7b9bac74"],"state_sha256":"c0d8d51812ae63186ce61491bb27c63bf845569db7acde2995d8adf6aec58a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQNIoFq6j8f6LG01YVf+zAcJAVX4phYUc1PZzjo1Eu4sPnrBQcfmi8uU0bs6H9+gXuU2q22jN6LO4eRbd98fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:04:04.279426Z","bundle_sha256":"0fc7b6d8eab8036bb57ea842ea50f6bc651cb788b78227b6c3e152bf001fb936"}}