{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VHOVMXQ7QCB2CATOVWAB3OWN57","short_pith_number":"pith:VHOVMXQ7","canonical_record":{"source":{"id":"2303.14289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-24T22:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"c5907da893bc68286e092e68bc777095176f31412c26b7882a805bc01b259ad6","abstract_canon_sha256":"d5975b4bd0240c9935e48be1498921fca165e6f1428a7704c16eea34cac94dc9"},"schema_version":"1.0"},"canonical_sha256":"a9dd565e1f8083a1026ead801dbacdefc393012f0e3938a9f09dacf0d8bfc2b0","source":{"kind":"arxiv","id":"2303.14289","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14289","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14289v2","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14289","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"VHOVMXQ7QCB2","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_16","alias_value":"VHOVMXQ7QCB2CATO","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_8","alias_value":"VHOVMXQ7","created_at":"2026-07-05T07:15:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VHOVMXQ7QCB2CATOVWAB3OWN57","target":"record","payload":{"canonical_record":{"source":{"id":"2303.14289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-24T22:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"c5907da893bc68286e092e68bc777095176f31412c26b7882a805bc01b259ad6","abstract_canon_sha256":"d5975b4bd0240c9935e48be1498921fca165e6f1428a7704c16eea34cac94dc9"},"schema_version":"1.0"},"canonical_sha256":"a9dd565e1f8083a1026ead801dbacdefc393012f0e3938a9f09dacf0d8bfc2b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:53.404041Z","signature_b64":"Q19TAWYkWUwtBCAmf9geY3SFQMg/maojuYkbcJpGAwGN2DN9nDUF0QLdSY05G4oGFo253DH5kpkge+aMVh4XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dd565e1f8083a1026ead801dbacdefc393012f0e3938a9f09dacf0d8bfc2b0","last_reissued_at":"2026-07-05T07:15:53.403519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:53.403519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.14289","source_version":2,"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-07-05T07:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIy5hRcqjQONdtAImVBXp0YLgZNnUcpixlP2pmhemcxHsueS/Dvsi9qKx8ftswKkPCvj+hZmZ4+GrGtHhUNiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:49:45.528790Z"},"content_sha256":"0765f85b9b2b11a48bfbee2563c6123040f4fabd8a849553e7d25b0af2750172","schema_version":"1.0","event_id":"sha256:0765f85b9b2b11a48bfbee2563c6123040f4fabd8a849553e7d25b0af2750172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VHOVMXQ7QCB2CATOVWAB3OWN57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balancing Communication and Computation in Gradient Tracking Algorithms for Decentralized Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Albert S. Berahas, Raghu Bollapragada, Shagun Gupta","submitted_at":"2023-03-24T22:14:31Z","abstract_excerpt":"Gradient tracking methods have emerged as one of the most popular approaches for solving decentralized optimization problems over networks. In this setting, each node in the network has a portion of the global objective function, and the goal is to collectively optimize this function. At every iteration, gradient tracking methods perform two operations (steps): $(1)$ compute local gradients, and $(2)$ communicate information with local neighbors in the network. The complexity of these two steps varies across different applications. In this paper, we present a framework that unifies gradient tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14289","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.14289/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSwnHxoY8c9XIms9MIitxcnzZQmZHWKSWaYP6qWRJZ16419qB6OpNPXO1YJQ/mlb4iEt6ln/U8QquHJRzW9MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:49:45.529293Z"},"content_sha256":"53f97ecc4905c2aca9e24c3ea29a4cd3a82245ec9cfca8e5715d93cce66619f1","schema_version":"1.0","event_id":"sha256:53f97ecc4905c2aca9e24c3ea29a4cd3a82245ec9cfca8e5715d93cce66619f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/bundle.json","state_url":"https://pith.science/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/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-10T11:49:45Z","links":{"resolver":"https://pith.science/pith/VHOVMXQ7QCB2CATOVWAB3OWN57","bundle":"https://pith.science/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/bundle.json","state":"https://pith.science/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHOVMXQ7QCB2CATOVWAB3OWN57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VHOVMXQ7QCB2CATOVWAB3OWN57","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":"d5975b4bd0240c9935e48be1498921fca165e6f1428a7704c16eea34cac94dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-24T22:14:31Z","title_canon_sha256":"c5907da893bc68286e092e68bc777095176f31412c26b7882a805bc01b259ad6"},"schema_version":"1.0","source":{"id":"2303.14289","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14289","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14289v2","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14289","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"VHOVMXQ7QCB2","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_16","alias_value":"VHOVMXQ7QCB2CATO","created_at":"2026-07-05T07:15:53Z"},{"alias_kind":"pith_short_8","alias_value":"VHOVMXQ7","created_at":"2026-07-05T07:15:53Z"}],"graph_snapshots":[{"event_id":"sha256:53f97ecc4905c2aca9e24c3ea29a4cd3a82245ec9cfca8e5715d93cce66619f1","target":"graph","created_at":"2026-07-05T07:15: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.14289/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gradient tracking methods have emerged as one of the most popular approaches for solving decentralized optimization problems over networks. In this setting, each node in the network has a portion of the global objective function, and the goal is to collectively optimize this function. At every iteration, gradient tracking methods perform two operations (steps): $(1)$ compute local gradients, and $(2)$ communicate information with local neighbors in the network. The complexity of these two steps varies across different applications. In this paper, we present a framework that unifies gradient tr","authors_text":"Albert S. Berahas, Raghu Bollapragada, Shagun Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-24T22:14:31Z","title":"Balancing Communication and Computation in Gradient Tracking Algorithms for Decentralized Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14289","kind":"arxiv","version":2},"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:0765f85b9b2b11a48bfbee2563c6123040f4fabd8a849553e7d25b0af2750172","target":"record","created_at":"2026-07-05T07:15: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":"d5975b4bd0240c9935e48be1498921fca165e6f1428a7704c16eea34cac94dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-24T22:14:31Z","title_canon_sha256":"c5907da893bc68286e092e68bc777095176f31412c26b7882a805bc01b259ad6"},"schema_version":"1.0","source":{"id":"2303.14289","kind":"arxiv","version":2}},"canonical_sha256":"a9dd565e1f8083a1026ead801dbacdefc393012f0e3938a9f09dacf0d8bfc2b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9dd565e1f8083a1026ead801dbacdefc393012f0e3938a9f09dacf0d8bfc2b0","first_computed_at":"2026-07-05T07:15:53.403519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:53.403519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q19TAWYkWUwtBCAmf9geY3SFQMg/maojuYkbcJpGAwGN2DN9nDUF0QLdSY05G4oGFo253DH5kpkge+aMVh4XBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:53.404041Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.14289","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0765f85b9b2b11a48bfbee2563c6123040f4fabd8a849553e7d25b0af2750172","sha256:53f97ecc4905c2aca9e24c3ea29a4cd3a82245ec9cfca8e5715d93cce66619f1"],"state_sha256":"fb16d4ba373c7dfcaf33d4a6e4a1ec1193a90e53c1a95be8545a124d0cf13c8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtNlY4HUBvGbSfLqv+Y8cLGJecAQK9sqQ5aEumU9qw42SP/8rOXTc92z7sCIPPKDuf9RuPUfliwmReaInCgDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T11:49:45.534578Z","bundle_sha256":"54f0995c73f5c55eef8ea44a3732f512ad3ebc06c2b0e88b6fbdbb70bb1f24be"}}