{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WEIB45VLWO3VAAA5K2HVPK6EM7","short_pith_number":"pith:WEIB45VL","canonical_record":{"source":{"id":"1302.0756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T17:02:33Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"9231aa89bad5c99289f3a0ed6e9477b7fe1fce93e62478d5c354e2dbc2c6e1b6","abstract_canon_sha256":"ce972c03343c2f7194903816a04bedd2750113acd2704043c2f4cc050dae657c"},"schema_version":"1.0"},"canonical_sha256":"b1101e76abb3b750001d568f57abc467ef4c4038cc77ab52b0b61e0cf5bf04b3","source":{"kind":"arxiv","id":"1302.0756","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0756","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0756v2","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0756","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"WEIB45VLWO3V","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WEIB45VLWO3VAAA5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WEIB45VL","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WEIB45VLWO3VAAA5K2HVPK6EM7","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T17:02:33Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"9231aa89bad5c99289f3a0ed6e9477b7fe1fce93e62478d5c354e2dbc2c6e1b6","abstract_canon_sha256":"ce972c03343c2f7194903816a04bedd2750113acd2704043c2f4cc050dae657c"},"schema_version":"1.0"},"canonical_sha256":"b1101e76abb3b750001d568f57abc467ef4c4038cc77ab52b0b61e0cf5bf04b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.616926Z","signature_b64":"AOrfm9Df9h+tBTTHzL5isC5IJi+4N2m9LjdgZjOzHo7DG6lDoao/O/y9IrBReIkKXGAQVK0KetR+XP5t4/QXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1101e76abb3b750001d568f57abc467ef4c4038cc77ab52b0b61e0cf5bf04b3","last_reissued_at":"2026-05-18T00:57:56.616476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.616476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0756","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-05-18T00:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/xzUVhABFmeS9eo/UNQUoTXes3I3IcfMiW9zio65rBc7vAYJl8o7ph8UK3bVW1tpzNIaWQ5aJcMhjWCXhV5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:47:40.995494Z"},"content_sha256":"90acee09fc77a9e73aeb917ac80ab8bbebf8e59a6afd035d9d0f928f36cea478","schema_version":"1.0","event_id":"sha256:90acee09fc77a9e73aeb917ac80ab8bbebf8e59a6afd035d9d0f928f36cea478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WEIB45VLWO3VAAA5K2HVPK6EM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Daniel P. Palomar, Francisco Facchinei, Gesualdo Scutari, Jong-Shi Pang, Peiran Song","submitted_at":"2013-02-04T17:02:33Z","abstract_excerpt":"We propose a novel decomposition framework for the distributed optimization of general nonconvex sum-utility functions arising naturally in the system design of wireless multiuser interfering systems. Our main contributions are: i) the development of the first class of (inexact) Jacobi best-response algorithms with provable convergence, where all the users simultaneously and iteratively solve a suitably convexified version of the original sum-utility optimization problem; ii) the derivation of a general dynamic pricing mechanism that provides a unified view of existing pricing schemes that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0756","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":""},"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38wNBBVSb/TlbFpVbkZA2JzN/59iO3WzAZqAFfHfSrqPmx0IE/PV+x0YcxLmCEzNM879UJnT8q3dm+euL13rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:47:40.995832Z"},"content_sha256":"71c675c36307e97da03182f6cf3f41f8e778e7eaac8aad2662cd78a18ff19501","schema_version":"1.0","event_id":"sha256:71c675c36307e97da03182f6cf3f41f8e778e7eaac8aad2662cd78a18ff19501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/bundle.json","state_url":"https://pith.science/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/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-20T14:47:40Z","links":{"resolver":"https://pith.science/pith/WEIB45VLWO3VAAA5K2HVPK6EM7","bundle":"https://pith.science/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/bundle.json","state":"https://pith.science/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEIB45VLWO3VAAA5K2HVPK6EM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WEIB45VLWO3VAAA5K2HVPK6EM7","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":"ce972c03343c2f7194903816a04bedd2750113acd2704043c2f4cc050dae657c","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T17:02:33Z","title_canon_sha256":"9231aa89bad5c99289f3a0ed6e9477b7fe1fce93e62478d5c354e2dbc2c6e1b6"},"schema_version":"1.0","source":{"id":"1302.0756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0756","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0756v2","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0756","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"WEIB45VLWO3V","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WEIB45VLWO3VAAA5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WEIB45VL","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:71c675c36307e97da03182f6cf3f41f8e778e7eaac8aad2662cd78a18ff19501","target":"graph","created_at":"2026-05-18T00:57:56Z","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 propose a novel decomposition framework for the distributed optimization of general nonconvex sum-utility functions arising naturally in the system design of wireless multiuser interfering systems. Our main contributions are: i) the development of the first class of (inexact) Jacobi best-response algorithms with provable convergence, where all the users simultaneously and iteratively solve a suitably convexified version of the original sum-utility optimization problem; ii) the derivation of a general dynamic pricing mechanism that provides a unified view of existing pricing schemes that are","authors_text":"Daniel P. Palomar, Francisco Facchinei, Gesualdo Scutari, Jong-Shi Pang, Peiran Song","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T17:02:33Z","title":"Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0756","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:90acee09fc77a9e73aeb917ac80ab8bbebf8e59a6afd035d9d0f928f36cea478","target":"record","created_at":"2026-05-18T00:57:56Z","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":"ce972c03343c2f7194903816a04bedd2750113acd2704043c2f4cc050dae657c","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T17:02:33Z","title_canon_sha256":"9231aa89bad5c99289f3a0ed6e9477b7fe1fce93e62478d5c354e2dbc2c6e1b6"},"schema_version":"1.0","source":{"id":"1302.0756","kind":"arxiv","version":2}},"canonical_sha256":"b1101e76abb3b750001d568f57abc467ef4c4038cc77ab52b0b61e0cf5bf04b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1101e76abb3b750001d568f57abc467ef4c4038cc77ab52b0b61e0cf5bf04b3","first_computed_at":"2026-05-18T00:57:56.616476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.616476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOrfm9Df9h+tBTTHzL5isC5IJi+4N2m9LjdgZjOzHo7DG6lDoao/O/y9IrBReIkKXGAQVK0KetR+XP5t4/QXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.616926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90acee09fc77a9e73aeb917ac80ab8bbebf8e59a6afd035d9d0f928f36cea478","sha256:71c675c36307e97da03182f6cf3f41f8e778e7eaac8aad2662cd78a18ff19501"],"state_sha256":"ba8d784d35d98520941445ff9ec1adf003472c625c7c62c7ec932b0422ec665f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4joCi7gE2adVmSIT0nO+UYiV7AirAMSTaW3uz2lkonFGkxotuFy4b5jit7tpBztob5xOEuBZWAoMlj4xdBXTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:47:40.997630Z","bundle_sha256":"1012628a652656a0fa8ce000bd8ab9c318c7c1d58a1529d572f8f39ed36f5956"}}