{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HTYWQSWWATPD2XOL5WNBDYJY3G","short_pith_number":"pith:HTYWQSWW","canonical_record":{"source":{"id":"1506.08021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-26T10:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"e6db6bf10b9fda1c224128a1e0548b296a2581469ca4e5a63be5cd359069bf52","abstract_canon_sha256":"8928bdc54179173e82e15c715fb933716549f9d7af26b76b5bcff76e1d429927"},"schema_version":"1.0"},"canonical_sha256":"3cf1684ad604de3d5dcbed9a11e138d99b74a2d97abf57354ba039ee4b317e13","source":{"kind":"arxiv","id":"1506.08021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08021","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08021v1","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08021","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"HTYWQSWWATPD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HTYWQSWWATPD2XOL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HTYWQSWW","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HTYWQSWWATPD2XOL5WNBDYJY3G","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-26T10:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"e6db6bf10b9fda1c224128a1e0548b296a2581469ca4e5a63be5cd359069bf52","abstract_canon_sha256":"8928bdc54179173e82e15c715fb933716549f9d7af26b76b5bcff76e1d429927"},"schema_version":"1.0"},"canonical_sha256":"3cf1684ad604de3d5dcbed9a11e138d99b74a2d97abf57354ba039ee4b317e13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.257608Z","signature_b64":"CPL/6SUQPJyqJQpCUzllomZxW3vn+vVmfv3UzW7FrHow+HPicqJXICF9Z6xxJfkQ+Q3Uly0pKnGnXftgJ4h0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf1684ad604de3d5dcbed9a11e138d99b74a2d97abf57354ba039ee4b317e13","last_reissued_at":"2026-05-18T01:37:48.257076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.257076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08021","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-05-18T01:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJNQYUlnWWWxnlJeLgCH/eNjhoblxevjPv2wj92GPcAmaPUHAwyAhRCBjgGrDXgXVBhVj3Ct34OVJRHC/zXnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:17:41.307359Z"},"content_sha256":"e9225f74442022c7c397f33ba4a30129ee47411d6796d2408f1f09578d33e624","schema_version":"1.0","event_id":"sha256:e9225f74442022c7c397f33ba4a30129ee47411d6796d2408f1f09578d33e624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HTYWQSWWATPD2XOL5WNBDYJY3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A feasible second order bundle algorithm for nonsmooth nonconvex optimization problems with inequality constraints: II. Implementation and numerical results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hannes Fendl, Hermann Schichl","submitted_at":"2015-06-26T10:37:42Z","abstract_excerpt":"This paper presents a concrete implementation of the feasible second order bundle algorithm for nonsmooth, nonconvex optimization problems with inequality constraints \\cite{HannesPaperB}. It computes the search direction by solving a convex quadratically constrained quadratic program. Furthermore, certain versions of the search direction problem are discussed and the applicability of this approach is justified numerically by using different solvers for the computation of the search direction. Finally, the good performance of the second order bundle algorithm is demonstrated by comparison with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08021","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":""},"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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OisBIKYzwc8/jYX84uxBsSAFqCaGJSM10U6A626zi0neideqP/L55KWh71EpV/oU8H4o7KX6t4jky43/ZxyDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:17:41.307708Z"},"content_sha256":"b0b43063701f19e66d5fef79f7912ce89ddf0fc229cfc8f2cd587ae13d1ea3e5","schema_version":"1.0","event_id":"sha256:b0b43063701f19e66d5fef79f7912ce89ddf0fc229cfc8f2cd587ae13d1ea3e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/bundle.json","state_url":"https://pith.science/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/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-11T09:17:41Z","links":{"resolver":"https://pith.science/pith/HTYWQSWWATPD2XOL5WNBDYJY3G","bundle":"https://pith.science/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/bundle.json","state":"https://pith.science/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTYWQSWWATPD2XOL5WNBDYJY3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HTYWQSWWATPD2XOL5WNBDYJY3G","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":"8928bdc54179173e82e15c715fb933716549f9d7af26b76b5bcff76e1d429927","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-26T10:37:42Z","title_canon_sha256":"e6db6bf10b9fda1c224128a1e0548b296a2581469ca4e5a63be5cd359069bf52"},"schema_version":"1.0","source":{"id":"1506.08021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08021","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08021v1","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08021","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"HTYWQSWWATPD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HTYWQSWWATPD2XOL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HTYWQSWW","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:b0b43063701f19e66d5fef79f7912ce89ddf0fc229cfc8f2cd587ae13d1ea3e5","target":"graph","created_at":"2026-05-18T01:37:48Z","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":"This paper presents a concrete implementation of the feasible second order bundle algorithm for nonsmooth, nonconvex optimization problems with inequality constraints \\cite{HannesPaperB}. It computes the search direction by solving a convex quadratically constrained quadratic program. Furthermore, certain versions of the search direction problem are discussed and the applicability of this approach is justified numerically by using different solvers for the computation of the search direction. Finally, the good performance of the second order bundle algorithm is demonstrated by comparison with ","authors_text":"Hannes Fendl, Hermann Schichl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-26T10:37:42Z","title":"A feasible second order bundle algorithm for nonsmooth nonconvex optimization problems with inequality constraints: II. Implementation and numerical results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08021","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:e9225f74442022c7c397f33ba4a30129ee47411d6796d2408f1f09578d33e624","target":"record","created_at":"2026-05-18T01:37:48Z","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":"8928bdc54179173e82e15c715fb933716549f9d7af26b76b5bcff76e1d429927","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-26T10:37:42Z","title_canon_sha256":"e6db6bf10b9fda1c224128a1e0548b296a2581469ca4e5a63be5cd359069bf52"},"schema_version":"1.0","source":{"id":"1506.08021","kind":"arxiv","version":1}},"canonical_sha256":"3cf1684ad604de3d5dcbed9a11e138d99b74a2d97abf57354ba039ee4b317e13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cf1684ad604de3d5dcbed9a11e138d99b74a2d97abf57354ba039ee4b317e13","first_computed_at":"2026-05-18T01:37:48.257076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:48.257076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CPL/6SUQPJyqJQpCUzllomZxW3vn+vVmfv3UzW7FrHow+HPicqJXICF9Z6xxJfkQ+Q3Uly0pKnGnXftgJ4h0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:48.257608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9225f74442022c7c397f33ba4a30129ee47411d6796d2408f1f09578d33e624","sha256:b0b43063701f19e66d5fef79f7912ce89ddf0fc229cfc8f2cd587ae13d1ea3e5"],"state_sha256":"f3c6f09e80afdc87b4b1af6af31a55a8d9a327578b91c8666af7a5c915b0a130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6aqBYDrolcoWe0o3Spm1R7Df4Fvd2nI2vZIy1J/MoVF7wEH9DRcyCmSL6WQj7tkFRhLWbNbnxLO2PHIrMEzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:17:41.309783Z","bundle_sha256":"53bdf38e7240d65c37b46b8bb43fb18ce2fb813c2157e6b409a1dc69a893c4ea"}}