{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RPL2I4D2E25437HRLHHOSQGZWC","short_pith_number":"pith:RPL2I4D2","canonical_record":{"source":{"id":"1805.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-20T16:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"f35dba0e7c604f910445a7ad4ea16fcc5f7b6dfd200781631135fe3ecd4c7ebd","abstract_canon_sha256":"c1bbf6a6928a7151de230cea3a815ab2d2c109c369c09b0d0f99d761d299dcae"},"schema_version":"1.0"},"canonical_sha256":"8bd7a4707a26bbcdfcf159cee940d9b0a2876272e56a56e4729bdb9fa92a1ec6","source":{"kind":"arxiv","id":"1805.07786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07786","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07786v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07786","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"RPL2I4D2E254","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RPL2I4D2E25437HR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RPL2I4D2","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RPL2I4D2E25437HRLHHOSQGZWC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-20T16:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"f35dba0e7c604f910445a7ad4ea16fcc5f7b6dfd200781631135fe3ecd4c7ebd","abstract_canon_sha256":"c1bbf6a6928a7151de230cea3a815ab2d2c109c369c09b0d0f99d761d299dcae"},"schema_version":"1.0"},"canonical_sha256":"8bd7a4707a26bbcdfcf159cee940d9b0a2876272e56a56e4729bdb9fa92a1ec6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.565113Z","signature_b64":"FjhuLodHWSoXD1r5FWqfxttPW1dpkCgRdjJufXdOW7yRFejeOlExTaMsR2luChZFU71uCMpKv7TP+bDvoNwDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd7a4707a26bbcdfcf159cee940d9b0a2876272e56a56e4729bdb9fa92a1ec6","last_reissued_at":"2026-05-18T00:15:32.564620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.564620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07786","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-05-18T00:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UAI+Dx/k9nEplDJ5SHwWuXUoW4nlACD4ljm8eC9pRh4eui/sDeRoLFPXs7aQ6ov1LFk5zqi2pfFPHyAI2GlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:24.197134Z"},"content_sha256":"f6b837827b8804863b9f3d63895a03576152747cce684a5ba9e9dadd852ffd1d","schema_version":"1.0","event_id":"sha256:f6b837827b8804863b9f3d63895a03576152747cce684a5ba9e9dadd852ffd1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RPL2I4D2E25437HRLHHOSQGZWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Span Assumption Yields Fast Finite-Sum Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel O'Connor, Robert Hannah, Wotao Yin, Yanli Liu","submitted_at":"2018-05-20T16:15:55Z","abstract_excerpt":"In this paper, we show that SVRG and SARAH can be modified to be fundamentally faster than all of the other standard algorithms that minimize the sum of $n$ smooth functions, such as SAGA, SAG, SDCA, and SDCA without duality. Most finite sum algorithms follow what we call the \"span assumption\": Their updates are in the span of a sequence of component gradients chosen in a random IID fashion. In the big data regime, where the condition number $\\kappa=\\mathcal{O}(n)$, the span assumption prevents algorithms from converging to an approximate solution of accuracy $\\epsilon$ in less than $n\\ln(1/\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07786","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"},"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2PtfUAk2ggI3YP67crn7mlD1YrxoqUQ0EoGdEifgcmrRj/4IgSj8bAk8RVruxN/Q6d8aqHoK1lvbe5bbinrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:24.197765Z"},"content_sha256":"d5152239fdf57024d796e9c1c88d9b35a493187f20b19ffc6a2b7d112b0788af","schema_version":"1.0","event_id":"sha256:d5152239fdf57024d796e9c1c88d9b35a493187f20b19ffc6a2b7d112b0788af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPL2I4D2E25437HRLHHOSQGZWC/bundle.json","state_url":"https://pith.science/pith/RPL2I4D2E25437HRLHHOSQGZWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPL2I4D2E25437HRLHHOSQGZWC/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-05-30T11:52:24Z","links":{"resolver":"https://pith.science/pith/RPL2I4D2E25437HRLHHOSQGZWC","bundle":"https://pith.science/pith/RPL2I4D2E25437HRLHHOSQGZWC/bundle.json","state":"https://pith.science/pith/RPL2I4D2E25437HRLHHOSQGZWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPL2I4D2E25437HRLHHOSQGZWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RPL2I4D2E25437HRLHHOSQGZWC","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":"c1bbf6a6928a7151de230cea3a815ab2d2c109c369c09b0d0f99d761d299dcae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-20T16:15:55Z","title_canon_sha256":"f35dba0e7c604f910445a7ad4ea16fcc5f7b6dfd200781631135fe3ecd4c7ebd"},"schema_version":"1.0","source":{"id":"1805.07786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07786","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07786v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07786","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"RPL2I4D2E254","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RPL2I4D2E25437HR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RPL2I4D2","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:d5152239fdf57024d796e9c1c88d9b35a493187f20b19ffc6a2b7d112b0788af","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"In this paper, we show that SVRG and SARAH can be modified to be fundamentally faster than all of the other standard algorithms that minimize the sum of $n$ smooth functions, such as SAGA, SAG, SDCA, and SDCA without duality. Most finite sum algorithms follow what we call the \"span assumption\": Their updates are in the span of a sequence of component gradients chosen in a random IID fashion. In the big data regime, where the condition number $\\kappa=\\mathcal{O}(n)$, the span assumption prevents algorithms from converging to an approximate solution of accuracy $\\epsilon$ in less than $n\\ln(1/\\e","authors_text":"Daniel O'Connor, Robert Hannah, Wotao Yin, Yanli Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-20T16:15:55Z","title":"Breaking the Span Assumption Yields Fast Finite-Sum Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07786","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:f6b837827b8804863b9f3d63895a03576152747cce684a5ba9e9dadd852ffd1d","target":"record","created_at":"2026-05-18T00:15:32Z","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":"c1bbf6a6928a7151de230cea3a815ab2d2c109c369c09b0d0f99d761d299dcae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-20T16:15:55Z","title_canon_sha256":"f35dba0e7c604f910445a7ad4ea16fcc5f7b6dfd200781631135fe3ecd4c7ebd"},"schema_version":"1.0","source":{"id":"1805.07786","kind":"arxiv","version":1}},"canonical_sha256":"8bd7a4707a26bbcdfcf159cee940d9b0a2876272e56a56e4729bdb9fa92a1ec6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bd7a4707a26bbcdfcf159cee940d9b0a2876272e56a56e4729bdb9fa92a1ec6","first_computed_at":"2026-05-18T00:15:32.564620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.564620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FjhuLodHWSoXD1r5FWqfxttPW1dpkCgRdjJufXdOW7yRFejeOlExTaMsR2luChZFU71uCMpKv7TP+bDvoNwDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.565113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6b837827b8804863b9f3d63895a03576152747cce684a5ba9e9dadd852ffd1d","sha256:d5152239fdf57024d796e9c1c88d9b35a493187f20b19ffc6a2b7d112b0788af"],"state_sha256":"46012a916430c1295e20ff3187fc30c6bff68554f4ede826d89d85d92be50fe3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shTEH11Rle5oj5OPH4WJFkFNvSy7XsoRi34c44oOmXGdg/Vx2Cy2xbBCbdXOqBczlyH+5ucqcAeHX53/TmFnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:52:24.201351Z","bundle_sha256":"79f87bc287511c6bce82724e7ee111fc9d979bb33c75077f5d301b3ea3077f05"}}