{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LXV3HR2IW2T46SK7PYWP43WGQD","short_pith_number":"pith:LXV3HR2I","canonical_record":{"source":{"id":"1806.07569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:18:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5da98d34b7e38c8a240e876ce7af6d59f9d255395de2ad325a69ff57a3c3ffd9","abstract_canon_sha256":"d2eb3d24339670fb2b0eff5ca2a9b318948114687a4fc951e0db7eae745e0d0c"},"schema_version":"1.0"},"canonical_sha256":"5debb3c748b6a7cf495f7e2cfe6ec680f8eab5938583cb8030ad6560ef6a20be","source":{"kind":"arxiv","id":"1806.07569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07569","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07569v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07569","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"LXV3HR2IW2T4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXV3HR2IW2T46SK7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXV3HR2I","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LXV3HR2IW2T46SK7PYWP43WGQD","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:18:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5da98d34b7e38c8a240e876ce7af6d59f9d255395de2ad325a69ff57a3c3ffd9","abstract_canon_sha256":"d2eb3d24339670fb2b0eff5ca2a9b318948114687a4fc951e0db7eae745e0d0c"},"schema_version":"1.0"},"canonical_sha256":"5debb3c748b6a7cf495f7e2cfe6ec680f8eab5938583cb8030ad6560ef6a20be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:47.360338Z","signature_b64":"2ZzLfj0I4pkQE/trTJc7omQtSo0rcXxE9rR7GVDr4AlJc7iX/PRxiYGaAogwlohnPZPbE82f2B61EKaeTAxeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5debb3c748b6a7cf495f7e2cfe6ec680f8eab5938583cb8030ad6560ef6a20be","last_reissued_at":"2026-05-18T00:12:47.359535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:47.359535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07569","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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WAdGfG55n2fAdoa7wqkLyJr1FlhOJAeOBT1pJF+7nUooXU4uBVsl6hF+j9+kbAVywAxRFDcgW4L3x4OMBk0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:41:50.496960Z"},"content_sha256":"6f2080be08f5948b9424f4426b43a9c31d7a513d5c0723ef3b034e74c789a214","schema_version":"1.0","event_id":"sha256:6f2080be08f5948b9424f4426b43a9c31d7a513d5c0723ef3b034e74c789a214"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LXV3HR2IW2T46SK7PYWP43WGQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Second-Order Algorithm You Can Trust","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"An Bian, Aurelien Lucchi, Celestine D\\\"unner, Martin Jaggi, Matilde Gargiani, Thomas Hofmann","submitted_at":"2018-06-20T06:18:00Z","abstract_excerpt":"Due to the rapid growth of data and computational resources, distributed optimization has become an active research area in recent years. While first-order methods seem to dominate the field, second-order methods are nevertheless attractive as they potentially require fewer communication rounds to converge. However, there are significant drawbacks that impede their wide adoption, such as the computation and the communication of a large Hessian matrix. In this paper we present a new algorithm for distributed training of generalized linear models that only requires the computation of diagonal bl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07569","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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pXNN+Gr4sHpysxLevqn+936Z0iHdDrRXDxXDZP+BCIoyLf+S1X/C62vmFa+QShc7i6ZZyoBn8C0qUu6XokXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:41:50.497336Z"},"content_sha256":"e4ac68043a1c2149ab9701ea9a9b163572915d0e72c02c8471a2fd66c2f4dd5a","schema_version":"1.0","event_id":"sha256:e4ac68043a1c2149ab9701ea9a9b163572915d0e72c02c8471a2fd66c2f4dd5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXV3HR2IW2T46SK7PYWP43WGQD/bundle.json","state_url":"https://pith.science/pith/LXV3HR2IW2T46SK7PYWP43WGQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXV3HR2IW2T46SK7PYWP43WGQD/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-28T16:41:50Z","links":{"resolver":"https://pith.science/pith/LXV3HR2IW2T46SK7PYWP43WGQD","bundle":"https://pith.science/pith/LXV3HR2IW2T46SK7PYWP43WGQD/bundle.json","state":"https://pith.science/pith/LXV3HR2IW2T46SK7PYWP43WGQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXV3HR2IW2T46SK7PYWP43WGQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LXV3HR2IW2T46SK7PYWP43WGQD","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":"d2eb3d24339670fb2b0eff5ca2a9b318948114687a4fc951e0db7eae745e0d0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:18:00Z","title_canon_sha256":"5da98d34b7e38c8a240e876ce7af6d59f9d255395de2ad325a69ff57a3c3ffd9"},"schema_version":"1.0","source":{"id":"1806.07569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07569","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07569v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07569","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"LXV3HR2IW2T4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXV3HR2IW2T46SK7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXV3HR2I","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e4ac68043a1c2149ab9701ea9a9b163572915d0e72c02c8471a2fd66c2f4dd5a","target":"graph","created_at":"2026-05-18T00:12:47Z","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":"Due to the rapid growth of data and computational resources, distributed optimization has become an active research area in recent years. While first-order methods seem to dominate the field, second-order methods are nevertheless attractive as they potentially require fewer communication rounds to converge. However, there are significant drawbacks that impede their wide adoption, such as the computation and the communication of a large Hessian matrix. In this paper we present a new algorithm for distributed training of generalized linear models that only requires the computation of diagonal bl","authors_text":"An Bian, Aurelien Lucchi, Celestine D\\\"unner, Martin Jaggi, Matilde Gargiani, Thomas Hofmann","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:18:00Z","title":"A Distributed Second-Order Algorithm You Can Trust"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07569","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:6f2080be08f5948b9424f4426b43a9c31d7a513d5c0723ef3b034e74c789a214","target":"record","created_at":"2026-05-18T00:12:47Z","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":"d2eb3d24339670fb2b0eff5ca2a9b318948114687a4fc951e0db7eae745e0d0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:18:00Z","title_canon_sha256":"5da98d34b7e38c8a240e876ce7af6d59f9d255395de2ad325a69ff57a3c3ffd9"},"schema_version":"1.0","source":{"id":"1806.07569","kind":"arxiv","version":1}},"canonical_sha256":"5debb3c748b6a7cf495f7e2cfe6ec680f8eab5938583cb8030ad6560ef6a20be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5debb3c748b6a7cf495f7e2cfe6ec680f8eab5938583cb8030ad6560ef6a20be","first_computed_at":"2026-05-18T00:12:47.359535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:47.359535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ZzLfj0I4pkQE/trTJc7omQtSo0rcXxE9rR7GVDr4AlJc7iX/PRxiYGaAogwlohnPZPbE82f2B61EKaeTAxeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:47.360338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f2080be08f5948b9424f4426b43a9c31d7a513d5c0723ef3b034e74c789a214","sha256:e4ac68043a1c2149ab9701ea9a9b163572915d0e72c02c8471a2fd66c2f4dd5a"],"state_sha256":"436c864849b30c69f207fe9914c5812c59d4b7fc985fc570ab69f7f0af099bf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekotIbpJEeqBSJqr0K6fAVWMjd018+Geg+EsGCH/a3AAJtYs2SoQkMwEWZ9aYmrHBSZ5rB50FmF04R/lUI9VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:41:50.500666Z","bundle_sha256":"577623277168f516f0cddb4f79514194f970e01add80becf1898d598fcea7576"}}