{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SNUGQI5BNL2KWCDXSD3HIIQ7B2","short_pith_number":"pith:SNUGQI5B","schema_version":"1.0","canonical_sha256":"93686823a16af4ab087790f674221f0e91588f861a3b399d10fdfc9fc47d47c2","source":{"kind":"arxiv","id":"1808.06274","version":1},"attestation_state":"computed","paper":{"title":"Iteration-Complexity of the Subgradient Method on Riemannian Manifolds with Lower Bounded Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"L. F. Prudente, M. S. Louzeiro, O. P. Ferreira","submitted_at":"2018-08-20T00:18:24Z","abstract_excerpt":"The subgradient method for convex optimization problems on complete Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. Iteration-complexity bounds of the subgradient method with exogenous step-size and Polyak's step-size are stablished, completing and improving recent results on the subject."},"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":"1808.06274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-20T00:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"3d50daac99779fb0c6b6897acbf3a44e57ac2825da59b49835c09b7422e0262b","abstract_canon_sha256":"f2c22734046827255be18cd5a1272fb12a99d17466d54435db166ad3aec1d3bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:45.497031Z","signature_b64":"gHOtDAJYoL8XBTwruL8ZEj4zbq4K1+9xjRZiD+HWcWcK/xlVMl3iY+3PQlbIvVyEFImypNtIVK4iqX3gxdESAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93686823a16af4ab087790f674221f0e91588f861a3b399d10fdfc9fc47d47c2","last_reissued_at":"2026-05-18T00:07:45.496424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:45.496424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration-Complexity of the Subgradient Method on Riemannian Manifolds with Lower Bounded Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"L. F. Prudente, M. S. Louzeiro, O. P. Ferreira","submitted_at":"2018-08-20T00:18:24Z","abstract_excerpt":"The subgradient method for convex optimization problems on complete Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. Iteration-complexity bounds of the subgradient method with exogenous step-size and Polyak's step-size are stablished, completing and improving recent results on the subject."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06274","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":"1808.06274","created_at":"2026-05-18T00:07:45.496529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06274v1","created_at":"2026-05-18T00:07:45.496529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06274","created_at":"2026-05-18T00:07:45.496529+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNUGQI5BNL2K","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNUGQI5BNL2KWCDX","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNUGQI5B","created_at":"2026-05-18T12:32:53.628368+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/SNUGQI5BNL2KWCDXSD3HIIQ7B2","json":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2.json","graph_json":"https://pith.science/api/pith-number/SNUGQI5BNL2KWCDXSD3HIIQ7B2/graph.json","events_json":"https://pith.science/api/pith-number/SNUGQI5BNL2KWCDXSD3HIIQ7B2/events.json","paper":"https://pith.science/paper/SNUGQI5B"},"agent_actions":{"view_html":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2","download_json":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2.json","view_paper":"https://pith.science/paper/SNUGQI5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06274&json=true","fetch_graph":"https://pith.science/api/pith-number/SNUGQI5BNL2KWCDXSD3HIIQ7B2/graph.json","fetch_events":"https://pith.science/api/pith-number/SNUGQI5BNL2KWCDXSD3HIIQ7B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2/action/storage_attestation","attest_author":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2/action/author_attestation","sign_citation":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2/action/citation_signature","submit_replication":"https://pith.science/pith/SNUGQI5BNL2KWCDXSD3HIIQ7B2/action/replication_record"}},"created_at":"2026-05-18T00:07:45.496529+00:00","updated_at":"2026-05-18T00:07:45.496529+00:00"}