{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JKW2LHHREXYBN764M6RKV3B7EZ","short_pith_number":"pith:JKW2LHHR","canonical_record":{"source":{"id":"1312.7853","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T20:23:38Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"22c4f5b8ca5c3fb8a1f9f6e246b60c04561a9c6864334c638ca4f2aa99bd807e","abstract_canon_sha256":"3ea09957c21374d7d12cfa10be2938f806675c700400e45d006ee7241430c128"},"schema_version":"1.0"},"canonical_sha256":"4aada59cf125f016ffdc67a2aaec3f266d96cd56334afcbba0a2838081de21f9","source":{"kind":"arxiv","id":"1312.7853","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7853","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7853v4","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7853","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"JKW2LHHREXYB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKW2LHHREXYBN764","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKW2LHHR","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JKW2LHHREXYBN764M6RKV3B7EZ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7853","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T20:23:38Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"22c4f5b8ca5c3fb8a1f9f6e246b60c04561a9c6864334c638ca4f2aa99bd807e","abstract_canon_sha256":"3ea09957c21374d7d12cfa10be2938f806675c700400e45d006ee7241430c128"},"schema_version":"1.0"},"canonical_sha256":"4aada59cf125f016ffdc67a2aaec3f266d96cd56334afcbba0a2838081de21f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.752874Z","signature_b64":"ccY3cXJP4OL4mOOSirPhO2DXK6OnUkt0F21oNlcDcgEEinFTU7k3rYfBdKBZTQO2zWsPJFonGDPeqzdslO2xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aada59cf125f016ffdc67a2aaec3f266d96cd56334afcbba0a2838081de21f9","last_reissued_at":"2026-05-18T02:51:56.752451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.752451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7853","source_version":4,"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:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmCMciC3+tzevrxyS1nB3wjCDQq6QbDSnT2YNTFMWNFap75/jAeBnh0eaO+YJIwLbar0OcPmU6Jsw4NIAmpJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:20:39.600078Z"},"content_sha256":"8c834d8655e630f8ad40f209d8ff59dce0d7f8f2cab2c08127df8a2cfd857078","schema_version":"1.0","event_id":"sha256:8c834d8655e630f8ad40f209d8ff59dce0d7f8f2cab2c08127df8a2cfd857078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JKW2LHHREXYBN764M6RKV3B7EZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nathan Srebro, Ohad Shamir, Tong Zhang","submitted_at":"2013-12-30T20:23:38Z","abstract_excerpt":"We present a novel Newton-type method for distributed optimization, which is particularly well suited for stochastic optimization and learning problems. For quadratic objectives, the method enjoys a linear rate of convergence which provably \\emph{improves} with the data size, requiring an essentially constant number of iterations under reasonable assumptions. We provide theoretical and empirical evidence of the advantages of our method compared to other approaches, such as one-shot parameter averaging and ADMM."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7853","kind":"arxiv","version":4},"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:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19CSR2EzgzrSC2IPO9y8BBFNBgVKvsjKEWtbF8LI9DjHXWIFUMrJ/ulKx12GJZPNeEkTXe18zWT9ivL7vTvtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:20:39.600758Z"},"content_sha256":"c3c2d12a4397f38923d8bf8b37165517bf4fc9e86a373ad72c66d81d5e2c3ac8","schema_version":"1.0","event_id":"sha256:c3c2d12a4397f38923d8bf8b37165517bf4fc9e86a373ad72c66d81d5e2c3ac8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKW2LHHREXYBN764M6RKV3B7EZ/bundle.json","state_url":"https://pith.science/pith/JKW2LHHREXYBN764M6RKV3B7EZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKW2LHHREXYBN764M6RKV3B7EZ/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-27T22:20:39Z","links":{"resolver":"https://pith.science/pith/JKW2LHHREXYBN764M6RKV3B7EZ","bundle":"https://pith.science/pith/JKW2LHHREXYBN764M6RKV3B7EZ/bundle.json","state":"https://pith.science/pith/JKW2LHHREXYBN764M6RKV3B7EZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKW2LHHREXYBN764M6RKV3B7EZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JKW2LHHREXYBN764M6RKV3B7EZ","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":"3ea09957c21374d7d12cfa10be2938f806675c700400e45d006ee7241430c128","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T20:23:38Z","title_canon_sha256":"22c4f5b8ca5c3fb8a1f9f6e246b60c04561a9c6864334c638ca4f2aa99bd807e"},"schema_version":"1.0","source":{"id":"1312.7853","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7853","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7853v4","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7853","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"JKW2LHHREXYB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JKW2LHHREXYBN764","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JKW2LHHR","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:c3c2d12a4397f38923d8bf8b37165517bf4fc9e86a373ad72c66d81d5e2c3ac8","target":"graph","created_at":"2026-05-18T02:51:56Z","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":"We present a novel Newton-type method for distributed optimization, which is particularly well suited for stochastic optimization and learning problems. For quadratic objectives, the method enjoys a linear rate of convergence which provably \\emph{improves} with the data size, requiring an essentially constant number of iterations under reasonable assumptions. We provide theoretical and empirical evidence of the advantages of our method compared to other approaches, such as one-shot parameter averaging and ADMM.","authors_text":"Nathan Srebro, Ohad Shamir, Tong Zhang","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T20:23:38Z","title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7853","kind":"arxiv","version":4},"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:8c834d8655e630f8ad40f209d8ff59dce0d7f8f2cab2c08127df8a2cfd857078","target":"record","created_at":"2026-05-18T02:51:56Z","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":"3ea09957c21374d7d12cfa10be2938f806675c700400e45d006ee7241430c128","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T20:23:38Z","title_canon_sha256":"22c4f5b8ca5c3fb8a1f9f6e246b60c04561a9c6864334c638ca4f2aa99bd807e"},"schema_version":"1.0","source":{"id":"1312.7853","kind":"arxiv","version":4}},"canonical_sha256":"4aada59cf125f016ffdc67a2aaec3f266d96cd56334afcbba0a2838081de21f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aada59cf125f016ffdc67a2aaec3f266d96cd56334afcbba0a2838081de21f9","first_computed_at":"2026-05-18T02:51:56.752451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:56.752451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccY3cXJP4OL4mOOSirPhO2DXK6OnUkt0F21oNlcDcgEEinFTU7k3rYfBdKBZTQO2zWsPJFonGDPeqzdslO2xAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:56.752874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7853","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c834d8655e630f8ad40f209d8ff59dce0d7f8f2cab2c08127df8a2cfd857078","sha256:c3c2d12a4397f38923d8bf8b37165517bf4fc9e86a373ad72c66d81d5e2c3ac8"],"state_sha256":"154935a7505c5fe7857be8a745175254096b315e0d327121f096755795770201"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMxf7pSnxiKWRj+pkSZY25Co2NiSucNOLrmiYBQatM08XvQpmJM0Ff3yK6obzflL6uutLWrb7Nvnlxd85XAdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:20:39.604089Z","bundle_sha256":"44d1c1ec9575b1ec0d6f127f94e86a3511ee74597d6e6e12b476bde2b5c98076"}}