{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XOMPIWRIDYAGKBBMLPGSC2Q4ID","short_pith_number":"pith:XOMPIWRI","canonical_record":{"source":{"id":"1803.02503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T02:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"6d23ffdf903674629ed01406221110a6657851cfa83eeb192f4130b2f2491135","abstract_canon_sha256":"7914bbb7b08805d64cf974a35d6c02b3027d94399945d148231c3f90145aa9d3"},"schema_version":"1.0"},"canonical_sha256":"bb98f45a281e0065042c5bcd216a1c40ffad367a59fcbfec63dc4dfe2f27bb64","source":{"kind":"arxiv","id":"1803.02503","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02503","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02503v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02503","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"XOMPIWRIDYAG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOMPIWRIDYAGKBBM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOMPIWRI","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XOMPIWRIDYAGKBBMLPGSC2Q4ID","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T02:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"6d23ffdf903674629ed01406221110a6657851cfa83eeb192f4130b2f2491135","abstract_canon_sha256":"7914bbb7b08805d64cf974a35d6c02b3027d94399945d148231c3f90145aa9d3"},"schema_version":"1.0"},"canonical_sha256":"bb98f45a281e0065042c5bcd216a1c40ffad367a59fcbfec63dc4dfe2f27bb64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.154007Z","signature_b64":"tWvqRA7BYbEUTaKPy61BcHWy4cX8v+7/KF1C4Pm+khZu2QwY0V59ij29tv6Vc3wGHXM82X3R3DBYHpe1fJsJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb98f45a281e0065042c5bcd216a1c40ffad367a59fcbfec63dc4dfe2f27bb64","last_reissued_at":"2026-05-18T00:14:00.153293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.153293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02503","source_version":3,"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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54s5HLrf/uNKJ+XLIysKB1MEEuu89XDvfRC4uLWS2UE1mA9ZLNsjdU8PewUN8L8RY6xtwT2bk0x0FUg1Gp+zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T23:54:02.927067Z"},"content_sha256":"e16f78a8fa04b19c832b05bde42e3fedde27b0a2d3e397023e9dee473578cb86","schema_version":"1.0","event_id":"sha256:e16f78a8fa04b19c832b05bde42e3fedde27b0a2d3e397023e9dee473578cb86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XOMPIWRIDYAGKBBMLPGSC2Q4ID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear algorithm for optimization over directed graphs with geometric convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ran Xin, Usman A. Khan","submitted_at":"2018-03-07T02:32:34Z","abstract_excerpt":"In this letter, we study distributed optimization, where a network of agents, abstracted as a directed graph, collaborates to minimize the average of locally-known convex functions. Most of the existing approaches over directed graphs are based on push-sum (type) techniques, which use an independent algorithm to asymptotically learn either the left or right eigenvector of the underlying weight matrices. This strategy causes additional computation, communication, and nonlinearity in the algorithm. In contrast, we propose a linear algorithm based on an inexact gradient method and a gradient esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02503","kind":"arxiv","version":3},"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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HA2suPjFq5z7BF5Wz7+PFVn2TBz3ZJ2CeQwTxgBGpvlV97MPxncL/7CPdwjEBhtTSSRCLFy2XcpkQiZGuR3BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T23:54:02.927415Z"},"content_sha256":"d64be6e86b9ac1c54c51ca27e1834431d45fae43c6e879c9e13d20f16c50cff0","schema_version":"1.0","event_id":"sha256:d64be6e86b9ac1c54c51ca27e1834431d45fae43c6e879c9e13d20f16c50cff0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/bundle.json","state_url":"https://pith.science/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/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-07-14T23:54:02Z","links":{"resolver":"https://pith.science/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID","bundle":"https://pith.science/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/bundle.json","state":"https://pith.science/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOMPIWRIDYAGKBBMLPGSC2Q4ID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XOMPIWRIDYAGKBBMLPGSC2Q4ID","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":"7914bbb7b08805d64cf974a35d6c02b3027d94399945d148231c3f90145aa9d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T02:32:34Z","title_canon_sha256":"6d23ffdf903674629ed01406221110a6657851cfa83eeb192f4130b2f2491135"},"schema_version":"1.0","source":{"id":"1803.02503","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02503","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02503v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02503","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"XOMPIWRIDYAG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOMPIWRIDYAGKBBM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOMPIWRI","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:d64be6e86b9ac1c54c51ca27e1834431d45fae43c6e879c9e13d20f16c50cff0","target":"graph","created_at":"2026-05-18T00:14:00Z","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 letter, we study distributed optimization, where a network of agents, abstracted as a directed graph, collaborates to minimize the average of locally-known convex functions. Most of the existing approaches over directed graphs are based on push-sum (type) techniques, which use an independent algorithm to asymptotically learn either the left or right eigenvector of the underlying weight matrices. This strategy causes additional computation, communication, and nonlinearity in the algorithm. In contrast, we propose a linear algorithm based on an inexact gradient method and a gradient esti","authors_text":"Ran Xin, Usman A. Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T02:32:34Z","title":"A linear algorithm for optimization over directed graphs with geometric convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02503","kind":"arxiv","version":3},"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:e16f78a8fa04b19c832b05bde42e3fedde27b0a2d3e397023e9dee473578cb86","target":"record","created_at":"2026-05-18T00:14:00Z","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":"7914bbb7b08805d64cf974a35d6c02b3027d94399945d148231c3f90145aa9d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T02:32:34Z","title_canon_sha256":"6d23ffdf903674629ed01406221110a6657851cfa83eeb192f4130b2f2491135"},"schema_version":"1.0","source":{"id":"1803.02503","kind":"arxiv","version":3}},"canonical_sha256":"bb98f45a281e0065042c5bcd216a1c40ffad367a59fcbfec63dc4dfe2f27bb64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb98f45a281e0065042c5bcd216a1c40ffad367a59fcbfec63dc4dfe2f27bb64","first_computed_at":"2026-05-18T00:14:00.153293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.153293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWvqRA7BYbEUTaKPy61BcHWy4cX8v+7/KF1C4Pm+khZu2QwY0V59ij29tv6Vc3wGHXM82X3R3DBYHpe1fJsJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.154007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02503","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16f78a8fa04b19c832b05bde42e3fedde27b0a2d3e397023e9dee473578cb86","sha256:d64be6e86b9ac1c54c51ca27e1834431d45fae43c6e879c9e13d20f16c50cff0"],"state_sha256":"d2f7d5e3664867190158578982bc39f5a242fcc4b100c540d81d67a3e5d2aa8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBfnFilrenc88s/TMLhfv/cPMOZXVA4jZtW3rHj8PSC1JW2IR4b8FgJ1lOV2FjyvcbUmzrTQ1VND24ps89BCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T23:54:02.929349Z","bundle_sha256":"2f38202947563c965eb8d4ba6284da29f22a6b1ce81a7c497a970f2194e05529"}}