{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3RDQ6N63XTRULIWWC4A4FEC4TR","short_pith_number":"pith:3RDQ6N63","canonical_record":{"source":{"id":"2002.03273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T03:39:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7048d1fa8e5f5129e0bb0659f62ce1ac714fd52283375453d1bdc00f01b3505d","abstract_canon_sha256":"a8f889698416074ff3cfa41b4251fb56e3f484a5756c3818aac15c4488a73e37"},"schema_version":"1.0"},"canonical_sha256":"dc470f37dbbce345a2d61701c2905c9c60669897618a49c25b5787b2ef17c508","source":{"kind":"arxiv","id":"2002.03273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03273","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03273v1","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03273","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_12","alias_value":"3RDQ6N63XTRU","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_16","alias_value":"3RDQ6N63XTRULIWW","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_8","alias_value":"3RDQ6N63","created_at":"2026-07-05T00:39:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3RDQ6N63XTRULIWWC4A4FEC4TR","target":"record","payload":{"canonical_record":{"source":{"id":"2002.03273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T03:39:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7048d1fa8e5f5129e0bb0659f62ce1ac714fd52283375453d1bdc00f01b3505d","abstract_canon_sha256":"a8f889698416074ff3cfa41b4251fb56e3f484a5756c3818aac15c4488a73e37"},"schema_version":"1.0"},"canonical_sha256":"dc470f37dbbce345a2d61701c2905c9c60669897618a49c25b5787b2ef17c508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:20.934492Z","signature_b64":"Gn6D9pQ0USw/a0ouOBJKQNSNL27s1fOpBTNIIasIUyKBjMG7J++f9niUqhQYyrlNlSrjnxGWB+W6BUXoPhOYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc470f37dbbce345a2d61701c2905c9c60669897618a49c25b5787b2ef17c508","last_reissued_at":"2026-07-05T00:39:20.934058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:20.934058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.03273","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-05T00:39:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhTz+BTBwRyYaGuqWb2sffGKXS33DmdVVHLDIGqc47bt/FEX6qLoOceaUqwDSnpmNucZRDtH/cqEDNx6+HKSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:50:08.177156Z"},"content_sha256":"aa6bea6dcbf2851e6b00692e77076af7ff2f1ed59b6f4fdccd1bfa84cc8283f2","schema_version":"1.0","event_id":"sha256:aa6bea6dcbf2851e6b00692e77076af7ff2f1ed59b6f4fdccd1bfa84cc8283f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3RDQ6N63XTRULIWWC4A4FEC4TR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amit Daniely, Hongzhou Lin, Stefanie Jegelka, Yossi Arjevani","submitted_at":"2020-02-09T03:39:46Z","abstract_excerpt":"Recent advances in randomized incremental methods for minimizing $L$-smooth $\\mu$-strongly convex finite sums have culminated in tight complexity of $\\tilde{O}((n+\\sqrt{n L/\\mu})\\log(1/\\epsilon))$ and $O(n+\\sqrt{nL/\\epsilon})$, where $\\mu>0$ and $\\mu=0$, respectively, and $n$ denotes the number of individual functions. Unlike incremental methods, stochastic methods for finite sums do not rely on an explicit knowledge of which individual function is being addressed at each iteration, and as such, must perform at least $\\Omega(n^2)$ iterations to obtain $O(1/n^2)$-optimal solutions. In this work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03273","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/2002.03273/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:39:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bN5vxV6yZtEnYrO8HgSpj5FPai5aNUSAQh+7Evv7yYxjLv8o4EZxuY3RdcxiEQcR76SHEEUnLi76uVbc9jShAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:50:08.178532Z"},"content_sha256":"c059c70ff4c7b18bcdc1a2ed1d33837fc7d9ba44ea0f1979e16dd66439fbc6ef","schema_version":"1.0","event_id":"sha256:c059c70ff4c7b18bcdc1a2ed1d33837fc7d9ba44ea0f1979e16dd66439fbc6ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/bundle.json","state_url":"https://pith.science/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/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-10T23:50:08Z","links":{"resolver":"https://pith.science/pith/3RDQ6N63XTRULIWWC4A4FEC4TR","bundle":"https://pith.science/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/bundle.json","state":"https://pith.science/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RDQ6N63XTRULIWWC4A4FEC4TR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3RDQ6N63XTRULIWWC4A4FEC4TR","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":"a8f889698416074ff3cfa41b4251fb56e3f484a5756c3818aac15c4488a73e37","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T03:39:46Z","title_canon_sha256":"7048d1fa8e5f5129e0bb0659f62ce1ac714fd52283375453d1bdc00f01b3505d"},"schema_version":"1.0","source":{"id":"2002.03273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03273","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03273v1","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03273","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_12","alias_value":"3RDQ6N63XTRU","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_16","alias_value":"3RDQ6N63XTRULIWW","created_at":"2026-07-05T00:39:20Z"},{"alias_kind":"pith_short_8","alias_value":"3RDQ6N63","created_at":"2026-07-05T00:39:20Z"}],"graph_snapshots":[{"event_id":"sha256:c059c70ff4c7b18bcdc1a2ed1d33837fc7d9ba44ea0f1979e16dd66439fbc6ef","target":"graph","created_at":"2026-07-05T00:39:20Z","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/2002.03273/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent advances in randomized incremental methods for minimizing $L$-smooth $\\mu$-strongly convex finite sums have culminated in tight complexity of $\\tilde{O}((n+\\sqrt{n L/\\mu})\\log(1/\\epsilon))$ and $O(n+\\sqrt{nL/\\epsilon})$, where $\\mu>0$ and $\\mu=0$, respectively, and $n$ denotes the number of individual functions. Unlike incremental methods, stochastic methods for finite sums do not rely on an explicit knowledge of which individual function is being addressed at each iteration, and as such, must perform at least $\\Omega(n^2)$ iterations to obtain $O(1/n^2)$-optimal solutions. In this work","authors_text":"Amit Daniely, Hongzhou Lin, Stefanie Jegelka, Yossi Arjevani","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T03:39:46Z","title":"On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03273","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:aa6bea6dcbf2851e6b00692e77076af7ff2f1ed59b6f4fdccd1bfa84cc8283f2","target":"record","created_at":"2026-07-05T00:39:20Z","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":"a8f889698416074ff3cfa41b4251fb56e3f484a5756c3818aac15c4488a73e37","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T03:39:46Z","title_canon_sha256":"7048d1fa8e5f5129e0bb0659f62ce1ac714fd52283375453d1bdc00f01b3505d"},"schema_version":"1.0","source":{"id":"2002.03273","kind":"arxiv","version":1}},"canonical_sha256":"dc470f37dbbce345a2d61701c2905c9c60669897618a49c25b5787b2ef17c508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc470f37dbbce345a2d61701c2905c9c60669897618a49c25b5787b2ef17c508","first_computed_at":"2026-07-05T00:39:20.934058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:20.934058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gn6D9pQ0USw/a0ouOBJKQNSNL27s1fOpBTNIIasIUyKBjMG7J++f9niUqhQYyrlNlSrjnxGWB+W6BUXoPhOYDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:20.934492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa6bea6dcbf2851e6b00692e77076af7ff2f1ed59b6f4fdccd1bfa84cc8283f2","sha256:c059c70ff4c7b18bcdc1a2ed1d33837fc7d9ba44ea0f1979e16dd66439fbc6ef"],"state_sha256":"a4451c18e627035148e20378f313339de89bf94787da9dce2720ccc63c6e1215"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FREYNxGM7prNKZn9/4WguVDdWchLbClBibDqZyBUBox2TeZdMmX5jp6RCCr3lQOvsZ8db5xFaPlUhyccda+nBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T23:50:08.184421Z","bundle_sha256":"4b0d8f6cb81d48744bc7158f3eb00da4e04adefce89e57441ed7f0c0bae15d54"}}