{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GZGJA7EDB574NPPGGZOMPHHHSQ","short_pith_number":"pith:GZGJA7ED","canonical_record":{"source":{"id":"1609.03285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T07:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"beadcc1a8e25ad352f617313db503f0751e2d86373d60161575e673ad084f88e","abstract_canon_sha256":"3a76db73a2a86ff0a41acf364e3a05d3eb74a6e415bd150b4fbb7f13681e2817"},"schema_version":"1.0"},"canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","source":{"kind":"arxiv","id":"1609.03285","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GZGJA7EDB574NPPGGZOMPHHHSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T07:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"beadcc1a8e25ad352f617313db503f0751e2d86373d60161575e673ad084f88e","abstract_canon_sha256":"3a76db73a2a86ff0a41acf364e3a05d3eb74a6e415bd150b4fbb7f13681e2817"},"schema_version":"1.0"},"canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.768848Z","signature_b64":"ui04PJH9JBFcHiHuyLkHQXjUBhJXxpf/viZAWS3lCufqyTSCPslcNdb86Gp189qpMfU/dgYqR60iRrh44pgjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","last_reissued_at":"2026-05-18T01:02:51.768449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.768449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03285","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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2s7BwRNCZgXnk5hU1ay7AxWnUy/ZimG6ngYRrYgAGZtBov9MKgZ/PyKWzgXsWOa2TAh62emcqLBC3Aqi1tlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:57:53.420174Z"},"content_sha256":"cfb9883974720f01c5cc64e90e195f074641cfb43819401330bb93d390470608","schema_version":"1.0","event_id":"sha256:cfb9883974720f01c5cc64e90e195f074641cfb43819401330bb93d390470608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GZGJA7EDB574NPPGGZOMPHHHSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disciplined Multi-Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madeleine Udell, Stephen Boyd, Steven Diamond, Xinyue Shen, Yuantao Gu","submitted_at":"2016-09-12T07:28:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03285","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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPx75ozQj5qymL9trBx8RdcTJf5TN1AAN8vFyG/WtkV7ZfjOpEzmoiPqJoaJIqC0TQBk67YumyZtq7jEXbnJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:57:53.420862Z"},"content_sha256":"14129003db6f30abdad0b72bf009cb1d246750c529a44548bd321034e31940ae","schema_version":"1.0","event_id":"sha256:14129003db6f30abdad0b72bf009cb1d246750c529a44548bd321034e31940ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/bundle.json","state_url":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/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-04T06:57:53Z","links":{"resolver":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ","bundle":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/bundle.json","state":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gvL7GOIC+A5pgdPqqsMCLZwfK3CRhJn//sLyJhIMKdrjkeN4ij34+l7gvKWjoBwnxxdIL1QrUjser9u9PA/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:57:53.425422Z","bundle_sha256":"5af923b4d4904b60c2db47dcac0ce5a3fa6cbc142ab86f72c945d3837e3afb10"}}