{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HBR72LR2YTFVW6AK33Z4PY55SZ","short_pith_number":"pith:HBR72LR2","canonical_record":{"source":{"id":"1606.06593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-21T14:26:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"423b06aa18c0471c95b87789283eaf86ad113f7e7452abc0f706199d005bc332","abstract_canon_sha256":"4fb404f8d87bf89735724305bec65561131924bc79ffa6eeda97e37e09971802"},"schema_version":"1.0"},"canonical_sha256":"3863fd2e3ac4cb5b780adef3c7e3bd966fb9a9912b1e5557ab9a8d5af8d731ee","source":{"kind":"arxiv","id":"1606.06593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06593","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06593v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06593","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"HBR72LR2YTFV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HBR72LR2YTFVW6AK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HBR72LR2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HBR72LR2YTFVW6AK33Z4PY55SZ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-21T14:26:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"423b06aa18c0471c95b87789283eaf86ad113f7e7452abc0f706199d005bc332","abstract_canon_sha256":"4fb404f8d87bf89735724305bec65561131924bc79ffa6eeda97e37e09971802"},"schema_version":"1.0"},"canonical_sha256":"3863fd2e3ac4cb5b780adef3c7e3bd966fb9a9912b1e5557ab9a8d5af8d731ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.141842Z","signature_b64":"CaO0dgfyh3QgHetKBOpHcgskXllmz9Gu87IinDGdB16L4gXPshH+WwYXwimHIKnnk8pJIgY5Vpr5scn1ctXrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3863fd2e3ac4cb5b780adef3c7e3bd966fb9a9912b1e5557ab9a8d5af8d731ee","last_reissued_at":"2026-05-18T01:12:09.141277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.141277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06593","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6grkfZmMaPsIx3ft+wj12yup1Uyi7DMTF+3wOyG7B5gUIddiQ924Ewgk6zfLo6TURSsX8pUZBGmr5+spvrS8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:18.715126Z"},"content_sha256":"bf50c7d0260bce566b01a23812a679095afacc44589a4b1e8ebffea3652f9fd5","schema_version":"1.0","event_id":"sha256:bf50c7d0260bce566b01a23812a679095afacc44589a4b1e8ebffea3652f9fd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HBR72LR2YTFVW6AK33Z4PY55SZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Newton Method for Large Scale Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2016-06-21T14:26:01Z","abstract_excerpt":"In this paper, we propose a distributed Newton method for consensus optimization. Our approach outperforms state-of-the-art methods, including ADMM. The key idea is to exploit the sparsity of the dual Hessian and recast the computation of the Newton step as one of efficiently solving symmetric diagonally dominant linear equations. We validate our algorithm both theoretically and empirically. On the theory side, we demonstrate that our algorithm exhibits superlinear convergence within a neighborhood of optimality. Empirically, we show the superiority of this new method on a variety of machine l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06593","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBgjpMLGghZsq+GyLasBmm78c+Gi4Ha+fkVWfdXtulphBbX0vbTBPZTaG9cd+D+nEH25yG6LWrKLYXO98BGSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:18.715865Z"},"content_sha256":"7bc5d2188cb4ed34f14c01517ae744dacb79ffcd44a82885224f6ae71600ac16","schema_version":"1.0","event_id":"sha256:7bc5d2188cb4ed34f14c01517ae744dacb79ffcd44a82885224f6ae71600ac16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/bundle.json","state_url":"https://pith.science/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/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-31T02:13:18Z","links":{"resolver":"https://pith.science/pith/HBR72LR2YTFVW6AK33Z4PY55SZ","bundle":"https://pith.science/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/bundle.json","state":"https://pith.science/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBR72LR2YTFVW6AK33Z4PY55SZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HBR72LR2YTFVW6AK33Z4PY55SZ","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":"4fb404f8d87bf89735724305bec65561131924bc79ffa6eeda97e37e09971802","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-21T14:26:01Z","title_canon_sha256":"423b06aa18c0471c95b87789283eaf86ad113f7e7452abc0f706199d005bc332"},"schema_version":"1.0","source":{"id":"1606.06593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06593","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06593v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06593","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"HBR72LR2YTFV","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HBR72LR2YTFVW6AK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HBR72LR2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:7bc5d2188cb4ed34f14c01517ae744dacb79ffcd44a82885224f6ae71600ac16","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"In this paper, we propose a distributed Newton method for consensus optimization. Our approach outperforms state-of-the-art methods, including ADMM. The key idea is to exploit the sparsity of the dual Hessian and recast the computation of the Newton step as one of efficiently solving symmetric diagonally dominant linear equations. We validate our algorithm both theoretically and empirically. On the theory side, we demonstrate that our algorithm exhibits superlinear convergence within a neighborhood of optimality. Empirically, we show the superiority of this new method on a variety of machine l","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-21T14:26:01Z","title":"A Distributed Newton Method for Large Scale Consensus Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06593","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:bf50c7d0260bce566b01a23812a679095afacc44589a4b1e8ebffea3652f9fd5","target":"record","created_at":"2026-05-18T01:12:09Z","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":"4fb404f8d87bf89735724305bec65561131924bc79ffa6eeda97e37e09971802","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-21T14:26:01Z","title_canon_sha256":"423b06aa18c0471c95b87789283eaf86ad113f7e7452abc0f706199d005bc332"},"schema_version":"1.0","source":{"id":"1606.06593","kind":"arxiv","version":1}},"canonical_sha256":"3863fd2e3ac4cb5b780adef3c7e3bd966fb9a9912b1e5557ab9a8d5af8d731ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3863fd2e3ac4cb5b780adef3c7e3bd966fb9a9912b1e5557ab9a8d5af8d731ee","first_computed_at":"2026-05-18T01:12:09.141277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.141277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CaO0dgfyh3QgHetKBOpHcgskXllmz9Gu87IinDGdB16L4gXPshH+WwYXwimHIKnnk8pJIgY5Vpr5scn1ctXrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.141842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf50c7d0260bce566b01a23812a679095afacc44589a4b1e8ebffea3652f9fd5","sha256:7bc5d2188cb4ed34f14c01517ae744dacb79ffcd44a82885224f6ae71600ac16"],"state_sha256":"5eb3dbbaeab7a90f61da67b2b0fd2cfc3071bc1d96c7aa0b144fa9fb056ec7dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDBo2r2mO2XRmjmPpws36QeYQJJ7DFB9HVnFCLKDphyMde9Yf9lYovRId8IWdJ8g/buAQRA1k7bI8vzz0Q8YDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:13:18.719527Z","bundle_sha256":"cd7d34aa837b5e267d3e1d95952b7695dee7563d9ceb8715f4ca705d68676e67"}}