{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W27NNELNSPXNLYKKQIPQ4MWBLS","short_pith_number":"pith:W27NNELN","canonical_record":{"source":{"id":"1604.02216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"7a29c68e76b1b3673abfc8ba35965677a5c3e35f1ccc2857deb0ee84c2cb2b02","abstract_canon_sha256":"ce628bd8d46588d791278360f4df170d96d445bba6fea1125f3a2311eee54c30"},"schema_version":"1.0"},"canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","source":{"kind":"arxiv","id":"1604.02216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02216","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02216v1","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02216","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"W27NNELNSPXN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W27NNELNSPXNLYKK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W27NNELN","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W27NNELNSPXNLYKKQIPQ4MWBLS","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"7a29c68e76b1b3673abfc8ba35965677a5c3e35f1ccc2857deb0ee84c2cb2b02","abstract_canon_sha256":"ce628bd8d46588d791278360f4df170d96d445bba6fea1125f3a2311eee54c30"},"schema_version":"1.0"},"canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:14.530910Z","signature_b64":"Z05Wt4PGv5kUMa3QMU2aHMpdk23PAw/GSzrFi6ew+ErW5fTlxExklSG2TNWQqclbBmlsRLjqa6hvXBWSGkSUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","last_reissued_at":"2026-05-18T01:10:14.530510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:14.530510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02216","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sq4A0SfDvDt2TXNhUBI3Qxs+oBReaf3poRH4EI6HAgfjIDHjp90yIc9V1FnGMbqIPh1XKzsrPWxnA+IEvOO2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:55.730023Z"},"content_sha256":"17553fad97f39bc0335572bfbd2000c631721212fce782faca0849559ad2660c","schema_version":"1.0","event_id":"sha256:17553fad97f39bc0335572bfbd2000c631721212fce782faca0849559ad2660c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W27NNELNSPXNLYKKQIPQ4MWBLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Primal-Dual Type Algorithm with the $O(1/t)$ Convergence Rate for Large Scale Constrained Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2016-04-08T03:25:32Z","abstract_excerpt":"This paper considers large scale constrained convex programs, which are usually not solvable by interior point methods or other Newton-type methods due to the prohibitive computation and storage complexity for Hessians and matrix inversions. Instead, large scale constrained convex programs are often solved by gradient based methods or decomposition based methods. The conventional primal-dual subgradient method, aka, Arrow-Hurwicz-Uzawa subgradient method, is a low complexity algorithm with the $O(1/\\sqrt{t})$ convergence rate, where $t$ is the number of iterations. If the objective and constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02216","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrL3QB58YGSHP3iswb6tjgxX+hWUTs5ppBmux0ClhyUkW4BxtQeoUheA4G8a+doYIEtf61fDK23O/3ThajpHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:55.730681Z"},"content_sha256":"4001a044280bb80c423476a5ca33e64c9304676f54bbc96fbaf553dd6283b0f6","schema_version":"1.0","event_id":"sha256:4001a044280bb80c423476a5ca33e64c9304676f54bbc96fbaf553dd6283b0f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/bundle.json","state_url":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/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-05-30T15:00:55Z","links":{"resolver":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS","bundle":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/bundle.json","state":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W27NNELNSPXNLYKKQIPQ4MWBLS","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":"ce628bd8d46588d791278360f4df170d96d445bba6fea1125f3a2311eee54c30","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","title_canon_sha256":"7a29c68e76b1b3673abfc8ba35965677a5c3e35f1ccc2857deb0ee84c2cb2b02"},"schema_version":"1.0","source":{"id":"1604.02216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02216","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02216v1","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02216","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"W27NNELNSPXN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W27NNELNSPXNLYKK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W27NNELN","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:4001a044280bb80c423476a5ca33e64c9304676f54bbc96fbaf553dd6283b0f6","target":"graph","created_at":"2026-05-18T01:10:14Z","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 considers large scale constrained convex programs, which are usually not solvable by interior point methods or other Newton-type methods due to the prohibitive computation and storage complexity for Hessians and matrix inversions. Instead, large scale constrained convex programs are often solved by gradient based methods or decomposition based methods. The conventional primal-dual subgradient method, aka, Arrow-Hurwicz-Uzawa subgradient method, is a low complexity algorithm with the $O(1/\\sqrt{t})$ convergence rate, where $t$ is the number of iterations. If the objective and constra","authors_text":"Hao Yu, Michael J. Neely","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","title":"A Primal-Dual Type Algorithm with the $O(1/t)$ Convergence Rate for Large Scale Constrained Convex Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02216","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:17553fad97f39bc0335572bfbd2000c631721212fce782faca0849559ad2660c","target":"record","created_at":"2026-05-18T01:10:14Z","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":"ce628bd8d46588d791278360f4df170d96d445bba6fea1125f3a2311eee54c30","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","title_canon_sha256":"7a29c68e76b1b3673abfc8ba35965677a5c3e35f1ccc2857deb0ee84c2cb2b02"},"schema_version":"1.0","source":{"id":"1604.02216","kind":"arxiv","version":1}},"canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","first_computed_at":"2026-05-18T01:10:14.530510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:14.530510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z05Wt4PGv5kUMa3QMU2aHMpdk23PAw/GSzrFi6ew+ErW5fTlxExklSG2TNWQqclbBmlsRLjqa6hvXBWSGkSUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:14.530910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17553fad97f39bc0335572bfbd2000c631721212fce782faca0849559ad2660c","sha256:4001a044280bb80c423476a5ca33e64c9304676f54bbc96fbaf553dd6283b0f6"],"state_sha256":"9e875b16096415b4a1d4482c60f2b34c605f54c58fa8938265adb291976d9a8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxbXLnMRsT6X9e/FxDBjynEZW09b+SV80dfO4PLi4JYbeflOqBB8bwtwr7S/IoaR6fh0RTyWFSmZBmSY1LxBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:00:55.734912Z","bundle_sha256":"68a29da654f268c372b0a42156f83a2111a90a2838a69443df6652c9ca648697"}}