{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7UPZMEOA6OEWXEMGUMKX7TW54E","short_pith_number":"pith:7UPZMEOA","canonical_record":{"source":{"id":"2308.06775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-13T14:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"2eb5f3f6f36f8d5993ddfa4e181766fadce9e02bede56805079a1052e73e47bb","abstract_canon_sha256":"2af86bab38a1b5099ab89f6b5e0172d2a41ca425be4b6495284b0933ac86aa80"},"schema_version":"1.0"},"canonical_sha256":"fd1f9611c0f3896b9186a3157fcedde11539203d33285a77188f4f3cbc36d6f4","source":{"kind":"arxiv","id":"2308.06775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06775","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06775v1","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06775","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"7UPZMEOA6OEW","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_16","alias_value":"7UPZMEOA6OEWXEMG","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_8","alias_value":"7UPZMEOA","created_at":"2026-07-05T06:40:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7UPZMEOA6OEWXEMGUMKX7TW54E","target":"record","payload":{"canonical_record":{"source":{"id":"2308.06775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-13T14:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"2eb5f3f6f36f8d5993ddfa4e181766fadce9e02bede56805079a1052e73e47bb","abstract_canon_sha256":"2af86bab38a1b5099ab89f6b5e0172d2a41ca425be4b6495284b0933ac86aa80"},"schema_version":"1.0"},"canonical_sha256":"fd1f9611c0f3896b9186a3157fcedde11539203d33285a77188f4f3cbc36d6f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:44.942280Z","signature_b64":"RYGdmSXefx3yTXRLwr//9XV5B7xw7xlByUKDXT8hyUBAEm8e/rsi/AS8a+1E8zxw5Rdn+Kv8IW+GrOiOnmbZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd1f9611c0f3896b9186a3157fcedde11539203d33285a77188f4f3cbc36d6f4","last_reissued_at":"2026-07-05T06:40:44.941925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:44.941925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.06775","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-05T06:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S16Drq1SpDFcWdmhmxDhItSvTS/n3bRJqCAdlQuyAMTQHVEvATbNGKFkq5zl56XCoicxEALarcVtea5Rip9pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:24:10.763329Z"},"content_sha256":"bc8fd745cdadb9766275f1eefec48e2b286334a4756a097ddb58abfd7e8a24c1","schema_version":"1.0","event_id":"sha256:bc8fd745cdadb9766275f1eefec48e2b286334a4756a097ddb58abfd7e8a24c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7UPZMEOA6OEWXEMGUMKX7TW54E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Gradient Descent in the Viewpoint of Graduated Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Da Li, Jingjing Wu, Qingrun Zhang","submitted_at":"2023-08-13T14:02:35Z","abstract_excerpt":"Stochastic gradient descent (SGD) method is popular for solving non-convex optimization problems in machine learning. This work investigates SGD from a viewpoint of graduated optimization, which is a widely applied approach for non-convex optimization problems. Instead of the actual optimization problem, a series of smoothed optimization problems that can be achieved in various ways are solved in the graduated optimization approach. In this work, a formal formulation of the graduated optimization is provided based on the nonnegative approximate identity, which generalizes the idea of Gaussian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06775","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/2308.06775/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-05T06:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5C+/B9hX6+pdr6rpZbYDozuy/lnYxN9+gZo0gm2Ob+hhvBzbU5twNyOGVl8iw35CahqJnoEOVHZXQG4kWXzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:24:10.763836Z"},"content_sha256":"ad1bda02edd3d013e55e74956b3b6a03de4785657fc7d8e9801c9c65c894fa85","schema_version":"1.0","event_id":"sha256:ad1bda02edd3d013e55e74956b3b6a03de4785657fc7d8e9801c9c65c894fa85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/bundle.json","state_url":"https://pith.science/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/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-17T05:24:10Z","links":{"resolver":"https://pith.science/pith/7UPZMEOA6OEWXEMGUMKX7TW54E","bundle":"https://pith.science/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/bundle.json","state":"https://pith.science/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UPZMEOA6OEWXEMGUMKX7TW54E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7UPZMEOA6OEWXEMGUMKX7TW54E","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":"2af86bab38a1b5099ab89f6b5e0172d2a41ca425be4b6495284b0933ac86aa80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-13T14:02:35Z","title_canon_sha256":"2eb5f3f6f36f8d5993ddfa4e181766fadce9e02bede56805079a1052e73e47bb"},"schema_version":"1.0","source":{"id":"2308.06775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06775","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06775v1","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06775","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"7UPZMEOA6OEW","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_16","alias_value":"7UPZMEOA6OEWXEMG","created_at":"2026-07-05T06:40:44Z"},{"alias_kind":"pith_short_8","alias_value":"7UPZMEOA","created_at":"2026-07-05T06:40:44Z"}],"graph_snapshots":[{"event_id":"sha256:ad1bda02edd3d013e55e74956b3b6a03de4785657fc7d8e9801c9c65c894fa85","target":"graph","created_at":"2026-07-05T06:40:44Z","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/2308.06775/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic gradient descent (SGD) method is popular for solving non-convex optimization problems in machine learning. This work investigates SGD from a viewpoint of graduated optimization, which is a widely applied approach for non-convex optimization problems. Instead of the actual optimization problem, a series of smoothed optimization problems that can be achieved in various ways are solved in the graduated optimization approach. In this work, a formal formulation of the graduated optimization is provided based on the nonnegative approximate identity, which generalizes the idea of Gaussian ","authors_text":"Da Li, Jingjing Wu, Qingrun Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-13T14:02:35Z","title":"Stochastic Gradient Descent in the Viewpoint of Graduated Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06775","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:bc8fd745cdadb9766275f1eefec48e2b286334a4756a097ddb58abfd7e8a24c1","target":"record","created_at":"2026-07-05T06:40:44Z","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":"2af86bab38a1b5099ab89f6b5e0172d2a41ca425be4b6495284b0933ac86aa80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-13T14:02:35Z","title_canon_sha256":"2eb5f3f6f36f8d5993ddfa4e181766fadce9e02bede56805079a1052e73e47bb"},"schema_version":"1.0","source":{"id":"2308.06775","kind":"arxiv","version":1}},"canonical_sha256":"fd1f9611c0f3896b9186a3157fcedde11539203d33285a77188f4f3cbc36d6f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd1f9611c0f3896b9186a3157fcedde11539203d33285a77188f4f3cbc36d6f4","first_computed_at":"2026-07-05T06:40:44.941925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:40:44.941925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYGdmSXefx3yTXRLwr//9XV5B7xw7xlByUKDXT8hyUBAEm8e/rsi/AS8a+1E8zxw5Rdn+Kv8IW+GrOiOnmbZBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:40:44.942280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.06775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc8fd745cdadb9766275f1eefec48e2b286334a4756a097ddb58abfd7e8a24c1","sha256:ad1bda02edd3d013e55e74956b3b6a03de4785657fc7d8e9801c9c65c894fa85"],"state_sha256":"ba52a160f7358e19e92a545eb3266348a26dc7476cf7cfe1e98f695b39fda846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uvx426OZmv8WHK3o80e+/NEEQqCTc6XGWycxZ7KnCQi1cSGF19E7a1tKgIsP5gd7amn/S6pqV1wboiflYP2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:24:10.768405Z","bundle_sha256":"6c0735d3fd860fd049b9614e5b6c5cc786dd5d1dd9b38d5337c96137a3ce1a6e"}}