{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MRBP6F3HFNJBSOEQ22XH54SJYV","short_pith_number":"pith:MRBP6F3H","canonical_record":{"source":{"id":"1004.0969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T20:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"7f594cc23bc484d013616417b2fd0f59f71009a4297686fc5f0c9e7f25f248ed","abstract_canon_sha256":"5ea696d7bb5b2813d1f2a0727642ccb1695cad930c91c6210fcbba4393b37a8c"},"schema_version":"1.0"},"canonical_sha256":"6442ff17672b52193890d6ae7ef249c573ae29497e2d3184b5420148f24a4ef7","source":{"kind":"arxiv","id":"1004.0969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0969","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0969v1","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0969","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"MRBP6F3HFNJB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MRBP6F3HFNJBSOEQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MRBP6F3H","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MRBP6F3HFNJBSOEQ22XH54SJYV","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T20:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"7f594cc23bc484d013616417b2fd0f59f71009a4297686fc5f0c9e7f25f248ed","abstract_canon_sha256":"5ea696d7bb5b2813d1f2a0727642ccb1695cad930c91c6210fcbba4393b37a8c"},"schema_version":"1.0"},"canonical_sha256":"6442ff17672b52193890d6ae7ef249c573ae29497e2d3184b5420148f24a4ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:17.179495Z","signature_b64":"bWE4P6o2t4TucY7vAgngzgTwO4wESoYAc8HWN5HRLDYf/UAH0hzCm5hs8bcG/uHhaUAHrdx1K6rofMcVNXMZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6442ff17672b52193890d6ae7ef249c573ae29497e2d3184b5420148f24a4ef7","last_reissued_at":"2026-05-18T02:24:17.178756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:17.178756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0969","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-18T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fey/+WTnEz0v3jInKlQGreO8t1jqnmM608kJKmRcrIwH2f5inDtzahvQKdF2BfULHJkgxNpV4Q6aWFI6M8s9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:59:23.450129Z"},"content_sha256":"6701546c644a24bb9fef9841d8af2cb69868a9b5422bc4fc8f12205ed628ade3","schema_version":"1.0","event_id":"sha256:6701546c644a24bb9fef9841d8af2cb69868a9b5422bc4fc8f12205ed628ade3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MRBP6F3HFNJBSOEQ22XH54SJYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Multi-Agent Optimization with State-Dependent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asuman Ozdaglar, Diego Feijer, Ilan Lobel","submitted_at":"2010-04-06T20:29:50Z","abstract_excerpt":"We study distributed algorithms for solving global optimization problems in which the objective function is the sum of local objective functions of agents and the constraint set is given by the intersection of local constraint sets of agents. We assume that each agent knows only his own local objective function and constraint set, and exchanges information with the other agents over a randomly varying network topology to update his information state. We assume a state-dependent communication model over this topology: communication is Markovian with respect to the states of the agents and the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0969","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-18T02:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxcsKSER958XfLuhTo4lhrIoIn6ueY3AYvOnwigXrXW+cUzj0wCOKxCwfyOfblX7nv581stdNTW+QygTqrsgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:59:23.450839Z"},"content_sha256":"daca6c00c67da5a828efaf500063e3631ae764356ed10caa82c5bb28ee8d58e4","schema_version":"1.0","event_id":"sha256:daca6c00c67da5a828efaf500063e3631ae764356ed10caa82c5bb28ee8d58e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/bundle.json","state_url":"https://pith.science/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/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-08T20:59:23Z","links":{"resolver":"https://pith.science/pith/MRBP6F3HFNJBSOEQ22XH54SJYV","bundle":"https://pith.science/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/bundle.json","state":"https://pith.science/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRBP6F3HFNJBSOEQ22XH54SJYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MRBP6F3HFNJBSOEQ22XH54SJYV","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":"5ea696d7bb5b2813d1f2a0727642ccb1695cad930c91c6210fcbba4393b37a8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T20:29:50Z","title_canon_sha256":"7f594cc23bc484d013616417b2fd0f59f71009a4297686fc5f0c9e7f25f248ed"},"schema_version":"1.0","source":{"id":"1004.0969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0969","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0969v1","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0969","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"MRBP6F3HFNJB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MRBP6F3HFNJBSOEQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MRBP6F3H","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:daca6c00c67da5a828efaf500063e3631ae764356ed10caa82c5bb28ee8d58e4","target":"graph","created_at":"2026-05-18T02:24:17Z","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 distributed algorithms for solving global optimization problems in which the objective function is the sum of local objective functions of agents and the constraint set is given by the intersection of local constraint sets of agents. We assume that each agent knows only his own local objective function and constraint set, and exchanges information with the other agents over a randomly varying network topology to update his information state. We assume a state-dependent communication model over this topology: communication is Markovian with respect to the states of the agents and the p","authors_text":"Asuman Ozdaglar, Diego Feijer, Ilan Lobel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T20:29:50Z","title":"Distributed Multi-Agent Optimization with State-Dependent Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0969","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:6701546c644a24bb9fef9841d8af2cb69868a9b5422bc4fc8f12205ed628ade3","target":"record","created_at":"2026-05-18T02:24:17Z","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":"5ea696d7bb5b2813d1f2a0727642ccb1695cad930c91c6210fcbba4393b37a8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T20:29:50Z","title_canon_sha256":"7f594cc23bc484d013616417b2fd0f59f71009a4297686fc5f0c9e7f25f248ed"},"schema_version":"1.0","source":{"id":"1004.0969","kind":"arxiv","version":1}},"canonical_sha256":"6442ff17672b52193890d6ae7ef249c573ae29497e2d3184b5420148f24a4ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6442ff17672b52193890d6ae7ef249c573ae29497e2d3184b5420148f24a4ef7","first_computed_at":"2026-05-18T02:24:17.178756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:17.178756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bWE4P6o2t4TucY7vAgngzgTwO4wESoYAc8HWN5HRLDYf/UAH0hzCm5hs8bcG/uHhaUAHrdx1K6rofMcVNXMZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:17.179495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6701546c644a24bb9fef9841d8af2cb69868a9b5422bc4fc8f12205ed628ade3","sha256:daca6c00c67da5a828efaf500063e3631ae764356ed10caa82c5bb28ee8d58e4"],"state_sha256":"450073ab89ba80a9cd5276a0d5a239e95b89614696fc4dcb811b38602c9e635d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni7dcdyKVQcqfKvnIFUZ/eaa1JFvaHGgDclV08ciTX6oZAeWH9ncgG9RlLNVTIVoi3z8wirADv1xMVFujmzQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:59:23.455346Z","bundle_sha256":"27d69751d92772bd2b02d23fe35dd9862ad4595a5f8ef2f677c0ab0c4ae21675"}}