{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PB7A5Y3BIWN5OQXRIWJKOELJU5","short_pith_number":"pith:PB7A5Y3B","schema_version":"1.0","canonical_sha256":"787e0ee361459bd742f14592a71169a751f0176482963fb2faa8ed8f66f8b38c","source":{"kind":"arxiv","id":"1609.02928","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic construction of the subdifferential from directional derivatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Charles Audet, Warren Hare","submitted_at":"2016-09-09T20:08:32Z","abstract_excerpt":"The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context of nonsmooth optimization. The present work proposes algorithms to reconstruct a polyhedral subdifferential of a function from the computation of finitely many directional derivatives. We provide upper bounds on the required number of directional derivatives when the space is $\\R^1$ and $\\R^2$, as well as in $\\R^n$ where subdifferential is known to possess at most three vertices."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.02928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-09T20:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"266b6e50f223c0d523af9814531e4e3f84bca01945691e514211674faf6bdb00","abstract_canon_sha256":"a46f32d6cf7be8e6bf38f717fa9f924c04ed68f60e53c2f2486ba816829757ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:49.344531Z","signature_b64":"Uz8VzyR0Zv56jgyjZQt9H/HtAuBZL7Bt9K+58mNTAM01U8DpGqcbUFXcGLSWtWfQ9G9MnFKrQxinzpVH5q9+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787e0ee361459bd742f14592a71169a751f0176482963fb2faa8ed8f66f8b38c","last_reissued_at":"2026-05-18T01:04:49.344052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:49.344052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic construction of the subdifferential from directional derivatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Charles Audet, Warren Hare","submitted_at":"2016-09-09T20:08:32Z","abstract_excerpt":"The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context of nonsmooth optimization. The present work proposes algorithms to reconstruct a polyhedral subdifferential of a function from the computation of finitely many directional derivatives. We provide upper bounds on the required number of directional derivatives when the space is $\\R^1$ and $\\R^2$, as well as in $\\R^n$ where subdifferential is known to possess at most three vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02928","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.02928","created_at":"2026-05-18T01:04:49.344131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02928v1","created_at":"2026-05-18T01:04:49.344131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02928","created_at":"2026-05-18T01:04:49.344131+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB7A5Y3BIWN5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB7A5Y3BIWN5OQXR","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB7A5Y3B","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5","json":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5.json","graph_json":"https://pith.science/api/pith-number/PB7A5Y3BIWN5OQXRIWJKOELJU5/graph.json","events_json":"https://pith.science/api/pith-number/PB7A5Y3BIWN5OQXRIWJKOELJU5/events.json","paper":"https://pith.science/paper/PB7A5Y3B"},"agent_actions":{"view_html":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5","download_json":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5.json","view_paper":"https://pith.science/paper/PB7A5Y3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02928&json=true","fetch_graph":"https://pith.science/api/pith-number/PB7A5Y3BIWN5OQXRIWJKOELJU5/graph.json","fetch_events":"https://pith.science/api/pith-number/PB7A5Y3BIWN5OQXRIWJKOELJU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5/action/storage_attestation","attest_author":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5/action/author_attestation","sign_citation":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5/action/citation_signature","submit_replication":"https://pith.science/pith/PB7A5Y3BIWN5OQXRIWJKOELJU5/action/replication_record"}},"created_at":"2026-05-18T01:04:49.344131+00:00","updated_at":"2026-05-18T01:04:49.344131+00:00"}