{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ELKSGZ7EIKMZQDKJNQAYTZBYS7","short_pith_number":"pith:ELKSGZ7E","canonical_record":{"source":{"id":"1303.6680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T22:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"f2e666109a9b2257138d0537066f9676b29b2ba0f6b5e2dcaf4d605fd0aca944","abstract_canon_sha256":"63149456b7dbcf9ad76635ab025b318f6e9d893db9df65fa03bdb2fd722110f6"},"schema_version":"1.0"},"canonical_sha256":"22d52367e44299980d496c0189e43897ec3913594ce891708bae42bee750af3a","source":{"kind":"arxiv","id":"1303.6680","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6680","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6680v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6680","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"ELKSGZ7EIKMZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ELKSGZ7EIKMZQDKJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ELKSGZ7E","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ELKSGZ7EIKMZQDKJNQAYTZBYS7","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T22:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"f2e666109a9b2257138d0537066f9676b29b2ba0f6b5e2dcaf4d605fd0aca944","abstract_canon_sha256":"63149456b7dbcf9ad76635ab025b318f6e9d893db9df65fa03bdb2fd722110f6"},"schema_version":"1.0"},"canonical_sha256":"22d52367e44299980d496c0189e43897ec3913594ce891708bae42bee750af3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.230496Z","signature_b64":"UBqSZcClbCz57wp4POaWjmtDF/7SEwX71U2gRlKOlPu2tPo0KazeaNbcL5YddWZiVxL9VHKHhrsH35Z2cz4dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d52367e44299980d496c0189e43897ec3913594ce891708bae42bee750af3a","last_reissued_at":"2026-05-18T00:59:04.229796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.229796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6680","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: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":"l1vS6CKyFqNFX0FOAnkDGrz9218p1kEjDGESGCrVhsFZAfCd6yD3lcgPiz2v0hawKI5VI7fZAY37h/S1NyPZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:11:51.898025Z"},"content_sha256":"1be88be29bcbca1988f7c691cf15e59a1af6c77ba10df10576539c8d8805c889","schema_version":"1.0","event_id":"sha256:1be88be29bcbca1988f7c691cf15e59a1af6c77ba10df10576539c8d8805c889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ELKSGZ7EIKMZQDKJNQAYTZBYS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal scaling of the ADMM algorithm for distributed quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e Teixeira, Euhanna Ghadimi, Henrik Sandberg, Iman Shames, Mikael Johansson","submitted_at":"2013-03-26T22:04:03Z","abstract_excerpt":"This paper presents optimal scaling of the alternating directions method of multipliers (ADMM) algorithm for a class of distributed quadratic programming problems. The scaling corresponds to the ADMM step-size and relaxation parameter, as well as the edge-weights of the underlying communication graph. We optimize these parameters to yield the smallest convergence factor of the algorithm. Explicit expressions are derived for the step-size and relaxation parameter, as well as for the corresponding convergence factor. Numerical simulations justify our results and highlight the benefits of optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6680","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: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":"pjgZD4hxRrq5V5abjxb53bgrZCeDQzxNYo/MWOGMaGcYulIHEhL1so4XQH8eeOooaPLpAKyOfmz4o0Ju86ZAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:11:51.898575Z"},"content_sha256":"17cabc2eca8dcd295e3246adcd251ea76419b23de46e15304c9159a6180dd4ae","schema_version":"1.0","event_id":"sha256:17cabc2eca8dcd295e3246adcd251ea76419b23de46e15304c9159a6180dd4ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/bundle.json","state_url":"https://pith.science/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/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-02T17:11:51Z","links":{"resolver":"https://pith.science/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7","bundle":"https://pith.science/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/bundle.json","state":"https://pith.science/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELKSGZ7EIKMZQDKJNQAYTZBYS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ELKSGZ7EIKMZQDKJNQAYTZBYS7","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":"63149456b7dbcf9ad76635ab025b318f6e9d893db9df65fa03bdb2fd722110f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T22:04:03Z","title_canon_sha256":"f2e666109a9b2257138d0537066f9676b29b2ba0f6b5e2dcaf4d605fd0aca944"},"schema_version":"1.0","source":{"id":"1303.6680","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6680","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6680v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6680","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"ELKSGZ7EIKMZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ELKSGZ7EIKMZQDKJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ELKSGZ7E","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:17cabc2eca8dcd295e3246adcd251ea76419b23de46e15304c9159a6180dd4ae","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":"This paper presents optimal scaling of the alternating directions method of multipliers (ADMM) algorithm for a class of distributed quadratic programming problems. The scaling corresponds to the ADMM step-size and relaxation parameter, as well as the edge-weights of the underlying communication graph. We optimize these parameters to yield the smallest convergence factor of the algorithm. Explicit expressions are derived for the step-size and relaxation parameter, as well as for the corresponding convergence factor. Numerical simulations justify our results and highlight the benefits of optimal","authors_text":"Andr\\'e Teixeira, Euhanna Ghadimi, Henrik Sandberg, Iman Shames, Mikael Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T22:04:03Z","title":"Optimal scaling of the ADMM algorithm for distributed quadratic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6680","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:1be88be29bcbca1988f7c691cf15e59a1af6c77ba10df10576539c8d8805c889","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":"63149456b7dbcf9ad76635ab025b318f6e9d893db9df65fa03bdb2fd722110f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T22:04:03Z","title_canon_sha256":"f2e666109a9b2257138d0537066f9676b29b2ba0f6b5e2dcaf4d605fd0aca944"},"schema_version":"1.0","source":{"id":"1303.6680","kind":"arxiv","version":2}},"canonical_sha256":"22d52367e44299980d496c0189e43897ec3913594ce891708bae42bee750af3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22d52367e44299980d496c0189e43897ec3913594ce891708bae42bee750af3a","first_computed_at":"2026-05-18T00:59:04.229796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.229796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UBqSZcClbCz57wp4POaWjmtDF/7SEwX71U2gRlKOlPu2tPo0KazeaNbcL5YddWZiVxL9VHKHhrsH35Z2cz4dBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.230496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6680","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1be88be29bcbca1988f7c691cf15e59a1af6c77ba10df10576539c8d8805c889","sha256:17cabc2eca8dcd295e3246adcd251ea76419b23de46e15304c9159a6180dd4ae"],"state_sha256":"0f91654bd0616fc868474211f5b3a44987ba46743d90ab9e63b8c839e7357d11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CbXr5uw6xqfV3RiA0Y0kQa1OTMM/oeRiQoLtMHwa64rm+3lWOdP88CZWswV2KNOYRrSrKHd94sYxH8iekRECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:11:51.901143Z","bundle_sha256":"4b52445832633aeb9a35eb7e7c16a018c2f43507ddfed411bc9d49392f22bdf8"}}