{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HF6GGCIRBY2LZ4G6CIYFKMGSLK","short_pith_number":"pith:HF6GGCIR","canonical_record":{"source":{"id":"1407.2710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T07:01:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0f5c2149a73945326a466230c5817228c27fbe0a00de615390e52325b9c373fb","abstract_canon_sha256":"3881c70d87bd6debbd52fa7c216a1bf7546c5abd73015aa5d33ed4a33ab13c88"},"schema_version":"1.0"},"canonical_sha256":"397c6309110e34bcf0de12305530d25a9f74cbca3de93d4d4929f9372770d87e","source":{"kind":"arxiv","id":"1407.2710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2710","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2710v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2710","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"HF6GGCIRBY2L","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HF6GGCIRBY2LZ4G6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HF6GGCIR","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HF6GGCIRBY2LZ4G6CIYFKMGSLK","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T07:01:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0f5c2149a73945326a466230c5817228c27fbe0a00de615390e52325b9c373fb","abstract_canon_sha256":"3881c70d87bd6debbd52fa7c216a1bf7546c5abd73015aa5d33ed4a33ab13c88"},"schema_version":"1.0"},"canonical_sha256":"397c6309110e34bcf0de12305530d25a9f74cbca3de93d4d4929f9372770d87e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.854192Z","signature_b64":"7NDrSl1GY2hZP21iJZqqteY/B2/UCzSoxtm1i+wHzOvXc7Fk34i99TvqwdhVSnCxkrr4Yy6SlIXqdrKX0fVoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"397c6309110e34bcf0de12305530d25a9f74cbca3de93d4d4929f9372770d87e","last_reissued_at":"2026-05-18T02:47:53.853596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.853596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2710","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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyA4l34C1RRXgyjy51kRIYAArmVQbL/rVqb9GwXrRAZPDpCUg2/ZKd5JRjyLqAljhaB3qFFrGgqhqPK2O/aqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:26:39.392609Z"},"content_sha256":"38e4b0832ffc19660be3bf6172987d8b7eaf12fe5353a6e3e541275c0119ef10","schema_version":"1.0","event_id":"sha256:38e4b0832ffc19660be3bf6172987d8b7eaf12fe5353a6e3e541275c0119ef10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HF6GGCIRBY2LZ4G6CIYFKMGSLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron J. Defazio, Justin Domke, Tib\\'erio S. Caetano","submitted_at":"2014-07-10T07:01:31Z","abstract_excerpt":"Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box \"batch\" problem. In this work we introduce a new method in this class with a theoretical convergence rate four times faster than existing methods, for sums with sufficiently many terms. This method is also amendable to a sampling without replacement scheme that in practice gives further speed-ups. We give empirical results showing state of the art performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2710","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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIj7cCe/2fvBjwpVrpIg1aEhMm+WdBKcFt/PtzQXHsh3GGI351VW7MI22T98SjGcKOYAL0sjLZSnClXASX10CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:26:39.393062Z"},"content_sha256":"2ad0d24cf8ce53907cdf3906840a09bda960349c1242afb0badf4e80d392fd5f","schema_version":"1.0","event_id":"sha256:2ad0d24cf8ce53907cdf3906840a09bda960349c1242afb0badf4e80d392fd5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/bundle.json","state_url":"https://pith.science/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/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-03T17:26:39Z","links":{"resolver":"https://pith.science/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK","bundle":"https://pith.science/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/bundle.json","state":"https://pith.science/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HF6GGCIRBY2LZ4G6CIYFKMGSLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HF6GGCIRBY2LZ4G6CIYFKMGSLK","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":"3881c70d87bd6debbd52fa7c216a1bf7546c5abd73015aa5d33ed4a33ab13c88","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T07:01:31Z","title_canon_sha256":"0f5c2149a73945326a466230c5817228c27fbe0a00de615390e52325b9c373fb"},"schema_version":"1.0","source":{"id":"1407.2710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2710","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2710v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2710","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"HF6GGCIRBY2L","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HF6GGCIRBY2LZ4G6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HF6GGCIR","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:2ad0d24cf8ce53907cdf3906840a09bda960349c1242afb0badf4e80d392fd5f","target":"graph","created_at":"2026-05-18T02:47:53Z","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":"Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box \"batch\" problem. In this work we introduce a new method in this class with a theoretical convergence rate four times faster than existing methods, for sums with sufficiently many terms. This method is also amendable to a sampling without replacement scheme that in practice gives further speed-ups. We give empirical results showing state of the art performance.","authors_text":"Aaron J. Defazio, Justin Domke, Tib\\'erio S. Caetano","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T07:01:31Z","title":"Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2710","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:38e4b0832ffc19660be3bf6172987d8b7eaf12fe5353a6e3e541275c0119ef10","target":"record","created_at":"2026-05-18T02:47:53Z","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":"3881c70d87bd6debbd52fa7c216a1bf7546c5abd73015aa5d33ed4a33ab13c88","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T07:01:31Z","title_canon_sha256":"0f5c2149a73945326a466230c5817228c27fbe0a00de615390e52325b9c373fb"},"schema_version":"1.0","source":{"id":"1407.2710","kind":"arxiv","version":1}},"canonical_sha256":"397c6309110e34bcf0de12305530d25a9f74cbca3de93d4d4929f9372770d87e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"397c6309110e34bcf0de12305530d25a9f74cbca3de93d4d4929f9372770d87e","first_computed_at":"2026-05-18T02:47:53.853596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:53.853596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7NDrSl1GY2hZP21iJZqqteY/B2/UCzSoxtm1i+wHzOvXc7Fk34i99TvqwdhVSnCxkrr4Yy6SlIXqdrKX0fVoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:53.854192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38e4b0832ffc19660be3bf6172987d8b7eaf12fe5353a6e3e541275c0119ef10","sha256:2ad0d24cf8ce53907cdf3906840a09bda960349c1242afb0badf4e80d392fd5f"],"state_sha256":"de4677ab68dced26e7c27d2b964f18596634cc0b0f58d08fc12a45af7fcc5065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBRN7xlF78kaw46yjYpWV8ml2NSsHZI3jAiQqCre7zh4kO26TF37W/VnQVR7HU/LXuhm3iHBsLdBj8nczMJcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:26:39.398278Z","bundle_sha256":"8ce74496b8a9a7227e6992a042f10dc4a4796de12e4ab38886c90d287416f8b9"}}