{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AUL3YC5EVK6KNGOMX3YS2425N4","short_pith_number":"pith:AUL3YC5E","schema_version":"1.0","canonical_sha256":"0517bc0ba4aabca699ccbef12d735d6f02354401316898f11461e650019b6e8e","source":{"kind":"arxiv","id":"1807.03134","version":1},"attestation_state":"computed","paper":{"title":"Partial smoothness and constant rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Jingwei Liang","submitted_at":"2018-07-09T13:44:27Z","abstract_excerpt":"The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions. As a consequence, the standard first-order conditions guarantee that diverse iterative algorithms (and post-optimality analyses) identify active structure or constraints. However, by instead focusing directly on the first-order conditions, the formal concept of partial smoothness simplifies dramatically: in basic differential geometric language, it is just a constant-rank condition. In this view, partial smoothness extends to more general mappings, such as "},"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":"1807.03134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T13:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"695d0c3b02e706126a08bbee5768f28c8a94974b5b6800c23d5c724e8e180b5a","abstract_canon_sha256":"fd1ac0f16456aaeadab65f36c69115b5ed65a9260434ab37c1b274cbaf68fd20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:12.686150Z","signature_b64":"AEqWtEygzlhnj4G1Yk6tYeBMVR43NPfcH2AcFOf4apfhUQ/tKMSWC/LA4V1gNKsdBdXaZyOV9Dx4XeERkTrCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0517bc0ba4aabca699ccbef12d735d6f02354401316898f11461e650019b6e8e","last_reissued_at":"2026-05-18T00:11:12.685461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:12.685461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial smoothness and constant rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Jingwei Liang","submitted_at":"2018-07-09T13:44:27Z","abstract_excerpt":"The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions. As a consequence, the standard first-order conditions guarantee that diverse iterative algorithms (and post-optimality analyses) identify active structure or constraints. However, by instead focusing directly on the first-order conditions, the formal concept of partial smoothness simplifies dramatically: in basic differential geometric language, it is just a constant-rank condition. In this view, partial smoothness extends to more general mappings, such as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03134","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":"1807.03134","created_at":"2026-05-18T00:11:12.685570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03134v1","created_at":"2026-05-18T00:11:12.685570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03134","created_at":"2026-05-18T00:11:12.685570+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUL3YC5EVK6K","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUL3YC5EVK6KNGOM","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUL3YC5E","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.12260","citing_title":"On the resolution of $\\ell_1$-norm minimization via a two-metric adaptive projection method","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4","json":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4.json","graph_json":"https://pith.science/api/pith-number/AUL3YC5EVK6KNGOMX3YS2425N4/graph.json","events_json":"https://pith.science/api/pith-number/AUL3YC5EVK6KNGOMX3YS2425N4/events.json","paper":"https://pith.science/paper/AUL3YC5E"},"agent_actions":{"view_html":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4","download_json":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4.json","view_paper":"https://pith.science/paper/AUL3YC5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03134&json=true","fetch_graph":"https://pith.science/api/pith-number/AUL3YC5EVK6KNGOMX3YS2425N4/graph.json","fetch_events":"https://pith.science/api/pith-number/AUL3YC5EVK6KNGOMX3YS2425N4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4/action/storage_attestation","attest_author":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4/action/author_attestation","sign_citation":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4/action/citation_signature","submit_replication":"https://pith.science/pith/AUL3YC5EVK6KNGOMX3YS2425N4/action/replication_record"}},"created_at":"2026-05-18T00:11:12.685570+00:00","updated_at":"2026-05-18T00:11:12.685570+00:00"}