{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MT5OJ7G4624U4TODJD2NHXJ7IG","short_pith_number":"pith:MT5OJ7G4","canonical_record":{"source":{"id":"1802.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T02:44:56Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"46846af82e47aeff4d490ceeba5dc2c2318643d2ebeed38ce05c6baa0f35582e","abstract_canon_sha256":"0071cd6a47f4c6a5beb687825fc996bb5ed2aa3b7ef96cea882051c353c631fc"},"schema_version":"1.0"},"canonical_sha256":"64fae4fcdcf6b94e4dc348f4d3dd3f41971d5a38448aa449205b0695bf0c7e38","source":{"kind":"arxiv","id":"1802.00130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00130","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00130v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00130","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"MT5OJ7G4624U","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MT5OJ7G4624U4TOD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MT5OJ7G4","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MT5OJ7G4624U4TODJD2NHXJ7IG","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T02:44:56Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"46846af82e47aeff4d490ceeba5dc2c2318643d2ebeed38ce05c6baa0f35582e","abstract_canon_sha256":"0071cd6a47f4c6a5beb687825fc996bb5ed2aa3b7ef96cea882051c353c631fc"},"schema_version":"1.0"},"canonical_sha256":"64fae4fcdcf6b94e4dc348f4d3dd3f41971d5a38448aa449205b0695bf0c7e38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.726365Z","signature_b64":"+smKMCpXnZHlIZvpYCJHR+zxnI9HAVbFKeofn1ezp8MA5Ttp6ZOAlCJZEIgOuIVxtnsdhZfJd2Oc9xH4uFUeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64fae4fcdcf6b94e4dc348f4d3dd3f41971d5a38448aa449205b0695bf0c7e38","last_reissued_at":"2026-05-18T00:24:36.725991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.725991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00130","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqciqOr6gQEAw1WffLf3AfLlXX0YCOu+KBcvfrb+eAkdLlFlSZcewPB50POLJh58t5ETBPVksqdrFkfbC/RlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:45.562801Z"},"content_sha256":"ca6b2df3f38cb87227769cea0a7f1db3da29c97f74d831d56847d31d5e9d5c2f","schema_version":"1.0","event_id":"sha256:ca6b2df3f38cb87227769cea0a7f1db3da29c97f74d831d56847d31d5e9d5c2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MT5OJ7G4624U4TODJD2NHXJ7IG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Newton Methods for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Chien-Chih Wang, Chih-Jen Lin, Chun-Ting Chen, Dhruv Mahajan, Kent Loong Tan, S. Sathiya Keerthi, S. Sundararajan, Yu-Hsiang Lin","submitted_at":"2018-02-01T02:44:56Z","abstract_excerpt":"Deep learning involves a difficult non-convex optimization problem with a large number of weights between any two adjacent layers of a deep structure. To handle large data sets or complicated networks, distributed training is needed, but the calculation of function, gradient, and Hessian is expensive. In particular, the communication and the synchronization cost may become a bottleneck. In this paper, we focus on situations where the model is distributedly stored, and propose a novel distributed Newton method for training deep neural networks. By variable and feature-wise data partitions, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00130","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weLAYyiuD8F/vWTTybCcekFhwAr+LAlA9MoivVKonSvk8xP2aogr3whH08HcUVjEvQyTbQSiOSBjnne9EGDvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:45.563151Z"},"content_sha256":"2c0df38b57cd44ebd14e5a4929ce944f489388836f056c560e573e71d57e46d7","schema_version":"1.0","event_id":"sha256:2c0df38b57cd44ebd14e5a4929ce944f489388836f056c560e573e71d57e46d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/bundle.json","state_url":"https://pith.science/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/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-06-09T17:56:45Z","links":{"resolver":"https://pith.science/pith/MT5OJ7G4624U4TODJD2NHXJ7IG","bundle":"https://pith.science/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/bundle.json","state":"https://pith.science/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MT5OJ7G4624U4TODJD2NHXJ7IG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MT5OJ7G4624U4TODJD2NHXJ7IG","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":"0071cd6a47f4c6a5beb687825fc996bb5ed2aa3b7ef96cea882051c353c631fc","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T02:44:56Z","title_canon_sha256":"46846af82e47aeff4d490ceeba5dc2c2318643d2ebeed38ce05c6baa0f35582e"},"schema_version":"1.0","source":{"id":"1802.00130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00130","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00130v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00130","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"MT5OJ7G4624U","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MT5OJ7G4624U4TOD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MT5OJ7G4","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2c0df38b57cd44ebd14e5a4929ce944f489388836f056c560e573e71d57e46d7","target":"graph","created_at":"2026-05-18T00:24:36Z","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":"Deep learning involves a difficult non-convex optimization problem with a large number of weights between any two adjacent layers of a deep structure. To handle large data sets or complicated networks, distributed training is needed, but the calculation of function, gradient, and Hessian is expensive. In particular, the communication and the synchronization cost may become a bottleneck. In this paper, we focus on situations where the model is distributedly stored, and propose a novel distributed Newton method for training deep neural networks. By variable and feature-wise data partitions, and ","authors_text":"Chien-Chih Wang, Chih-Jen Lin, Chun-Ting Chen, Dhruv Mahajan, Kent Loong Tan, S. Sathiya Keerthi, S. Sundararajan, Yu-Hsiang Lin","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T02:44:56Z","title":"Distributed Newton Methods for Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00130","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:ca6b2df3f38cb87227769cea0a7f1db3da29c97f74d831d56847d31d5e9d5c2f","target":"record","created_at":"2026-05-18T00:24:36Z","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":"0071cd6a47f4c6a5beb687825fc996bb5ed2aa3b7ef96cea882051c353c631fc","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T02:44:56Z","title_canon_sha256":"46846af82e47aeff4d490ceeba5dc2c2318643d2ebeed38ce05c6baa0f35582e"},"schema_version":"1.0","source":{"id":"1802.00130","kind":"arxiv","version":1}},"canonical_sha256":"64fae4fcdcf6b94e4dc348f4d3dd3f41971d5a38448aa449205b0695bf0c7e38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64fae4fcdcf6b94e4dc348f4d3dd3f41971d5a38448aa449205b0695bf0c7e38","first_computed_at":"2026-05-18T00:24:36.725991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.725991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+smKMCpXnZHlIZvpYCJHR+zxnI9HAVbFKeofn1ezp8MA5Ttp6ZOAlCJZEIgOuIVxtnsdhZfJd2Oc9xH4uFUeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.726365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6b2df3f38cb87227769cea0a7f1db3da29c97f74d831d56847d31d5e9d5c2f","sha256:2c0df38b57cd44ebd14e5a4929ce944f489388836f056c560e573e71d57e46d7"],"state_sha256":"312a03e9f8e785e40e53c26da226a4f3df699f9b1c7d18dc7a4eb2c318b790bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7UzwYQrcnic3iqbxp2lvAlRMx+zt3KiOhLKQKkAt6HvaWMn9GmE1+C9NmzgC0Nk5lrIyEPqkVZDY9M0oRtfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:56:45.565141Z","bundle_sha256":"432610c7b12abc8d8b7af9679920ea67890214667e2fe7794dd6b11043b5b873"}}