{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GZGJA7EDB574NPPGGZOMPHHHSQ","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":"3a76db73a2a86ff0a41acf364e3a05d3eb74a6e415bd150b4fbb7f13681e2817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T07:28:09Z","title_canon_sha256":"beadcc1a8e25ad352f617313db503f0751e2d86373d60161575e673ad084f88e"},"schema_version":"1.0","source":{"id":"1609.03285","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03285","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03285v2","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03285","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"GZGJA7EDB574","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GZGJA7EDB574NPPG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GZGJA7ED","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:14129003db6f30abdad0b72bf009cb1d246750c529a44548bd321034e31940ae","target":"graph","created_at":"2026-05-18T01:02:51Z","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 multi-convex optimization problem is one in which the variables can be partitioned into sets over which the problem is convex when the other variables are fixed. Multi-convex problems are generally solved approximately using variations on alternating or cyclic minimization. Multi-convex problems arise in many applications, such as nonnegative matrix factorization, generalized low rank models, and structured control synthesis, to name just a few. In most applications to date the multi-convexity is simple to verify by hand. In this paper we study the automatic detection and verification of mul","authors_text":"Madeleine Udell, Stephen Boyd, Steven Diamond, Xinyue Shen, Yuantao Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T07:28:09Z","title":"Disciplined Multi-Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03285","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:cfb9883974720f01c5cc64e90e195f074641cfb43819401330bb93d390470608","target":"record","created_at":"2026-05-18T01:02:51Z","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":"3a76db73a2a86ff0a41acf364e3a05d3eb74a6e415bd150b4fbb7f13681e2817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T07:28:09Z","title_canon_sha256":"beadcc1a8e25ad352f617313db503f0751e2d86373d60161575e673ad084f88e"},"schema_version":"1.0","source":{"id":"1609.03285","kind":"arxiv","version":2}},"canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","first_computed_at":"2026-05-18T01:02:51.768449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:51.768449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ui04PJH9JBFcHiHuyLkHQXjUBhJXxpf/viZAWS3lCufqyTSCPslcNdb86Gp189qpMfU/dgYqR60iRrh44pgjCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:51.768848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03285","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfb9883974720f01c5cc64e90e195f074641cfb43819401330bb93d390470608","sha256:14129003db6f30abdad0b72bf009cb1d246750c529a44548bd321034e31940ae"],"state_sha256":"445e896f3bef25dd12e8370f535854d865fc1fcb1c1c713bb5874a830fe63e81"}