{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:COM6LOX4U2IRPLZJHQR4QYZKNU","short_pith_number":"pith:COM6LOX4","schema_version":"1.0","canonical_sha256":"1399e5bafca69117af293c23c8632a6d31269121b4e67a35162ec37d456027d0","source":{"kind":"arxiv","id":"1609.00842","version":1},"attestation_state":"computed","paper":{"title":"Rate of Convergence of the Bundle Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrzej Ruszczynski, Yu Du","submitted_at":"2016-09-03T16:36:18Z","abstract_excerpt":"We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\\varepsilon$ in at most $\\mathcal{O}\\big(\\ln(1/\\varepsilon)/\\varepsilon\\big)$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation."},"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.00842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-03T16:36:18Z","cross_cats_sorted":[],"title_canon_sha256":"22ff2839e1d1483e625cee0a5b0944ebe3b5b7a0fe44c28f7de4a49672570677","abstract_canon_sha256":"5f6a65418d76ecdb5e56f0c3cbe14098615eec014f3925ca046fad290f41d9c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.802689Z","signature_b64":"SA60ZyhoREdfIBjKFOJx26SWPfk/6zTfWaXciiFszUprnRTD9wwiXJu2bEZ1z70+5z5MPM8vi8EkZPEOxQ0yBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1399e5bafca69117af293c23c8632a6d31269121b4e67a35162ec37d456027d0","last_reissued_at":"2026-05-18T01:06:19.802141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.802141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate of Convergence of the Bundle Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrzej Ruszczynski, Yu Du","submitted_at":"2016-09-03T16:36:18Z","abstract_excerpt":"We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\\varepsilon$ in at most $\\mathcal{O}\\big(\\ln(1/\\varepsilon)/\\varepsilon\\big)$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00842","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.00842","created_at":"2026-05-18T01:06:19.802224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00842v1","created_at":"2026-05-18T01:06:19.802224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00842","created_at":"2026-05-18T01:06:19.802224+00:00"},{"alias_kind":"pith_short_12","alias_value":"COM6LOX4U2IR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"COM6LOX4U2IRPLZJ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"COM6LOX4","created_at":"2026-05-18T12:30:09.641336+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/COM6LOX4U2IRPLZJHQR4QYZKNU","json":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU.json","graph_json":"https://pith.science/api/pith-number/COM6LOX4U2IRPLZJHQR4QYZKNU/graph.json","events_json":"https://pith.science/api/pith-number/COM6LOX4U2IRPLZJHQR4QYZKNU/events.json","paper":"https://pith.science/paper/COM6LOX4"},"agent_actions":{"view_html":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU","download_json":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU.json","view_paper":"https://pith.science/paper/COM6LOX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00842&json=true","fetch_graph":"https://pith.science/api/pith-number/COM6LOX4U2IRPLZJHQR4QYZKNU/graph.json","fetch_events":"https://pith.science/api/pith-number/COM6LOX4U2IRPLZJHQR4QYZKNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU/action/storage_attestation","attest_author":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU/action/author_attestation","sign_citation":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU/action/citation_signature","submit_replication":"https://pith.science/pith/COM6LOX4U2IRPLZJHQR4QYZKNU/action/replication_record"}},"created_at":"2026-05-18T01:06:19.802224+00:00","updated_at":"2026-05-18T01:06:19.802224+00:00"}