{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LXCKZ7DW5IG6E7QIQLXDIT72J6","short_pith_number":"pith:LXCKZ7DW","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"},"canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","source":{"kind":"arxiv","id":"1610.05470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05470","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05470v2","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05470","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"LXCKZ7DW5IG6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXCKZ7DW5IG6E7QI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXCKZ7DW","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LXCKZ7DW5IG6E7QIQLXDIT72J6","target":"record","payload":{"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"},"canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","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"},"source_kind":"arxiv","source_id":"1610.05470","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-18T00:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3u6l+FcayMJNpfA6uGp/UuMq1Dv9BPn77v1OMrGOwtY8EFLw60bu/87owbl959XLTJE6ogzFaBK1jOVDRGVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:58:37.411375Z"},"content_sha256":"27af07e5119f61ee6b5763a33ef9831085650819bd21dd7ec78f77d4bdbfe438","schema_version":"1.0","event_id":"sha256:27af07e5119f61ee6b5763a33ef9831085650819bd21dd7ec78f77d4bdbfe438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LXCKZ7DW5IG6E7QIQLXDIT72J6","target":"graph","payload":{"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"},"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-18T00:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ks6C/TYgTNsO9x6bzLo2Pn/VOjqC49ITKxwJ2Y3QlZMGBxN0fH2VlmEsGeZ5fhG3rxV0kfpuRm3K1tbnLmrSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:58:37.411728Z"},"content_sha256":"651eef7fc0378d3b0503552df3798870381e4a82ccd35b87f47ab7e45a1ee28c","schema_version":"1.0","event_id":"sha256:651eef7fc0378d3b0503552df3798870381e4a82ccd35b87f47ab7e45a1ee28c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/bundle.json","state_url":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/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-27T14:58:37Z","links":{"resolver":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6","bundle":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/bundle.json","state":"https://pith.science/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXCKZ7DW5IG6E7QIQLXDIT72J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LXCKZ7DW5IG6E7QIQLXDIT72J6","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":"d0e968ae13995100b5a9ade78bcbc27ff1905fc7d409889fac175ca35ee9eee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T08:07:38Z","title_canon_sha256":"ce78acd58028b2364754319c6b1cedd0688baf5d310f45c53375718786db53e3"},"schema_version":"1.0","source":{"id":"1610.05470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05470","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05470v2","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05470","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"LXCKZ7DW5IG6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXCKZ7DW5IG6E7QI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXCKZ7DW","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:651eef7fc0378d3b0503552df3798870381e4a82ccd35b87f47ab7e45a1ee28c","target":"graph","created_at":"2026-05-18T00:46:59Z","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 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","authors_text":"Andreas L\\\"ohne, Andrea Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T08:07:38Z","title":"Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05470","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:27af07e5119f61ee6b5763a33ef9831085650819bd21dd7ec78f77d4bdbfe438","target":"record","created_at":"2026-05-18T00:46:59Z","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":"d0e968ae13995100b5a9ade78bcbc27ff1905fc7d409889fac175ca35ee9eee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T08:07:38Z","title_canon_sha256":"ce78acd58028b2364754319c6b1cedd0688baf5d310f45c53375718786db53e3"},"schema_version":"1.0","source":{"id":"1610.05470","kind":"arxiv","version":2}},"canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dc4acfc76ea0de27e0882ee344ffa4f861de33ca9031a5ed8713457c1578a01","first_computed_at":"2026-05-18T00:46:59.408917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:59.408917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ix3GBRf5a0FncIrPQvblNQIueB2W/QV1FSVR82yrJAqeYMv4in2IddBT0s/oPMIZV68VXJ/178xLUvMvoJjnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:59.409502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27af07e5119f61ee6b5763a33ef9831085650819bd21dd7ec78f77d4bdbfe438","sha256:651eef7fc0378d3b0503552df3798870381e4a82ccd35b87f47ab7e45a1ee28c"],"state_sha256":"b35e1b3e7aed00e27e0963256f3c6f111c43f6c65aa3c26050a829cd51245fc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfgUPptUDU2+IWeofsao8fcFFyPghkYD2Wo2/cA6+hlGMtEXaHDa68J0lUT7NWc+lRAgkiIOuDPGX1e+Gmm8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:58:37.413653Z","bundle_sha256":"2a5c8676afef89318a49759d792ab7056f0df1257d8d9153442ece42194b907c"}}