{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GZGJA7EDB574NPPGGZOMPHHHSQ","short_pith_number":"pith:GZGJA7ED","schema_version":"1.0","canonical_sha256":"364c907c830f7fc6bde6365cc79ce7940f7329aabd9f9f405569c2fc93ba90bc","source":{"kind":"arxiv","id":"1609.03285","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.03285","created_at":"2026-05-18T01:02:51.768519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03285v2","created_at":"2026-05-18T01:02:51.768519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03285","created_at":"2026-05-18T01:02:51.768519+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZGJA7EDB574","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZGJA7EDB574NPPG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZGJA7ED","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08772","citing_title":"Understanding Filter Bubbles and Polarization in Social Networks","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ","json":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ.json","graph_json":"https://pith.science/api/pith-number/GZGJA7EDB574NPPGGZOMPHHHSQ/graph.json","events_json":"https://pith.science/api/pith-number/GZGJA7EDB574NPPGGZOMPHHHSQ/events.json","paper":"https://pith.science/paper/GZGJA7ED"},"agent_actions":{"view_html":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ","download_json":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ.json","view_paper":"https://pith.science/paper/GZGJA7ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03285&json=true","fetch_graph":"https://pith.science/api/pith-number/GZGJA7EDB574NPPGGZOMPHHHSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GZGJA7EDB574NPPGGZOMPHHHSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/action/storage_attestation","attest_author":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/action/author_attestation","sign_citation":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/action/citation_signature","submit_replication":"https://pith.science/pith/GZGJA7EDB574NPPGGZOMPHHHSQ/action/replication_record"}},"created_at":"2026-05-18T01:02:51.768519+00:00","updated_at":"2026-05-18T01:02:51.768519+00:00"}