{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L6JA2GG7OFG4N42MYGBPXTRLQ4","short_pith_number":"pith:L6JA2GG7","schema_version":"1.0","canonical_sha256":"5f920d18df714dc6f34cc182fbce2b873b988fbe19b2d6f7228d2f25fd065413","source":{"kind":"arxiv","id":"1604.02639","version":1},"attestation_state":"computed","paper":{"title":"Disciplined Convex-Concave Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stephen Boyd, Steven Diamond, Xinyue Shen, Yuantao Gu","submitted_at":"2016-04-10T05:12:20Z","abstract_excerpt":"In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP). Convex-concave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions that are a sum of a convex and a concave term. DCP is a structured way to define convex optimization problems, based on a family of basic convex and concave functions and a few rules for combining them. Problems expressed using DCP can be automatically converted to standard form and solved"},"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":"1604.02639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-10T05:12:20Z","cross_cats_sorted":[],"title_canon_sha256":"08f61648b6fb855a8d1e0e92dd8187b79922730f2431215a85abf268f2f11c51","abstract_canon_sha256":"bdd2bc6340230f4867a11de15c8bd7f3e40004a6fb25ae3c2218be29ed2472b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.548737Z","signature_b64":"5Ll9Sk+h1Ex0j1QoqxgFW9+ii7RR33kWMnWoC+9DkxP3jz9qIkNbVll8icSeQQE7XYBaK0San/OFveZyuY0LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f920d18df714dc6f34cc182fbce2b873b988fbe19b2d6f7228d2f25fd065413","last_reissued_at":"2026-05-18T01:17:22.548188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.548188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disciplined Convex-Concave Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stephen Boyd, Steven Diamond, Xinyue Shen, Yuantao Gu","submitted_at":"2016-04-10T05:12:20Z","abstract_excerpt":"In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP). Convex-concave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions that are a sum of a convex and a concave term. DCP is a structured way to define convex optimization problems, based on a family of basic convex and concave functions and a few rules for combining them. Problems expressed using DCP can be automatically converted to standard form and solved"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02639","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.02639","created_at":"2026-05-18T01:17:22.548268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02639v1","created_at":"2026-05-18T01:17:22.548268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02639","created_at":"2026-05-18T01:17:22.548268+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6JA2GG7OFG4","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6JA2GG7OFG4N42M","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6JA2GG7","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4","json":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4.json","graph_json":"https://pith.science/api/pith-number/L6JA2GG7OFG4N42MYGBPXTRLQ4/graph.json","events_json":"https://pith.science/api/pith-number/L6JA2GG7OFG4N42MYGBPXTRLQ4/events.json","paper":"https://pith.science/paper/L6JA2GG7"},"agent_actions":{"view_html":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4","download_json":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4.json","view_paper":"https://pith.science/paper/L6JA2GG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02639&json=true","fetch_graph":"https://pith.science/api/pith-number/L6JA2GG7OFG4N42MYGBPXTRLQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/L6JA2GG7OFG4N42MYGBPXTRLQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4/action/storage_attestation","attest_author":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4/action/author_attestation","sign_citation":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4/action/citation_signature","submit_replication":"https://pith.science/pith/L6JA2GG7OFG4N42MYGBPXTRLQ4/action/replication_record"}},"created_at":"2026-05-18T01:17:22.548268+00:00","updated_at":"2026-05-18T01:17:22.548268+00:00"}