{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CDP7KCCQBUHAA6ZH3RX7ARZCFV","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":"b994ce6b020b1a9a9ed16519544acba5f7c74b233aec983fc430e2a22fd64b33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-11T14:27:33Z","title_canon_sha256":"4252a78706885aa0830c1db703d20fc7e51f895d213bc1bf81f502683c911f76"},"schema_version":"1.0","source":{"id":"2309.05487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05487","created_at":"2026-07-05T06:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05487v1","created_at":"2026-07-05T06:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05487","created_at":"2026-07-05T06:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"CDP7KCCQBUHA","created_at":"2026-07-05T06:49:36Z"},{"alias_kind":"pith_short_16","alias_value":"CDP7KCCQBUHAA6ZH","created_at":"2026-07-05T06:49:36Z"},{"alias_kind":"pith_short_8","alias_value":"CDP7KCCQ","created_at":"2026-07-05T06:49:36Z"}],"graph_snapshots":[{"event_id":"sha256:93c01f73a144b60455c186dc8956e54c1edd3ceccc79aa0eb1785073acc0fe49","target":"graph","created_at":"2026-07-05T06:49:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.05487/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There is an existing exact algorithm that solves DC programming problems if one component of the DC function is polyhedral convex (Loehne, Wagner, 2017). Motivated by this, first, we consider two cutting-plane algorithms for generating an $\\epsilon$-polyhedral underestimator of a convex function g. The algorithms start with a polyhedral underestimator of g and the epigraph of the current underestimator is intersected with either a single halfspace (Algorithm 1) or with possibly multiple halfspaces (Algorithm 2) in each iteration to obtain a better approximation. We prove the correctness and fi","authors_text":"Fahaar Mansoor Pirani, Firdevs Ulus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-11T14:27:33Z","title":"Algorithms for DC Programming via Polyhedral Approximations of Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05487","kind":"arxiv","version":1},"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:ca27377fb0faed73e9ce49e95260bd2207555e7c56df1ac7a9074095e8b06a86","target":"record","created_at":"2026-07-05T06:49:36Z","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":"b994ce6b020b1a9a9ed16519544acba5f7c74b233aec983fc430e2a22fd64b33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-11T14:27:33Z","title_canon_sha256":"4252a78706885aa0830c1db703d20fc7e51f895d213bc1bf81f502683c911f76"},"schema_version":"1.0","source":{"id":"2309.05487","kind":"arxiv","version":1}},"canonical_sha256":"10dff508500d0e007b27dc6ff047222d570c18d9117b8756093b4a9c9da8813f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10dff508500d0e007b27dc6ff047222d570c18d9117b8756093b4a9c9da8813f","first_computed_at":"2026-07-05T06:49:36.023939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:36.023939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PVMRTs+/ipkuGvMSZmBq844S7RAAuGnHeruLwkq6aKhdp/bzKNWt2jklUH4mmWE4KDAcTlIYcQho+fR7KoU5AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:36.024453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.05487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca27377fb0faed73e9ce49e95260bd2207555e7c56df1ac7a9074095e8b06a86","sha256:93c01f73a144b60455c186dc8956e54c1edd3ceccc79aa0eb1785073acc0fe49"],"state_sha256":"479228abb90df918daa2269f6f2c2776cc69b20ab53d22de7df83077a24a9bc7"}