{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:E22MLLXUXAL4SGF4G2VF33PXOV","short_pith_number":"pith:E22MLLXU","canonical_record":{"source":{"id":"2507.19465","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T17:50:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d4ae4974f9788a0e9532b5a8ed460d447a2a6f961eec2aab75721135b54d5e2e","abstract_canon_sha256":"649856bcf001318cced5f0e3c3fe0dd7be5dc1fe607c82b428b35f115bc02fd0"},"schema_version":"1.0"},"canonical_sha256":"26b4c5aef4b817c918bc36aa5dedf77557aa36c78e3d1135506aba5bce2748e4","source":{"kind":"arxiv","id":"2507.19465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19465","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19465v1","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19465","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"E22MLLXUXAL4","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"E22MLLXUXAL4SGF4","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"E22MLLXU","created_at":"2026-07-05T11:43:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:E22MLLXUXAL4SGF4G2VF33PXOV","target":"record","payload":{"canonical_record":{"source":{"id":"2507.19465","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T17:50:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d4ae4974f9788a0e9532b5a8ed460d447a2a6f961eec2aab75721135b54d5e2e","abstract_canon_sha256":"649856bcf001318cced5f0e3c3fe0dd7be5dc1fe607c82b428b35f115bc02fd0"},"schema_version":"1.0"},"canonical_sha256":"26b4c5aef4b817c918bc36aa5dedf77557aa36c78e3d1135506aba5bce2748e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:25.705051Z","signature_b64":"l4UEeap+8RePuA6cjdLMKi1QUzLVQe3uTkImgbj/4+ggyrE2w5WXHCvSLb9HsK6KDoAltel2eq8J6oNDtWAjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b4c5aef4b817c918bc36aa5dedf77557aa36c78e3d1135506aba5bce2748e4","last_reissued_at":"2026-07-05T11:43:25.704573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:25.704573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.19465","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-07-05T11:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8asm71vhqD0/u6eOQXVwFSm8vBBQmUHE10GAOqLsHJaRDqzwqu+z2m/PA1BvD0sgyCvz7R6benowwBmzH7g8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:15:48.038541Z"},"content_sha256":"486be689aa01891979b33d4b22ee90a06d2f934e9484a8ad7375c2162a9937e6","schema_version":"1.0","event_id":"sha256:486be689aa01891979b33d4b22ee90a06d2f934e9484a8ad7375c2162a9937e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:E22MLLXUXAL4SGF4G2VF33PXOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Suvrit Sra, Zhe Zhang","submitted_at":"2025-07-25T17:50:43Z","abstract_excerpt":"We develop efficient algorithms for optimizing piecewise smooth (PWS) functions where the underlying partition of the domain into smooth pieces is \\emph{unknown}. For PWS functions satisfying a quadratic growth (QG) condition, we propose a bundle-level (BL) type method that achieves global linear convergence -- to our knowledge, the first such result for any algorithm for this problem class. We extend this method to handle approximately PWS functions and to solve weakly-convex PWS problems, improving the state-of-the-art complexity to match the benchmark for smooth non-convex optimization. Fur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19465/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/pSHQPoU5+nDZbQlbyfLHa/Jj3CfPDu/ZR9D6eIJdEZimODX3m/j2ZFXgkcyG8J47xL4qS+a1pcoVqSDf+9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:15:48.039470Z"},"content_sha256":"6f490d4157707bbb059263c3293b4e2a2d570b4594c6d97484dc124b9cbfabd2","schema_version":"1.0","event_id":"sha256:6f490d4157707bbb059263c3293b4e2a2d570b4594c6d97484dc124b9cbfabd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E22MLLXUXAL4SGF4G2VF33PXOV/bundle.json","state_url":"https://pith.science/pith/E22MLLXUXAL4SGF4G2VF33PXOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E22MLLXUXAL4SGF4G2VF33PXOV/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-08-08T02:15:48Z","links":{"resolver":"https://pith.science/pith/E22MLLXUXAL4SGF4G2VF33PXOV","bundle":"https://pith.science/pith/E22MLLXUXAL4SGF4G2VF33PXOV/bundle.json","state":"https://pith.science/pith/E22MLLXUXAL4SGF4G2VF33PXOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E22MLLXUXAL4SGF4G2VF33PXOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:E22MLLXUXAL4SGF4G2VF33PXOV","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":"649856bcf001318cced5f0e3c3fe0dd7be5dc1fe607c82b428b35f115bc02fd0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T17:50:43Z","title_canon_sha256":"d4ae4974f9788a0e9532b5a8ed460d447a2a6f961eec2aab75721135b54d5e2e"},"schema_version":"1.0","source":{"id":"2507.19465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19465","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19465v1","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19465","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"E22MLLXUXAL4","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"E22MLLXUXAL4SGF4","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"E22MLLXU","created_at":"2026-07-05T11:43:25Z"}],"graph_snapshots":[{"event_id":"sha256:6f490d4157707bbb059263c3293b4e2a2d570b4594c6d97484dc124b9cbfabd2","target":"graph","created_at":"2026-07-05T11:43:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.19465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop efficient algorithms for optimizing piecewise smooth (PWS) functions where the underlying partition of the domain into smooth pieces is \\emph{unknown}. For PWS functions satisfying a quadratic growth (QG) condition, we propose a bundle-level (BL) type method that achieves global linear convergence -- to our knowledge, the first such result for any algorithm for this problem class. We extend this method to handle approximately PWS functions and to solve weakly-convex PWS problems, improving the state-of-the-art complexity to match the benchmark for smooth non-convex optimization. Fur","authors_text":"Suvrit Sra, Zhe Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T17:50:43Z","title":"Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19465","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:486be689aa01891979b33d4b22ee90a06d2f934e9484a8ad7375c2162a9937e6","target":"record","created_at":"2026-07-05T11:43:25Z","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":"649856bcf001318cced5f0e3c3fe0dd7be5dc1fe607c82b428b35f115bc02fd0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T17:50:43Z","title_canon_sha256":"d4ae4974f9788a0e9532b5a8ed460d447a2a6f961eec2aab75721135b54d5e2e"},"schema_version":"1.0","source":{"id":"2507.19465","kind":"arxiv","version":1}},"canonical_sha256":"26b4c5aef4b817c918bc36aa5dedf77557aa36c78e3d1135506aba5bce2748e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26b4c5aef4b817c918bc36aa5dedf77557aa36c78e3d1135506aba5bce2748e4","first_computed_at":"2026-07-05T11:43:25.704573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:25.704573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4UEeap+8RePuA6cjdLMKi1QUzLVQe3uTkImgbj/4+ggyrE2w5WXHCvSLb9HsK6KDoAltel2eq8J6oNDtWAjCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:25.705051Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:486be689aa01891979b33d4b22ee90a06d2f934e9484a8ad7375c2162a9937e6","sha256:6f490d4157707bbb059263c3293b4e2a2d570b4594c6d97484dc124b9cbfabd2"],"state_sha256":"c59c20ae3d0b9243ede454035dcbbe89118c1b6ba0b8254120f33350d90561c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIfIm6D0U6WniDsMeRyMycXTNKmoToWYjorlcdd4DhRnO64VZpZtFJJd1JBDyA2TdakJm4cVVbO+skmEe82sDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T02:15:48.098916Z","bundle_sha256":"190d85cf988ccd0e4553487e1e6ec5896dd768444a775335b9943ba1305eba2d"}}