{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U5IVYXID7I5W45RBX3HCE22CFG","short_pith_number":"pith:U5IVYXID","canonical_record":{"source":{"id":"1903.08618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"5214f72e5b6eaf33bbe44c6a551d71250e756b0c525125409bd1bb9472241574","abstract_canon_sha256":"1ca0461f8ea2cf366f50a3209825390d2dcc9ba6550c3d14de7239c140765ecc"},"schema_version":"1.0"},"canonical_sha256":"a7515c5d03fa3b6e7621bece226b4229be09d189ab61b3edc78ec5a6ce283b35","source":{"kind":"arxiv","id":"1903.08618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08618","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08618v1","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08618","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"U5IVYXID7I5W","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U5IVYXID7I5W45RB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U5IVYXID","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U5IVYXID7I5W45RBX3HCE22CFG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"5214f72e5b6eaf33bbe44c6a551d71250e756b0c525125409bd1bb9472241574","abstract_canon_sha256":"1ca0461f8ea2cf366f50a3209825390d2dcc9ba6550c3d14de7239c140765ecc"},"schema_version":"1.0"},"canonical_sha256":"a7515c5d03fa3b6e7621bece226b4229be09d189ab61b3edc78ec5a6ce283b35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.610767Z","signature_b64":"dV6nbOkn6wd0bYMySvB7Fu71MVTa61qMZkwZ6XojCnyQEepQLa+u5rj3BPaKWUIy1UFj7TVaT1lTj12VwfYzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7515c5d03fa3b6e7621bece226b4229be09d189ab61b3edc78ec5a6ce283b35","last_reissued_at":"2026-05-17T23:50:47.610282Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.610282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08618","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-17T23:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNSmGhjz5JmP7xR5OsGLpKtKl/jazTUKwrv+LShT6aTtqL5ugNdya7GNFohjStsW7K0DQKtUfjhTwJQ9jBv3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T00:05:29.180043Z"},"content_sha256":"4b71c05e3bbe32aa2428e855aa209f5f92081348229396ffb05a3bbb73eda0f3","schema_version":"1.0","event_id":"sha256:4b71c05e3bbe32aa2428e855aa209f5f92081348229396ffb05a3bbb73eda0f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U5IVYXID7I5W45RBX3HCE22CFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Totally Asynchronous Distributed Quadratic Programming with Independent Stepsizes and Regularizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matthew Hale, Matthew Ubl","submitted_at":"2019-03-20T17:03:15Z","abstract_excerpt":"Quadratic programs arise in robotics, communications, smart grids, and many other applications. As these problems grow in size, finding solutions becomes much more computationally demanding, and new algorithms are needed to efficiently solve them. Targeting large-scale problems, we develop a multi-agent quadratic programming framework in which each agent updates only a small number of the total decision variables in a problem. Agents communicate their updated values to each other, though we do not impose any restrictions on the timing with which they do so, nor on the delays in these transmiss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08618","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-17T23:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CqLx86OeCB68ntLsRzyagtEg44oHsJCR7Cf4FiT+s3GOkOWOBkdv9qv7pZl/7/PYcwRNTGBauMKVqCndOcd2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T00:05:29.180404Z"},"content_sha256":"2a0ac84981b75d51ad3626f1ff4cd3e8227b94c1dc30451bf32f3a2f0b2182f4","schema_version":"1.0","event_id":"sha256:2a0ac84981b75d51ad3626f1ff4cd3e8227b94c1dc30451bf32f3a2f0b2182f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5IVYXID7I5W45RBX3HCE22CFG/bundle.json","state_url":"https://pith.science/pith/U5IVYXID7I5W45RBX3HCE22CFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5IVYXID7I5W45RBX3HCE22CFG/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-07-16T00:05:29Z","links":{"resolver":"https://pith.science/pith/U5IVYXID7I5W45RBX3HCE22CFG","bundle":"https://pith.science/pith/U5IVYXID7I5W45RBX3HCE22CFG/bundle.json","state":"https://pith.science/pith/U5IVYXID7I5W45RBX3HCE22CFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5IVYXID7I5W45RBX3HCE22CFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U5IVYXID7I5W45RBX3HCE22CFG","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":"1ca0461f8ea2cf366f50a3209825390d2dcc9ba6550c3d14de7239c140765ecc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:03:15Z","title_canon_sha256":"5214f72e5b6eaf33bbe44c6a551d71250e756b0c525125409bd1bb9472241574"},"schema_version":"1.0","source":{"id":"1903.08618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08618","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08618v1","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08618","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"U5IVYXID7I5W","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U5IVYXID7I5W45RB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U5IVYXID","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:2a0ac84981b75d51ad3626f1ff4cd3e8227b94c1dc30451bf32f3a2f0b2182f4","target":"graph","created_at":"2026-05-17T23:50:47Z","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":"Quadratic programs arise in robotics, communications, smart grids, and many other applications. As these problems grow in size, finding solutions becomes much more computationally demanding, and new algorithms are needed to efficiently solve them. Targeting large-scale problems, we develop a multi-agent quadratic programming framework in which each agent updates only a small number of the total decision variables in a problem. Agents communicate their updated values to each other, though we do not impose any restrictions on the timing with which they do so, nor on the delays in these transmiss","authors_text":"Matthew Hale, Matthew Ubl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:03:15Z","title":"Totally Asynchronous Distributed Quadratic Programming with Independent Stepsizes and Regularizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08618","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:4b71c05e3bbe32aa2428e855aa209f5f92081348229396ffb05a3bbb73eda0f3","target":"record","created_at":"2026-05-17T23:50:47Z","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":"1ca0461f8ea2cf366f50a3209825390d2dcc9ba6550c3d14de7239c140765ecc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T17:03:15Z","title_canon_sha256":"5214f72e5b6eaf33bbe44c6a551d71250e756b0c525125409bd1bb9472241574"},"schema_version":"1.0","source":{"id":"1903.08618","kind":"arxiv","version":1}},"canonical_sha256":"a7515c5d03fa3b6e7621bece226b4229be09d189ab61b3edc78ec5a6ce283b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7515c5d03fa3b6e7621bece226b4229be09d189ab61b3edc78ec5a6ce283b35","first_computed_at":"2026-05-17T23:50:47.610282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:47.610282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dV6nbOkn6wd0bYMySvB7Fu71MVTa61qMZkwZ6XojCnyQEepQLa+u5rj3BPaKWUIy1UFj7TVaT1lTj12VwfYzAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:47.610767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b71c05e3bbe32aa2428e855aa209f5f92081348229396ffb05a3bbb73eda0f3","sha256:2a0ac84981b75d51ad3626f1ff4cd3e8227b94c1dc30451bf32f3a2f0b2182f4"],"state_sha256":"561c86a80f0db8dfe785bebe989d52fe4049b2a7721825f8c53a8496cda3858a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lge6rZ29qofYLgFBjfOIod1BacRXAjcAakx/fJBgf4K3yKr72/UZBuZTv5rWV+pIQSRFNYlprvzdYfDL44r+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T00:05:29.182482Z","bundle_sha256":"962f2ed18f017e5f2de855133186ff2a650c1d1a02b9ef07ad317342f9820597"}}