{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DRJWQTNYJFFXDBS5Y7GMMUKDZJ","short_pith_number":"pith:DRJWQTNY","canonical_record":{"source":{"id":"1902.08825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-23T18:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"2b85d53ddebfcff1d6f2285b4850f3254db6802b1ede919e5b5ce4702579a868","abstract_canon_sha256":"25b709f73676395ba9c1fbcd9b8b3b52dd824d3e834bb4f989b4142f9ffd365b"},"schema_version":"1.0"},"canonical_sha256":"1c53684db8494b71865dc7ccc65143ca66502e9ba0b8fa9443ed9d0c233a96df","source":{"kind":"arxiv","id":"1902.08825","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08825","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08825v3","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08825","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"DRJWQTNYJFFX","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"DRJWQTNYJFFXDBS5","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"DRJWQTNY","created_at":"2026-07-05T00:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DRJWQTNYJFFXDBS5Y7GMMUKDZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-23T18:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"2b85d53ddebfcff1d6f2285b4850f3254db6802b1ede919e5b5ce4702579a868","abstract_canon_sha256":"25b709f73676395ba9c1fbcd9b8b3b52dd824d3e834bb4f989b4142f9ffd365b"},"schema_version":"1.0"},"canonical_sha256":"1c53684db8494b71865dc7ccc65143ca66502e9ba0b8fa9443ed9d0c233a96df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:37.284444Z","signature_b64":"tabyTxFbElHY3HqZ3dScxRwH8ST1kZas5XfdT3so9RoCramXFvDwIZiBJFJwIseEu0qI41H+XWOF4oezn9fFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c53684db8494b71865dc7ccc65143ca66502e9ba0b8fa9443ed9d0c233a96df","last_reissued_at":"2026-07-05T00:29:37.283946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:37.283946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08825","source_version":3,"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-05T00:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/s3HpCpKxx3Wdvk52Eoy3yzalAtN6y9HIz4okkl4cNMAOgSTX+zOAscefeVLjFv8JsPk4GZpK+jX2+JsbRpoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:12:49.773430Z"},"content_sha256":"73fdba2f5b34c9e809cad02bfdc2f320d1d5ad7be0d0971d7b385b22620df42b","schema_version":"1.0","event_id":"sha256:73fdba2f5b34c9e809cad02bfdc2f320d1d5ad7be0d0971d7b385b22620df42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DRJWQTNYJFFXDBS5Y7GMMUKDZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andre Wibisono, Ashia Wilson, Lester Mackey","submitted_at":"2019-02-23T18:35:49Z","abstract_excerpt":"We present a family of algorithms, called descent algorithms, for optimizing convex and non-convex functions. We also introduce a new first-order algorithm, called rescaled gradient descent (RGD), and show that RGD achieves a faster convergence rate than gradient descent provided the function is strongly smooth -- a natural generalization of the standard smoothness assumption on the objective function. When the objective function is convex, we present two novel frameworks for \"accelerating\" descent methods, one in the style of Nesterov and the other in the style of Monteiro and Svaiter, using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08825","kind":"arxiv","version":3},"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/1902.08825/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-05T00:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOAom6OAkag03Psjt1QpQIlHkN1XBCNvCwD5zsxYov2d0rynl4uGVmoOu1VselFDR6PfuzJE1PEe+89xPNRUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:12:49.773932Z"},"content_sha256":"70fd4c4f41cb223a6f7f6fc12585776d381ee8fa5d8d0d7976253fc8f5ee06e1","schema_version":"1.0","event_id":"sha256:70fd4c4f41cb223a6f7f6fc12585776d381ee8fa5d8d0d7976253fc8f5ee06e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/bundle.json","state_url":"https://pith.science/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/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-16T12:12:49Z","links":{"resolver":"https://pith.science/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ","bundle":"https://pith.science/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/bundle.json","state":"https://pith.science/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRJWQTNYJFFXDBS5Y7GMMUKDZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DRJWQTNYJFFXDBS5Y7GMMUKDZJ","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":"25b709f73676395ba9c1fbcd9b8b3b52dd824d3e834bb4f989b4142f9ffd365b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-23T18:35:49Z","title_canon_sha256":"2b85d53ddebfcff1d6f2285b4850f3254db6802b1ede919e5b5ce4702579a868"},"schema_version":"1.0","source":{"id":"1902.08825","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08825","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08825v3","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08825","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"DRJWQTNYJFFX","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"DRJWQTNYJFFXDBS5","created_at":"2026-07-05T00:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"DRJWQTNY","created_at":"2026-07-05T00:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:70fd4c4f41cb223a6f7f6fc12585776d381ee8fa5d8d0d7976253fc8f5ee06e1","target":"graph","created_at":"2026-07-05T00:29:37Z","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/1902.08825/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a family of algorithms, called descent algorithms, for optimizing convex and non-convex functions. We also introduce a new first-order algorithm, called rescaled gradient descent (RGD), and show that RGD achieves a faster convergence rate than gradient descent provided the function is strongly smooth -- a natural generalization of the standard smoothness assumption on the objective function. When the objective function is convex, we present two novel frameworks for \"accelerating\" descent methods, one in the style of Nesterov and the other in the style of Monteiro and Svaiter, using ","authors_text":"Andre Wibisono, Ashia Wilson, Lester Mackey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-23T18:35:49Z","title":"Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08825","kind":"arxiv","version":3},"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:73fdba2f5b34c9e809cad02bfdc2f320d1d5ad7be0d0971d7b385b22620df42b","target":"record","created_at":"2026-07-05T00:29:37Z","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":"25b709f73676395ba9c1fbcd9b8b3b52dd824d3e834bb4f989b4142f9ffd365b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-23T18:35:49Z","title_canon_sha256":"2b85d53ddebfcff1d6f2285b4850f3254db6802b1ede919e5b5ce4702579a868"},"schema_version":"1.0","source":{"id":"1902.08825","kind":"arxiv","version":3}},"canonical_sha256":"1c53684db8494b71865dc7ccc65143ca66502e9ba0b8fa9443ed9d0c233a96df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c53684db8494b71865dc7ccc65143ca66502e9ba0b8fa9443ed9d0c233a96df","first_computed_at":"2026-07-05T00:29:37.283946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:37.283946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tabyTxFbElHY3HqZ3dScxRwH8ST1kZas5XfdT3so9RoCramXFvDwIZiBJFJwIseEu0qI41H+XWOF4oezn9fFDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:37.284444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08825","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73fdba2f5b34c9e809cad02bfdc2f320d1d5ad7be0d0971d7b385b22620df42b","sha256:70fd4c4f41cb223a6f7f6fc12585776d381ee8fa5d8d0d7976253fc8f5ee06e1"],"state_sha256":"a1ada64790830a20f399ecd0bbabe8514e742444d91cb5cd602291524604dfd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWuBPijZsiNcOd8H1Wo6mrNQreN3iL2EhQtdVUXiIBaYWOmd1Jrj9IC8EqtG19OzM+bNc6XX2+X9PBJjPwhKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:12:49.778312Z","bundle_sha256":"42d56b2b0ec7d673cd1980f41b8444fad46c887c6d992f0e6c54580ef6f0d2f6"}}