{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P5UAHCVUJMO5OSCSMHRLJ55GV5","short_pith_number":"pith:P5UAHCVU","canonical_record":{"source":{"id":"1506.08928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-30T03:37:07Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"19a2b27d651e3be331e77cce03ec675c283570306b03ae365e97a8ce659381f0","abstract_canon_sha256":"359fa0ffd35b0599c69f37217840d45809141854a5773ee5eaaf19f2aee0a65f"},"schema_version":"1.0"},"canonical_sha256":"7f68038ab44b1dd7485261e2b4f7a6af72319fa953d3f0cafb9b0bca32e9f3ec","source":{"kind":"arxiv","id":"1506.08928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08928","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08928v1","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08928","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"P5UAHCVUJMO5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5UAHCVUJMO5OSCS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5UAHCVU","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P5UAHCVUJMO5OSCSMHRLJ55GV5","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-30T03:37:07Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"19a2b27d651e3be331e77cce03ec675c283570306b03ae365e97a8ce659381f0","abstract_canon_sha256":"359fa0ffd35b0599c69f37217840d45809141854a5773ee5eaaf19f2aee0a65f"},"schema_version":"1.0"},"canonical_sha256":"7f68038ab44b1dd7485261e2b4f7a6af72319fa953d3f0cafb9b0bca32e9f3ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:52.782384Z","signature_b64":"YDn0UTenFF37nq3h42mCtH8N6hqZ8xlqwFXo6L+3jEmKEeoYUJbM6RSnWFhwUV1UDmiwteGrNQiFVf2ilB94Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f68038ab44b1dd7485261e2b4f7a6af72319fa953d3f0cafb9b0bca32e9f3ec","last_reissued_at":"2026-05-18T01:17:52.781711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:52.781711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08928","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-18T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l20BJu6SMOUTrhSwWzzlZtWoYCvgMugiyFfaGFY2x2Kqphg4Pvv83QST1taDiNy7loXy6ESo6xWQpNtcv/rPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:56:13.496184Z"},"content_sha256":"686d5ac4dcca144bd95cd069f2ac3b094e731a312c91fdceb789b1f27f39ad5b","schema_version":"1.0","event_id":"sha256:686d5ac4dcca144bd95cd069f2ac3b094e731a312c91fdceb789b1f27f39ad5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P5UAHCVUJMO5OSCSMHRLJ55GV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast ADMM Algorithm for Distributed Optimization with Adaptive Penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Changkyu Song, Sejong Yoon, Vladimir Pavlovic","submitted_at":"2015-06-30T03:37:07Z","abstract_excerpt":"We propose new methods to speed up convergence of the Alternating Direction Method of Multipliers (ADMM), a common optimization tool in the context of large scale and distributed learning. The proposed method accelerates the speed of convergence by automatically deciding the constraint penalty needed for parameter consensus in each iteration. In addition, we also propose an extension of the method that adaptively determines the maximum number of iterations to update the penalty. We show that this approach effectively leads to an adaptive, dynamic network topology underlying the distributed opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08928","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-18T01:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beC2y9Nljm58IgKnxavMdKDw4E0mphsykyo82SpwfOq0BKTkPwrHMtxv6KXcnQwSTBdg01zUsQ9h0j5bMApvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:56:13.496559Z"},"content_sha256":"f0c537ed34189092c387ba65093cf7dcc5af9dc5d530c6f9a2196c73e569e112","schema_version":"1.0","event_id":"sha256:f0c537ed34189092c387ba65093cf7dcc5af9dc5d530c6f9a2196c73e569e112"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/bundle.json","state_url":"https://pith.science/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/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-02T22:56:13Z","links":{"resolver":"https://pith.science/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5","bundle":"https://pith.science/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/bundle.json","state":"https://pith.science/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5UAHCVUJMO5OSCSMHRLJ55GV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P5UAHCVUJMO5OSCSMHRLJ55GV5","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":"359fa0ffd35b0599c69f37217840d45809141854a5773ee5eaaf19f2aee0a65f","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-30T03:37:07Z","title_canon_sha256":"19a2b27d651e3be331e77cce03ec675c283570306b03ae365e97a8ce659381f0"},"schema_version":"1.0","source":{"id":"1506.08928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08928","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08928v1","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08928","created_at":"2026-05-18T01:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"P5UAHCVUJMO5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5UAHCVUJMO5OSCS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5UAHCVU","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:f0c537ed34189092c387ba65093cf7dcc5af9dc5d530c6f9a2196c73e569e112","target":"graph","created_at":"2026-05-18T01:17:52Z","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 new methods to speed up convergence of the Alternating Direction Method of Multipliers (ADMM), a common optimization tool in the context of large scale and distributed learning. The proposed method accelerates the speed of convergence by automatically deciding the constraint penalty needed for parameter consensus in each iteration. In addition, we also propose an extension of the method that adaptively determines the maximum number of iterations to update the penalty. We show that this approach effectively leads to an adaptive, dynamic network topology underlying the distributed opt","authors_text":"Changkyu Song, Sejong Yoon, Vladimir Pavlovic","cross_cats":["cs.CV","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-30T03:37:07Z","title":"Fast ADMM Algorithm for Distributed Optimization with Adaptive Penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08928","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:686d5ac4dcca144bd95cd069f2ac3b094e731a312c91fdceb789b1f27f39ad5b","target":"record","created_at":"2026-05-18T01:17:52Z","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":"359fa0ffd35b0599c69f37217840d45809141854a5773ee5eaaf19f2aee0a65f","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-30T03:37:07Z","title_canon_sha256":"19a2b27d651e3be331e77cce03ec675c283570306b03ae365e97a8ce659381f0"},"schema_version":"1.0","source":{"id":"1506.08928","kind":"arxiv","version":1}},"canonical_sha256":"7f68038ab44b1dd7485261e2b4f7a6af72319fa953d3f0cafb9b0bca32e9f3ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f68038ab44b1dd7485261e2b4f7a6af72319fa953d3f0cafb9b0bca32e9f3ec","first_computed_at":"2026-05-18T01:17:52.781711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:52.781711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YDn0UTenFF37nq3h42mCtH8N6hqZ8xlqwFXo6L+3jEmKEeoYUJbM6RSnWFhwUV1UDmiwteGrNQiFVf2ilB94Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:52.782384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:686d5ac4dcca144bd95cd069f2ac3b094e731a312c91fdceb789b1f27f39ad5b","sha256:f0c537ed34189092c387ba65093cf7dcc5af9dc5d530c6f9a2196c73e569e112"],"state_sha256":"5fd2e38d2451db1f5a7290631cadd15efe686d6d57828bfb4547a66afb74f329"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Nva1I2OibJ3dNQTe8EA7LB0Q0FwAY7kKyJbvCdpE6i7I88UF+nNqVHfO7XPMklrIBTZYrls2pQTvI6zlXdmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:56:13.498526Z","bundle_sha256":"c0d5586cfc89d8535e235a6689f98e093bcf5e1b50f7cd78a6f192550fb1f010"}}