{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BV3SSXENM45BEJKCQI7EMAH6VZ","short_pith_number":"pith:BV3SSXEN","canonical_record":{"source":{"id":"1802.00339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-31T16:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"028d0596df294bea7e505017c2f465ef64cdfd98635a735374eae6240c051398","abstract_canon_sha256":"0717518d908fe9def801f14492c52f6e33a5a8eb08329b825f89179f1110a8e1"},"schema_version":"1.0"},"canonical_sha256":"0d77295c8d673a122542823e4600feae53f75b1a001c42c0a4b84a549db60beb","source":{"kind":"arxiv","id":"1802.00339","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00339","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00339v2","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00339","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"pith_short_12","alias_value":"BV3SSXENM45B","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BV3SSXENM45BEJKC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BV3SSXEN","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BV3SSXENM45BEJKCQI7EMAH6VZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-31T16:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"028d0596df294bea7e505017c2f465ef64cdfd98635a735374eae6240c051398","abstract_canon_sha256":"0717518d908fe9def801f14492c52f6e33a5a8eb08329b825f89179f1110a8e1"},"schema_version":"1.0"},"canonical_sha256":"0d77295c8d673a122542823e4600feae53f75b1a001c42c0a4b84a549db60beb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:08.608463Z","signature_b64":"7iaiR/sSY/hZ8qZvoyJog0vBFL04ptvWffeDUwh5A34BLF/lSDx+FZLKOgj6lJiSNxp3R3Sy4VTKuQkTL+AOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d77295c8d673a122542823e4600feae53f75b1a001c42c0a4b84a549db60beb","last_reissued_at":"2026-05-18T00:22:08.607923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:08.607923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00339","source_version":2,"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-05-18T00:22:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lggWyLJJvanUERAIyY1iQHrDxeMhyPlfKdHzbTbdtFVyiVEtC1Kj3x3sENOXUXyhdBif304e3mmdlvxahckAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:23:08.379285Z"},"content_sha256":"28af42295f44c2e4a1d79e9c87a731e3e251c95e5974949eeaf0502c4b411d26","schema_version":"1.0","event_id":"sha256:28af42295f44c2e4a1d79e9c87a731e3e251c95e5974949eeaf0502c4b411d26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BV3SSXENM45BEJKCQI7EMAH6VZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Adaptive Step-size Choice for Iterative Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Igor Konnov","submitted_at":"2018-01-31T16:10:36Z","abstract_excerpt":"We suggest a simple adaptive step-size procedure, which does not require any line-search, for a general class of nonlinear optimization methods and prove convergence of a general method under mild assumptions. In particular, the goal function may be non-smooth and non-convex. Unlike the descent line-search methods, it does not require monotone decrease of the goal function values along the iteration points and reduces the implementation cost of each iteration essentially. The key element of this procedure consists in inserting a majorant step-size sequence such that the next element is taken o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00339","kind":"arxiv","version":2},"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"},"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-05-18T00:22:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0c7XWG1N4Unfb6VgQc3GdJ1gPEKTUr40anzJwcPSg1XXEOp5HhcVAmxy0Zo2HkhlkK/xrIqGXwNZ6PxqZkwwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:23:08.379662Z"},"content_sha256":"216238c214aa580aa615e08e9b0bfc15598c4d8810c69ac5acb9fd87e0ff6458","schema_version":"1.0","event_id":"sha256:216238c214aa580aa615e08e9b0bfc15598c4d8810c69ac5acb9fd87e0ff6458"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/bundle.json","state_url":"https://pith.science/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/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-06-24T22:23:08Z","links":{"resolver":"https://pith.science/pith/BV3SSXENM45BEJKCQI7EMAH6VZ","bundle":"https://pith.science/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/bundle.json","state":"https://pith.science/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BV3SSXENM45BEJKCQI7EMAH6VZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BV3SSXENM45BEJKCQI7EMAH6VZ","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":"0717518d908fe9def801f14492c52f6e33a5a8eb08329b825f89179f1110a8e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-31T16:10:36Z","title_canon_sha256":"028d0596df294bea7e505017c2f465ef64cdfd98635a735374eae6240c051398"},"schema_version":"1.0","source":{"id":"1802.00339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00339","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00339v2","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00339","created_at":"2026-05-18T00:22:08Z"},{"alias_kind":"pith_short_12","alias_value":"BV3SSXENM45B","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BV3SSXENM45BEJKC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BV3SSXEN","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:216238c214aa580aa615e08e9b0bfc15598c4d8810c69ac5acb9fd87e0ff6458","target":"graph","created_at":"2026-05-18T00:22:08Z","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"},"paper":{"abstract_excerpt":"We suggest a simple adaptive step-size procedure, which does not require any line-search, for a general class of nonlinear optimization methods and prove convergence of a general method under mild assumptions. In particular, the goal function may be non-smooth and non-convex. Unlike the descent line-search methods, it does not require monotone decrease of the goal function values along the iteration points and reduces the implementation cost of each iteration essentially. The key element of this procedure consists in inserting a majorant step-size sequence such that the next element is taken o","authors_text":"Igor Konnov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-31T16:10:36Z","title":"A Simple Adaptive Step-size Choice for Iterative Optimization Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00339","kind":"arxiv","version":2},"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:28af42295f44c2e4a1d79e9c87a731e3e251c95e5974949eeaf0502c4b411d26","target":"record","created_at":"2026-05-18T00:22:08Z","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":"0717518d908fe9def801f14492c52f6e33a5a8eb08329b825f89179f1110a8e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-31T16:10:36Z","title_canon_sha256":"028d0596df294bea7e505017c2f465ef64cdfd98635a735374eae6240c051398"},"schema_version":"1.0","source":{"id":"1802.00339","kind":"arxiv","version":2}},"canonical_sha256":"0d77295c8d673a122542823e4600feae53f75b1a001c42c0a4b84a549db60beb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d77295c8d673a122542823e4600feae53f75b1a001c42c0a4b84a549db60beb","first_computed_at":"2026-05-18T00:22:08.607923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:08.607923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7iaiR/sSY/hZ8qZvoyJog0vBFL04ptvWffeDUwh5A34BLF/lSDx+FZLKOgj6lJiSNxp3R3Sy4VTKuQkTL+AOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:08.608463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28af42295f44c2e4a1d79e9c87a731e3e251c95e5974949eeaf0502c4b411d26","sha256:216238c214aa580aa615e08e9b0bfc15598c4d8810c69ac5acb9fd87e0ff6458"],"state_sha256":"d855f9d9e36a790352a9ff09f7bde2ebe9870a7a9cde6618fcf15e6cec68591d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owu1UW4l9Be97FLLjTLlxg9A8OaNXW7m0UrdCj0JGtG2TnfVJn9r5O17wl4qt8lmk7EgGclCRo4hRedyPc+RDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:23:08.381666Z","bundle_sha256":"dd90c9795818d47742c4a28ea198476e9cb526c94236ff815a56c815528ddab6"}}