{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4GNWNHJSKTBX5QXSD5SCULAWU3","short_pith_number":"pith:4GNWNHJS","canonical_record":{"source":{"id":"1511.01821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-05T17:28:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f72eb1a2d18c6e8b5b0c69867b1f562774d3c003899700582b040bd8f24f30cf","abstract_canon_sha256":"b766fbce06dd3656c5a4228251ffe96ceff177dee31e1e7871086cf4aa98c13f"},"schema_version":"1.0"},"canonical_sha256":"e19b669d3254c37ec2f21f642a2c16a6e88ebcab87417ba8cbf52a710411582e","source":{"kind":"arxiv","id":"1511.01821","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01821","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01821v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01821","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"4GNWNHJSKTBX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4GNWNHJSKTBX5QXS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4GNWNHJS","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4GNWNHJSKTBX5QXSD5SCULAWU3","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-05T17:28:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f72eb1a2d18c6e8b5b0c69867b1f562774d3c003899700582b040bd8f24f30cf","abstract_canon_sha256":"b766fbce06dd3656c5a4228251ffe96ceff177dee31e1e7871086cf4aa98c13f"},"schema_version":"1.0"},"canonical_sha256":"e19b669d3254c37ec2f21f642a2c16a6e88ebcab87417ba8cbf52a710411582e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.696529Z","signature_b64":"2al+J2UCDfP/P6pR/9vYhlxfrBTfTlvPxCkmh13UlG6dO2duWhEKlmtyzY0RPOHrkgzjBUqDTv8dsDD6hJuwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e19b669d3254c37ec2f21f642a2c16a6e88ebcab87417ba8cbf52a710411582e","last_reissued_at":"2026-05-18T01:27:39.696102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.696102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01821","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:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/i1p3TdxmAkT+EJyBzSyw7aAL4mrw0yoDq57DULCydOi+0z54FSy8FmR/Uy2SqZ+he/QElMXlkzn0ptTezGaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:28.386083Z"},"content_sha256":"fa2cbd9fdec1dee0f8c1b57f708592b19146e6a824cf2189a9db6207ba633b8f","schema_version":"1.0","event_id":"sha256:fa2cbd9fdec1dee0f8c1b57f708592b19146e6a824cf2189a9db6207ba633b8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4GNWNHJSKTBX5QXSD5SCULAWU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Lili Su, Nitin H. Vaidya","submitted_at":"2015-11-05T17:28:35Z","abstract_excerpt":"We study the problem of constrained distributed optimization in multi-agent networks when some of the computing agents may be faulty. In this problem, the system goal is to have all the non-faulty agents collectively minimize a global objective given by weighted average of local cost functions, each of which is initially known to a non-faulty agent only. In particular, we are interested in the scenario when the computing agents are connected by an arbitrary directed communication network, some of the agents may suffer from crash faults or Byzantine faults, and the estimate of each agent is res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01821","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:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrHyd+mPnO38/O5KfY1+iszVs85NOMLcIgIq7kHen9vM7rSqc4NuS51SUZ0JzXOysu7TDa6Vk1kULEDGDdnrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:28.386457Z"},"content_sha256":"e4c8168ff43c627375f3c163e07f03201120ab71fbb1c3fb1d628565f04941aa","schema_version":"1.0","event_id":"sha256:e4c8168ff43c627375f3c163e07f03201120ab71fbb1c3fb1d628565f04941aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/bundle.json","state_url":"https://pith.science/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/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-10T22:46:28Z","links":{"resolver":"https://pith.science/pith/4GNWNHJSKTBX5QXSD5SCULAWU3","bundle":"https://pith.science/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/bundle.json","state":"https://pith.science/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GNWNHJSKTBX5QXSD5SCULAWU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4GNWNHJSKTBX5QXSD5SCULAWU3","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":"b766fbce06dd3656c5a4228251ffe96ceff177dee31e1e7871086cf4aa98c13f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-05T17:28:35Z","title_canon_sha256":"f72eb1a2d18c6e8b5b0c69867b1f562774d3c003899700582b040bd8f24f30cf"},"schema_version":"1.0","source":{"id":"1511.01821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01821","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01821v1","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01821","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"4GNWNHJSKTBX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4GNWNHJSKTBX5QXS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4GNWNHJS","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e4c8168ff43c627375f3c163e07f03201120ab71fbb1c3fb1d628565f04941aa","target":"graph","created_at":"2026-05-18T01:27:39Z","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":"We study the problem of constrained distributed optimization in multi-agent networks when some of the computing agents may be faulty. In this problem, the system goal is to have all the non-faulty agents collectively minimize a global objective given by weighted average of local cost functions, each of which is initially known to a non-faulty agent only. In particular, we are interested in the scenario when the computing agents are connected by an arbitrary directed communication network, some of the agents may suffer from crash faults or Byzantine faults, and the estimate of each agent is res","authors_text":"Lili Su, Nitin H. Vaidya","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-05T17:28:35Z","title":"Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01821","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:fa2cbd9fdec1dee0f8c1b57f708592b19146e6a824cf2189a9db6207ba633b8f","target":"record","created_at":"2026-05-18T01:27:39Z","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":"b766fbce06dd3656c5a4228251ffe96ceff177dee31e1e7871086cf4aa98c13f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-05T17:28:35Z","title_canon_sha256":"f72eb1a2d18c6e8b5b0c69867b1f562774d3c003899700582b040bd8f24f30cf"},"schema_version":"1.0","source":{"id":"1511.01821","kind":"arxiv","version":1}},"canonical_sha256":"e19b669d3254c37ec2f21f642a2c16a6e88ebcab87417ba8cbf52a710411582e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e19b669d3254c37ec2f21f642a2c16a6e88ebcab87417ba8cbf52a710411582e","first_computed_at":"2026-05-18T01:27:39.696102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.696102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2al+J2UCDfP/P6pR/9vYhlxfrBTfTlvPxCkmh13UlG6dO2duWhEKlmtyzY0RPOHrkgzjBUqDTv8dsDD6hJuwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.696529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01821","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa2cbd9fdec1dee0f8c1b57f708592b19146e6a824cf2189a9db6207ba633b8f","sha256:e4c8168ff43c627375f3c163e07f03201120ab71fbb1c3fb1d628565f04941aa"],"state_sha256":"b2100469903f3624a2b4cf6f3fad9ce3407f0b3cd8763f6ba867d5ffcfc0d120"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCMgTn5wfE9iCEe4EpSZhUE3t3jFO6LFIogm7PZC6zT0i7/A0qeiclV1vmMBGlj9BvoeEOi2UxgNDxb3pkg9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:46:28.388719Z","bundle_sha256":"b2e5db306fc1eaeded6b0e2be240708cd52bbb20e2c45430a090c7ef6c89ea63"}}