{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EYFMYMBLXMW2FX75RL6TR5UAJS","short_pith_number":"pith:EYFMYMBL","canonical_record":{"source":{"id":"1804.11003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-29T23:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"5ee3ba8a04dcff499419c74119c79ca5f333aa959ca644782f808bdfc0682b47","abstract_canon_sha256":"568aeac155991b5361d8c70cb1eedbda7ca9932eecf7c8bb9e0de8e2bb427ef5"},"schema_version":"1.0"},"canonical_sha256":"260acc302bbb2da2dffd8afd38f6804ca48c0ea21c6380ab40cbf9702fab283b","source":{"kind":"arxiv","id":"1804.11003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11003","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11003v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11003","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"EYFMYMBLXMW2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYFMYMBLXMW2FX75","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYFMYMBL","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EYFMYMBLXMW2FX75RL6TR5UAJS","target":"record","payload":{"canonical_record":{"source":{"id":"1804.11003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-29T23:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"5ee3ba8a04dcff499419c74119c79ca5f333aa959ca644782f808bdfc0682b47","abstract_canon_sha256":"568aeac155991b5361d8c70cb1eedbda7ca9932eecf7c8bb9e0de8e2bb427ef5"},"schema_version":"1.0"},"canonical_sha256":"260acc302bbb2da2dffd8afd38f6804ca48c0ea21c6380ab40cbf9702fab283b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.917995Z","signature_b64":"NgN1gjVZzYwCcnYfk+kVBmo5wrqK9W9x48cz8VVp0gwuHRYRKikvbJ+1Yr0MUOmywFwUCi2GJA9yzu7dAu5wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"260acc302bbb2da2dffd8afd38f6804ca48c0ea21c6380ab40cbf9702fab283b","last_reissued_at":"2026-05-18T00:17:14.917386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.917386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.11003","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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utWB8w3xt1IgNfSV6bGHPZwKWoTMA83Qxqvm1F9ruoyV1ZEHNI2TTfPc0UzqJlUQiIaNpjLb5Ru5Z55mzzYyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:34.256465Z"},"content_sha256":"89d778a09ac13cbf7efe146078a7b818e8d6b73525ab3e68b9a8ca3c70c8e061","schema_version":"1.0","event_id":"sha256:89d778a09ac13cbf7efe146078a7b818e8d6b73525ab3e68b9a8ca3c70c8e061"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EYFMYMBLXMW2FX75RL6TR5UAJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Sampling Methods for Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Frank E. Curtis, James V. Burke, Lucas E.A. Sim\\~oes, Michael L. Overton","submitted_at":"2018-04-29T23:18:37Z","abstract_excerpt":"This paper reviews the gradient sampling methodology for solving nonsmooth, nonconvex optimization problems. An intuitively straightforward gradient sampling algorithm is stated and its convergence properties are summarized. Throughout this discussion, we emphasize the simplicity of gradient sampling as an extension of the steepest descent method for minimizing smooth objectives. We then provide overviews of various enhancements that have been proposed to improve practical performance, as well as of several extensions that have been made in the literature, such as to solve constrained problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11003","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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuXfDff3oFMKuBPdlY0A+lD+V0mzL0VdvApnKkAIj/Vdvz1s83NBVWv01PdWqpeXzOhHdQPmgKinWwrspEuFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:34.256819Z"},"content_sha256":"a68dee4174fcc5aa6d098e0faa094787428098716fbfe31f40c8df11d9b6fc0a","schema_version":"1.0","event_id":"sha256:a68dee4174fcc5aa6d098e0faa094787428098716fbfe31f40c8df11d9b6fc0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/bundle.json","state_url":"https://pith.science/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/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-03T16:07:34Z","links":{"resolver":"https://pith.science/pith/EYFMYMBLXMW2FX75RL6TR5UAJS","bundle":"https://pith.science/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/bundle.json","state":"https://pith.science/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYFMYMBLXMW2FX75RL6TR5UAJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EYFMYMBLXMW2FX75RL6TR5UAJS","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":"568aeac155991b5361d8c70cb1eedbda7ca9932eecf7c8bb9e0de8e2bb427ef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-29T23:18:37Z","title_canon_sha256":"5ee3ba8a04dcff499419c74119c79ca5f333aa959ca644782f808bdfc0682b47"},"schema_version":"1.0","source":{"id":"1804.11003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11003","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11003v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11003","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"EYFMYMBLXMW2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYFMYMBLXMW2FX75","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYFMYMBL","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a68dee4174fcc5aa6d098e0faa094787428098716fbfe31f40c8df11d9b6fc0a","target":"graph","created_at":"2026-05-18T00:17:14Z","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 reviews the gradient sampling methodology for solving nonsmooth, nonconvex optimization problems. An intuitively straightforward gradient sampling algorithm is stated and its convergence properties are summarized. Throughout this discussion, we emphasize the simplicity of gradient sampling as an extension of the steepest descent method for minimizing smooth objectives. We then provide overviews of various enhancements that have been proposed to improve practical performance, as well as of several extensions that have been made in the literature, such as to solve constrained problems","authors_text":"Adrian S. Lewis, Frank E. Curtis, James V. Burke, Lucas E.A. Sim\\~oes, Michael L. Overton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-29T23:18:37Z","title":"Gradient Sampling Methods for Nonsmooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11003","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:89d778a09ac13cbf7efe146078a7b818e8d6b73525ab3e68b9a8ca3c70c8e061","target":"record","created_at":"2026-05-18T00:17:14Z","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":"568aeac155991b5361d8c70cb1eedbda7ca9932eecf7c8bb9e0de8e2bb427ef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-29T23:18:37Z","title_canon_sha256":"5ee3ba8a04dcff499419c74119c79ca5f333aa959ca644782f808bdfc0682b47"},"schema_version":"1.0","source":{"id":"1804.11003","kind":"arxiv","version":1}},"canonical_sha256":"260acc302bbb2da2dffd8afd38f6804ca48c0ea21c6380ab40cbf9702fab283b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"260acc302bbb2da2dffd8afd38f6804ca48c0ea21c6380ab40cbf9702fab283b","first_computed_at":"2026-05-18T00:17:14.917386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.917386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NgN1gjVZzYwCcnYfk+kVBmo5wrqK9W9x48cz8VVp0gwuHRYRKikvbJ+1Yr0MUOmywFwUCi2GJA9yzu7dAu5wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.917995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d778a09ac13cbf7efe146078a7b818e8d6b73525ab3e68b9a8ca3c70c8e061","sha256:a68dee4174fcc5aa6d098e0faa094787428098716fbfe31f40c8df11d9b6fc0a"],"state_sha256":"23b9d35acea50abb17217613eb21db14c2b0c17191c259a77f3f5923578065fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yN87/pcwtHcTr/PrmYDrK3//4G/xcYwnV+P9oCOIvzmdWnmGvf/nA2tXbRLVL7rLYjScmbwpUmE4abB5tSR9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:07:34.258773Z","bundle_sha256":"2ee2ddcd594970243350b1067536f2950fb89327b4d42b1dbc7280ef5918542e"}}