{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IWNABKKFIFPCO62GY3TELYU45Z","short_pith_number":"pith:IWNABKKF","canonical_record":{"source":{"id":"1502.01787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T04:08:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ccf2384930881c199bddde8654be84849369f6cd0e5cb3dfd397c45e087d183","abstract_canon_sha256":"c28f4fd8c40603e7066b49f44b36c4b3bef55fc152292704f0d6c7a8ece005ef"},"schema_version":"1.0"},"canonical_sha256":"459a00a945415e277b46c6e645e29cee71560d502fac74dcaa821684ba6d9b96","source":{"kind":"arxiv","id":"1502.01787","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01787","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01787v2","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01787","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"pith_short_12","alias_value":"IWNABKKFIFPC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWNABKKFIFPCO62G","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWNABKKF","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IWNABKKFIFPCO62GY3TELYU45Z","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T04:08:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ccf2384930881c199bddde8654be84849369f6cd0e5cb3dfd397c45e087d183","abstract_canon_sha256":"c28f4fd8c40603e7066b49f44b36c4b3bef55fc152292704f0d6c7a8ece005ef"},"schema_version":"1.0"},"canonical_sha256":"459a00a945415e277b46c6e645e29cee71560d502fac74dcaa821684ba6d9b96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:13.869927Z","signature_b64":"D4nkLmTpwIA6KYYXaYfs6gECmVYSb5bgt78uvT2j/WlRBaCjFQGztLsmS7sbNA/LJ29g3DHalQduEW3pwnvLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"459a00a945415e277b46c6e645e29cee71560d502fac74dcaa821684ba6d9b96","last_reissued_at":"2026-05-18T01:37:13.869261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:13.869261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01787","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-18T01:37:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xv54o4BqGq61xxxIvn0rJBo3NL0w3qfBV5xervGYtookVI+uB+OzYSb/znGl/cWgbmw90n0kCVq6uJqo8t6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:10:31.666698Z"},"content_sha256":"81546e166ebec52189eec8ade68cb6ede842127cab85c9964418adb347bae847","schema_version":"1.0","event_id":"sha256:81546e166ebec52189eec8ade68cb6ede842127cab85c9964418adb347bae847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IWNABKKFIFPCO62GY3TELYU45Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A version of bundle method with linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Eberhard, Shuai Liu, Yousong Luo","submitted_at":"2015-02-06T04:08:11Z","abstract_excerpt":"Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each iteration. In this paper, we exploit the feasibility of developing a bundle algorithm that only solves linear subproblems. We start from minimization of a convex function and show that the sequence of major iterations converge to a minimizer. For nonconvex functions we consider functions that are locally Lipschitz continuous and prox-regular on a bounded level set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01787","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-18T01:37:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDwSJhvvJ/VCKiUAZH9BsANHPWjqAgB3egiUQY9PWDLCcuSCBHSdBT8T2imbpsBy0gHoTq8ZFURa0zIfr0RtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:10:31.667240Z"},"content_sha256":"d669a34c018ee5cb363bff34883bb33b37170f72c160917e9154623b7bb4a81a","schema_version":"1.0","event_id":"sha256:d669a34c018ee5cb363bff34883bb33b37170f72c160917e9154623b7bb4a81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWNABKKFIFPCO62GY3TELYU45Z/bundle.json","state_url":"https://pith.science/pith/IWNABKKFIFPCO62GY3TELYU45Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWNABKKFIFPCO62GY3TELYU45Z/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-05-31T18:10:31Z","links":{"resolver":"https://pith.science/pith/IWNABKKFIFPCO62GY3TELYU45Z","bundle":"https://pith.science/pith/IWNABKKFIFPCO62GY3TELYU45Z/bundle.json","state":"https://pith.science/pith/IWNABKKFIFPCO62GY3TELYU45Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWNABKKFIFPCO62GY3TELYU45Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IWNABKKFIFPCO62GY3TELYU45Z","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":"c28f4fd8c40603e7066b49f44b36c4b3bef55fc152292704f0d6c7a8ece005ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T04:08:11Z","title_canon_sha256":"0ccf2384930881c199bddde8654be84849369f6cd0e5cb3dfd397c45e087d183"},"schema_version":"1.0","source":{"id":"1502.01787","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01787","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01787v2","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01787","created_at":"2026-05-18T01:37:13Z"},{"alias_kind":"pith_short_12","alias_value":"IWNABKKFIFPC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWNABKKFIFPCO62G","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWNABKKF","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d669a34c018ee5cb363bff34883bb33b37170f72c160917e9154623b7bb4a81a","target":"graph","created_at":"2026-05-18T01:37:13Z","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":"Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each iteration. In this paper, we exploit the feasibility of developing a bundle algorithm that only solves linear subproblems. We start from minimization of a convex function and show that the sequence of major iterations converge to a minimizer. For nonconvex functions we consider functions that are locally Lipschitz continuous and prox-regular on a bounded level set","authors_text":"Andrew Eberhard, Shuai Liu, Yousong Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T04:08:11Z","title":"A version of bundle method with linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01787","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:81546e166ebec52189eec8ade68cb6ede842127cab85c9964418adb347bae847","target":"record","created_at":"2026-05-18T01:37:13Z","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":"c28f4fd8c40603e7066b49f44b36c4b3bef55fc152292704f0d6c7a8ece005ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T04:08:11Z","title_canon_sha256":"0ccf2384930881c199bddde8654be84849369f6cd0e5cb3dfd397c45e087d183"},"schema_version":"1.0","source":{"id":"1502.01787","kind":"arxiv","version":2}},"canonical_sha256":"459a00a945415e277b46c6e645e29cee71560d502fac74dcaa821684ba6d9b96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"459a00a945415e277b46c6e645e29cee71560d502fac74dcaa821684ba6d9b96","first_computed_at":"2026-05-18T01:37:13.869261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:13.869261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D4nkLmTpwIA6KYYXaYfs6gECmVYSb5bgt78uvT2j/WlRBaCjFQGztLsmS7sbNA/LJ29g3DHalQduEW3pwnvLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:13.869927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01787","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81546e166ebec52189eec8ade68cb6ede842127cab85c9964418adb347bae847","sha256:d669a34c018ee5cb363bff34883bb33b37170f72c160917e9154623b7bb4a81a"],"state_sha256":"f87e57f8278bc144f92cb03aba84582a444c3b98bb215b5c3549f2e09f49f3c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IU4ZNkr5HwPYM46kn1AVOsZvMNuzTNotF869c2K1OQvVR8krahPs8FhZkdeT2AE5QA0DXVcu3l1l5Z4cAM5LBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:10:31.670763Z","bundle_sha256":"bf6c788654e8db839f8851720dedb1c42e9eff9a1a90d74e34fa75ead00800ee"}}