{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LXCKZ7DW5IG6E7QIQLXDIT72J6","short_pith_number":"pith:LXCKZ7DW","schema_version":"1.0","canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","source":{"kind":"arxiv","id":"1610.05470","version":2},"attestation_state":"computed","paper":{"title":"Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas L\\\"ohne, Andrea Wagner","submitted_at":"2016-10-18T08:07:38Z","abstract_excerpt":"A class of non-convex optimization problems with DC objective function is studied, where DC stands for being representable as the difference $f=g-h$ of two convex functions $g$ and $h$. In particular, we deal with the special case where one of the two convex functions $g$ or $h$ is polyhedral. In case $g$ is polyhedral, we show that a solution of the DC program can be obtained from a solution of an associated polyhedral projection problem. In case $h$ is polyhedral, we prove that a solution of the DC program can be obtained by solving a polyhedral projection problem and finitely many convex pr"},"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":"1610.05470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T08:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"ce78acd58028b2364754319c6b1cedd0688baf5d310f45c53375718786db53e3","abstract_canon_sha256":"d0e968ae13995100b5a9ade78bcbc27ff1905fc7d409889fac175ca35ee9eee0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:59.409502Z","signature_b64":"Ix3GBRf5a0FncIrPQvblNQIueB2W/QV1FSVR82yrJAqeYMv4in2IddBT0s/oPMIZV68VXJ/178xLUvMvoJjnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","last_reissued_at":"2026-05-18T00:46:59.408917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:59.408917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas L\\\"ohne, Andrea Wagner","submitted_at":"2016-10-18T08:07:38Z","abstract_excerpt":"A class of non-convex optimization problems with DC objective function is studied, where DC stands for being representable as the difference $f=g-h$ of two convex functions $g$ and $h$. In particular, we deal with the special case where one of the two convex functions $g$ or $h$ is polyhedral. In case $g$ is polyhedral, we show that a solution of the DC program can be obtained from a solution of an associated polyhedral projection problem. In case $h$ is polyhedral, we prove that a solution of the DC program can be obtained by solving a polyhedral projection problem and finitely many convex pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05470","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":"1610.05470","created_at":"2026-05-18T00:46:59.408998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05470v2","created_at":"2026-05-18T00:46:59.408998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05470","created_at":"2026-05-18T00:46:59.408998+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXCKZ7DW5IG6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXCKZ7DW5IG6E7QI","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXCKZ7DW","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/LXCKZ7DW5IG6E7QIQLXDIT72J6","json":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6.json","graph_json":"https://pith.science/api/pith-number/LXCKZ7DW5IG6E7QIQLXDIT72J6/graph.json","events_json":"https://pith.science/api/pith-number/LXCKZ7DW5IG6E7QIQLXDIT72J6/events.json","paper":"https://pith.science/paper/LXCKZ7DW"},"agent_actions":{"view_html":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6","download_json":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6.json","view_paper":"https://pith.science/paper/LXCKZ7DW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05470&json=true","fetch_graph":"https://pith.science/api/pith-number/LXCKZ7DW5IG6E7QIQLXDIT72J6/graph.json","fetch_events":"https://pith.science/api/pith-number/LXCKZ7DW5IG6E7QIQLXDIT72J6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/action/storage_attestation","attest_author":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/action/author_attestation","sign_citation":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/action/citation_signature","submit_replication":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/action/replication_record"}},"created_at":"2026-05-18T00:46:59.408998+00:00","updated_at":"2026-05-18T00:46:59.408998+00:00"}