{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YPPVF5QURITHEX6AGB5OGFAX36","short_pith_number":"pith:YPPVF5QU","canonical_record":{"source":{"id":"2209.14558","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-29T05:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"6cceab114980b0a14692b0fb23cd9ed912840bc369407804a7815260e97a09ad","abstract_canon_sha256":"22816c05c7737880478816c2fa97a96817c85b60aa0e091423ace3365e2d3eb9"},"schema_version":"1.0"},"canonical_sha256":"c3df52f6148a26725fc0307ae31417dfa027675f386cb388190be554be750e7c","source":{"kind":"arxiv","id":"2209.14558","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14558","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14558v2","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14558","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"YPPVF5QURITH","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"YPPVF5QURITHEX6A","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"YPPVF5QU","created_at":"2026-07-05T05:03:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YPPVF5QURITHEX6AGB5OGFAX36","target":"record","payload":{"canonical_record":{"source":{"id":"2209.14558","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-29T05:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"6cceab114980b0a14692b0fb23cd9ed912840bc369407804a7815260e97a09ad","abstract_canon_sha256":"22816c05c7737880478816c2fa97a96817c85b60aa0e091423ace3365e2d3eb9"},"schema_version":"1.0"},"canonical_sha256":"c3df52f6148a26725fc0307ae31417dfa027675f386cb388190be554be750e7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:39.666805Z","signature_b64":"YU5ZZMoxhB2O/AtKDL5267mFD4pCB89UjV1np0eLdrCK3d7mpPxN6OAR9MnCixy6fskItq1AUgBR8QRjeZ10DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3df52f6148a26725fc0307ae31417dfa027675f386cb388190be554be750e7c","last_reissued_at":"2026-07-05T05:03:39.666427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:39.666427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.14558","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-07-05T05:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpDlAcW5zjpW7J+hLa4ZZDPatvFnptqSAOhLNDM6OG3M6hzkhECD2J4Qk1tDaxnPEhwwp60H5HFuoV5uj5qrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:35:41.556162Z"},"content_sha256":"85fb03b6c67df4f265e6d207629bae591ede72ef76c2f3718f5238c6621d53ee","schema_version":"1.0","event_id":"sha256:85fb03b6c67df4f265e6d207629bae591ede72ef76c2f3718f5238c6621d53ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YPPVF5QURITHEX6AGB5OGFAX36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Sub-Linear Convergent Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dilshod Azizov, Farha AlBreiki, Hilal AlQuabeh","submitted_at":"2022-09-29T05:38:06Z","abstract_excerpt":"Optimizing machine learning algorithms that are used to solve the objective function has been of great interest. Several approaches to optimize common algorithms, such as gradient descent and stochastic gradient descent, were explored. One of these approaches is reducing the gradient variance through adaptive sampling to solve large-scale optimization's empirical risk minimization (ERM) problems. In this paper, we will explore how starting with a small sample and then geometrically increasing it and using the solution of the previous sample ERM to compute the new ERM. This will solve ERM probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14558","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.14558/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-05T05:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnkxBId0cQdZMwPNApEpdZIcVNEuXRwCo18+bF2ZbwhORyInts/KImuL1WT9jYcJs8pwAz89IZEuQ3If11bAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:35:41.556672Z"},"content_sha256":"9b9d944d4a9d8eb2146ca2e976243fb497880ac9d494afa5494cd0260f7b5577","schema_version":"1.0","event_id":"sha256:9b9d944d4a9d8eb2146ca2e976243fb497880ac9d494afa5494cd0260f7b5577"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPPVF5QURITHEX6AGB5OGFAX36/bundle.json","state_url":"https://pith.science/pith/YPPVF5QURITHEX6AGB5OGFAX36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPPVF5QURITHEX6AGB5OGFAX36/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-01T07:35:41Z","links":{"resolver":"https://pith.science/pith/YPPVF5QURITHEX6AGB5OGFAX36","bundle":"https://pith.science/pith/YPPVF5QURITHEX6AGB5OGFAX36/bundle.json","state":"https://pith.science/pith/YPPVF5QURITHEX6AGB5OGFAX36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPPVF5QURITHEX6AGB5OGFAX36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YPPVF5QURITHEX6AGB5OGFAX36","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":"22816c05c7737880478816c2fa97a96817c85b60aa0e091423ace3365e2d3eb9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-29T05:38:06Z","title_canon_sha256":"6cceab114980b0a14692b0fb23cd9ed912840bc369407804a7815260e97a09ad"},"schema_version":"1.0","source":{"id":"2209.14558","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14558","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14558v2","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14558","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"YPPVF5QURITH","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"YPPVF5QURITHEX6A","created_at":"2026-07-05T05:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"YPPVF5QU","created_at":"2026-07-05T05:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:9b9d944d4a9d8eb2146ca2e976243fb497880ac9d494afa5494cd0260f7b5577","target":"graph","created_at":"2026-07-05T05:03:39Z","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/2209.14558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing machine learning algorithms that are used to solve the objective function has been of great interest. Several approaches to optimize common algorithms, such as gradient descent and stochastic gradient descent, were explored. One of these approaches is reducing the gradient variance through adaptive sampling to solve large-scale optimization's empirical risk minimization (ERM) problems. In this paper, we will explore how starting with a small sample and then geometrically increasing it and using the solution of the previous sample ERM to compute the new ERM. This will solve ERM probl","authors_text":"Dilshod Azizov, Farha AlBreiki, Hilal AlQuabeh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-29T05:38:06Z","title":"Computational Complexity of Sub-Linear Convergent Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14558","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:85fb03b6c67df4f265e6d207629bae591ede72ef76c2f3718f5238c6621d53ee","target":"record","created_at":"2026-07-05T05:03:39Z","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":"22816c05c7737880478816c2fa97a96817c85b60aa0e091423ace3365e2d3eb9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-29T05:38:06Z","title_canon_sha256":"6cceab114980b0a14692b0fb23cd9ed912840bc369407804a7815260e97a09ad"},"schema_version":"1.0","source":{"id":"2209.14558","kind":"arxiv","version":2}},"canonical_sha256":"c3df52f6148a26725fc0307ae31417dfa027675f386cb388190be554be750e7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3df52f6148a26725fc0307ae31417dfa027675f386cb388190be554be750e7c","first_computed_at":"2026-07-05T05:03:39.666427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:03:39.666427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YU5ZZMoxhB2O/AtKDL5267mFD4pCB89UjV1np0eLdrCK3d7mpPxN6OAR9MnCixy6fskItq1AUgBR8QRjeZ10DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:03:39.666805Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.14558","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85fb03b6c67df4f265e6d207629bae591ede72ef76c2f3718f5238c6621d53ee","sha256:9b9d944d4a9d8eb2146ca2e976243fb497880ac9d494afa5494cd0260f7b5577"],"state_sha256":"c72afd67216e8b66ed61bf454dc9c9ea75fb949425fd1e6c7e5674cabdd5bdc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1jURoldKOdDolD4XXJlsUJr1A3uK6Xy/wPUw9bADaqzAE5fo68aXIAltpFioTzqE7lh3wHEidyfZtQ52UPCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:35:41.564219Z","bundle_sha256":"aaa8d6c459b8730fb68f73fefd5914ebff8dcc11a9ac50a0c1f1876eca7b38b4"}}