{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XCK4CTPR725KTNCOYFUG2VVG3B","short_pith_number":"pith:XCK4CTPR","canonical_record":{"source":{"id":"1305.1885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-08T17:15:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2d84970571e056f9a4e3eae437bc43f2aea23cf1427f870bb96b2f63f81fcbbb","abstract_canon_sha256":"2cb9eb768125addd2394274bc665617854e17c1326d2c7fce646589e31ad9bc5"},"schema_version":"1.0"},"canonical_sha256":"b895c14df1febaa9b44ec1686d56a6d87d60ce000356784f8ea7b9c927db1eb6","source":{"kind":"arxiv","id":"1305.1885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1885","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1885v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1885","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"XCK4CTPR725K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XCK4CTPR725KTNCO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XCK4CTPR","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XCK4CTPR725KTNCOYFUG2VVG3B","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-08T17:15:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2d84970571e056f9a4e3eae437bc43f2aea23cf1427f870bb96b2f63f81fcbbb","abstract_canon_sha256":"2cb9eb768125addd2394274bc665617854e17c1326d2c7fce646589e31ad9bc5"},"schema_version":"1.0"},"canonical_sha256":"b895c14df1febaa9b44ec1686d56a6d87d60ce000356784f8ea7b9c927db1eb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.092107Z","signature_b64":"pZtgCBaxzqcSiFihWj806b9KUeyJ7BOc1wK7aGJDntnlU4f/DamQlSlsd2v5WmfcNKS6MUtHnPTBweySTV16Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b895c14df1febaa9b44ec1686d56a6d87d60ce000356784f8ea7b9c927db1eb6","last_reissued_at":"2026-05-18T00:59:04.091298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.091298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1885","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phdoxJ5FFRW68/kh9viKaurQaiUHtOJi5k6RSqMSQYAja5XuPhltoibE361s35yw/LihrP0FwFsHDllnWjjRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:33:21.201000Z"},"content_sha256":"c8dcbf42168b7167e3be7c8d95218871d773dedaeaa719529342e88e68992b56","schema_version":"1.0","event_id":"sha256:c8dcbf42168b7167e3be7c8d95218871d773dedaeaa719529342e88e68992b56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XCK4CTPR725KTNCOYFUG2VVG3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Optimization With Local Domains: Applications in MPC and Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2013-05-08T17:15:06Z","abstract_excerpt":"In this paper we consider a network with $P$ nodes, where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorithm that finds a vector $x^\\star$ minimizing the sum of all the functions. We make the additional assumption that the functions have intersecting local domains, i.e., each function depends only on some components of the variable. Consequently, each node is interested in knowing only some components of $x^\\star$, not the entire vector. This allows for improvement in communication-efficiency. We apply our algorithm to m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1885","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-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTmpz25h2U0ehqYoHaG5jLhASLPzBPWBDkzQKjaSwKUZ++RzCuvqJhwL5zkKBAn9G9DWyH5rvh1+3qXtiyQYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:33:21.201361Z"},"content_sha256":"e3abdbcf669052185dd2f56f266c2c3cab1b1a5519466eeb02cf52d132d6cd3f","schema_version":"1.0","event_id":"sha256:e3abdbcf669052185dd2f56f266c2c3cab1b1a5519466eeb02cf52d132d6cd3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCK4CTPR725KTNCOYFUG2VVG3B/bundle.json","state_url":"https://pith.science/pith/XCK4CTPR725KTNCOYFUG2VVG3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCK4CTPR725KTNCOYFUG2VVG3B/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-06T16:33:21Z","links":{"resolver":"https://pith.science/pith/XCK4CTPR725KTNCOYFUG2VVG3B","bundle":"https://pith.science/pith/XCK4CTPR725KTNCOYFUG2VVG3B/bundle.json","state":"https://pith.science/pith/XCK4CTPR725KTNCOYFUG2VVG3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCK4CTPR725KTNCOYFUG2VVG3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XCK4CTPR725KTNCOYFUG2VVG3B","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":"2cb9eb768125addd2394274bc665617854e17c1326d2c7fce646589e31ad9bc5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-08T17:15:06Z","title_canon_sha256":"2d84970571e056f9a4e3eae437bc43f2aea23cf1427f870bb96b2f63f81fcbbb"},"schema_version":"1.0","source":{"id":"1305.1885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1885","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1885v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1885","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"XCK4CTPR725K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XCK4CTPR725KTNCO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XCK4CTPR","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:e3abdbcf669052185dd2f56f266c2c3cab1b1a5519466eeb02cf52d132d6cd3f","target":"graph","created_at":"2026-05-18T00:59:04Z","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 consider a network with $P$ nodes, where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorithm that finds a vector $x^\\star$ minimizing the sum of all the functions. We make the additional assumption that the functions have intersecting local domains, i.e., each function depends only on some components of the variable. Consequently, each node is interested in knowing only some components of $x^\\star$, not the entire vector. This allows for improvement in communication-efficiency. We apply our algorithm to m","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-08T17:15:06Z","title":"Distributed Optimization With Local Domains: Applications in MPC and Network Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1885","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:c8dcbf42168b7167e3be7c8d95218871d773dedaeaa719529342e88e68992b56","target":"record","created_at":"2026-05-18T00:59:04Z","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":"2cb9eb768125addd2394274bc665617854e17c1326d2c7fce646589e31ad9bc5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-08T17:15:06Z","title_canon_sha256":"2d84970571e056f9a4e3eae437bc43f2aea23cf1427f870bb96b2f63f81fcbbb"},"schema_version":"1.0","source":{"id":"1305.1885","kind":"arxiv","version":1}},"canonical_sha256":"b895c14df1febaa9b44ec1686d56a6d87d60ce000356784f8ea7b9c927db1eb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b895c14df1febaa9b44ec1686d56a6d87d60ce000356784f8ea7b9c927db1eb6","first_computed_at":"2026-05-18T00:59:04.091298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.091298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pZtgCBaxzqcSiFihWj806b9KUeyJ7BOc1wK7aGJDntnlU4f/DamQlSlsd2v5WmfcNKS6MUtHnPTBweySTV16Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.092107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8dcbf42168b7167e3be7c8d95218871d773dedaeaa719529342e88e68992b56","sha256:e3abdbcf669052185dd2f56f266c2c3cab1b1a5519466eeb02cf52d132d6cd3f"],"state_sha256":"806a12e7197aa055d5a35ab04cf4583ec803993ea1f87cfe5ccbef95ee5fff9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOgI2TFrCWcnD7cgC1ioB6Wn1oEEQz6qoGYRWPhSl/h4qp54dYl5+ACyH9wqv983KwW1pzs78VT17NEBkoAmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:33:21.203450Z","bundle_sha256":"c1fc172faa59f5d6ed8e7c47301dfcb90d5db140dd8b0a73d00db59922078b02"}}