{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:X5LJHMHFPWO4BC4K6SBFR7GAZG","short_pith_number":"pith:X5LJHMHF","canonical_record":{"source":{"id":"2504.16330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T00:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"82904b2722ba3d2a728bfc61e2a6841b4d62220cd2ea621f91e65fccec17b1cc","abstract_canon_sha256":"611635d8e5dc951f0535422b9f808c960cae7c9a0ae4d786f70a37aad7afb426"},"schema_version":"1.0"},"canonical_sha256":"bf5693b0e57d9dc08b8af48258fcc0c9b23f9c571143d68d4a6a1738900b8bfa","source":{"kind":"arxiv","id":"2504.16330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16330","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16330v1","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16330","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"X5LJHMHFPWO4","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"X5LJHMHFPWO4BC4K","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"X5LJHMHF","created_at":"2026-07-05T10:52:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:X5LJHMHFPWO4BC4K6SBFR7GAZG","target":"record","payload":{"canonical_record":{"source":{"id":"2504.16330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T00:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"82904b2722ba3d2a728bfc61e2a6841b4d62220cd2ea621f91e65fccec17b1cc","abstract_canon_sha256":"611635d8e5dc951f0535422b9f808c960cae7c9a0ae4d786f70a37aad7afb426"},"schema_version":"1.0"},"canonical_sha256":"bf5693b0e57d9dc08b8af48258fcc0c9b23f9c571143d68d4a6a1738900b8bfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:45.022930Z","signature_b64":"zxIpuLP6H0KCmmH0cZGK9xOSQOFAJ8n4WXPVyJP5rboRmaxIG35qfooNKAFr75iCveYSmVrd9yP4S8RWeed6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5693b0e57d9dc08b8af48258fcc0c9b23f9c571143d68d4a6a1738900b8bfa","last_reissued_at":"2026-07-05T10:52:45.022541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:45.022541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.16330","source_version":1,"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-07-05T10:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyFy24fQBl/lIsx8FmoJZQdnMQwXkZ9S0jyEx214YgidBtBPpi9Cs6qFeaOGMFch9fhGhhj32qAW7PBQbUuJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:50:53.005209Z"},"content_sha256":"7965053e0715db2bc053002436597981f3d544a2c3b165a199dedc269e10dcd5","schema_version":"1.0","event_id":"sha256:7965053e0715db2bc053002436597981f3d544a2c3b165a199dedc269e10dcd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:X5LJHMHFPWO4BC4K6SBFR7GAZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-one convexification for quadratic optimization problems with step function penalties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andres Gomez, Shaoning Han, Soobin Choi, Valentina Cepeda","submitted_at":"2025-04-23T00:24:48Z","abstract_excerpt":"We investigate convexification for convex quadratic optimization with step function penalties. Such problems can be cast as mixed-integer quadratic optimization problems, where binary variables are used to encode the non-convex step function. First, we derive the convex hull for the epigraph of a quadratic function defined by a rank-one matrix and step function penalties. Using this rank-one convexification, we develop copositive and semi-definite relaxations for general convex quadratic functions. Leveraging these findings, we construct convex formulations to the support vector machine proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16330","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.16330/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qw3NlHJ3FqbRxDbBvEWqU0nz4BeCzLjEpwtEFvrutBDczzmPArJKcktPzoimNLya5EY7f/XJrWbo3SpT1BpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:50:53.005885Z"},"content_sha256":"a5c80237da4b7b732f7b47afee64d8d1c36c1daddd5e72d976ace91a94418f2a","schema_version":"1.0","event_id":"sha256:a5c80237da4b7b732f7b47afee64d8d1c36c1daddd5e72d976ace91a94418f2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/bundle.json","state_url":"https://pith.science/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/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-08-18T09:50:53Z","links":{"resolver":"https://pith.science/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG","bundle":"https://pith.science/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/bundle.json","state":"https://pith.science/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5LJHMHFPWO4BC4K6SBFR7GAZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X5LJHMHFPWO4BC4K6SBFR7GAZG","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":"611635d8e5dc951f0535422b9f808c960cae7c9a0ae4d786f70a37aad7afb426","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T00:24:48Z","title_canon_sha256":"82904b2722ba3d2a728bfc61e2a6841b4d62220cd2ea621f91e65fccec17b1cc"},"schema_version":"1.0","source":{"id":"2504.16330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16330","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16330v1","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16330","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"X5LJHMHFPWO4","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"X5LJHMHFPWO4BC4K","created_at":"2026-07-05T10:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"X5LJHMHF","created_at":"2026-07-05T10:52:45Z"}],"graph_snapshots":[{"event_id":"sha256:a5c80237da4b7b732f7b47afee64d8d1c36c1daddd5e72d976ace91a94418f2a","target":"graph","created_at":"2026-07-05T10:52:45Z","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/2504.16330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate convexification for convex quadratic optimization with step function penalties. Such problems can be cast as mixed-integer quadratic optimization problems, where binary variables are used to encode the non-convex step function. First, we derive the convex hull for the epigraph of a quadratic function defined by a rank-one matrix and step function penalties. Using this rank-one convexification, we develop copositive and semi-definite relaxations for general convex quadratic functions. Leveraging these findings, we construct convex formulations to the support vector machine proble","authors_text":"Andres Gomez, Shaoning Han, Soobin Choi, Valentina Cepeda","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T00:24:48Z","title":"Rank-one convexification for quadratic optimization problems with step function penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16330","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:7965053e0715db2bc053002436597981f3d544a2c3b165a199dedc269e10dcd5","target":"record","created_at":"2026-07-05T10:52:45Z","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":"611635d8e5dc951f0535422b9f808c960cae7c9a0ae4d786f70a37aad7afb426","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T00:24:48Z","title_canon_sha256":"82904b2722ba3d2a728bfc61e2a6841b4d62220cd2ea621f91e65fccec17b1cc"},"schema_version":"1.0","source":{"id":"2504.16330","kind":"arxiv","version":1}},"canonical_sha256":"bf5693b0e57d9dc08b8af48258fcc0c9b23f9c571143d68d4a6a1738900b8bfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf5693b0e57d9dc08b8af48258fcc0c9b23f9c571143d68d4a6a1738900b8bfa","first_computed_at":"2026-07-05T10:52:45.022541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:45.022541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zxIpuLP6H0KCmmH0cZGK9xOSQOFAJ8n4WXPVyJP5rboRmaxIG35qfooNKAFr75iCveYSmVrd9yP4S8RWeed6AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:45.022930Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.16330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7965053e0715db2bc053002436597981f3d544a2c3b165a199dedc269e10dcd5","sha256:a5c80237da4b7b732f7b47afee64d8d1c36c1daddd5e72d976ace91a94418f2a"],"state_sha256":"8fa956140d08eaa4c0bc537d9496ed31fd392428b8e5cc9fc3b84223e362258e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7YVIU45u9bIf5GtZVRHTefSQRWYdNfX/y7Zl/eYQOKrS5Io5XlU2+3mDRARz62NUJHufRfFN+X9RewQq9CsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:50:53.011767Z","bundle_sha256":"b8fb07d4394a21d87b32521645a602fff055141d576ac9f072ca36d0de2e91b8"}}