{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FNCZ3RK5LWARAASAIDBG7AJLBF","short_pith_number":"pith:FNCZ3RK5","canonical_record":{"source":{"id":"1404.5378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-22T04:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"307551baa6b6ea97e5f849838451ee3a1ec039a944dab9543ce1218d26fbc392","abstract_canon_sha256":"ae34f6a36967478c8e291311e0baa51af17d18832b650753efb98303f4124842"},"schema_version":"1.0"},"canonical_sha256":"2b459dc55d5d8110024040c26f812b096a294d8b12312d11d83a1294c28e262d","source":{"kind":"arxiv","id":"1404.5378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5378","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5378v2","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5378","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"FNCZ3RK5LWAR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNCZ3RK5LWARAASA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNCZ3RK5","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FNCZ3RK5LWARAASAIDBG7AJLBF","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-22T04:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"307551baa6b6ea97e5f849838451ee3a1ec039a944dab9543ce1218d26fbc392","abstract_canon_sha256":"ae34f6a36967478c8e291311e0baa51af17d18832b650753efb98303f4124842"},"schema_version":"1.0"},"canonical_sha256":"2b459dc55d5d8110024040c26f812b096a294d8b12312d11d83a1294c28e262d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:30.833807Z","signature_b64":"3Qp3kEroH79THnoyKT9SHFk6UCp/V0JzGqPhlYWFS0cLGJ2hJQ3XqjJRbksEvvxgBZUIkb4Dteu0K3ZLCWF9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b459dc55d5d8110024040c26f812b096a294d8b12312d11d83a1294c28e262d","last_reissued_at":"2026-05-18T02:32:30.833397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:30.833397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5378","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-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbskpTHIAQqtoGCWt5vxugKmMARpQ/fR5u6zJFuxwCp23N6NRotNXYKV5+eeCTVYXa1qXSc/f5GmjMqvs9oABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:39.893930Z"},"content_sha256":"147ee3a21e292bcc87fb24c0441172359735efb466f3b247f09fa677b73e7d17","schema_version":"1.0","event_id":"sha256:147ee3a21e292bcc87fb24c0441172359735efb466f3b247f09fa677b73e7d17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FNCZ3RK5LWARAASAIDBG7AJLBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liuqin Yang","submitted_at":"2014-04-22T04:44:30Z","abstract_excerpt":"The objective of this paper is to design an efficient and convergent alternating direction method of multipliers (ADMM) for finding a solution of medium accuracy to conic programming problems whose constraints consist of linear equalities, linear inequalities, a non-polyhedral cone and a polyhedral cone. For this class of problems, one may apply the directly extended ADMM to their dual, which can be written in the form of convex programming with four separable blocks in the objective function and a coupling linear equation constraint. Indeed, the directly extended ADMM, though may diverge in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5378","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-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1s82mngbipwoFaBFbNZ0II6ngtosZkyKcPeku/38h1G0mbqA+Iv++mn1tyJTt1jjwbhXWgepW939H4n0JNwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:39.894561Z"},"content_sha256":"3b6247e1fe0a0abd206d60358324ea785368305cdf238e192f5e36ba6a1a4dfa","schema_version":"1.0","event_id":"sha256:3b6247e1fe0a0abd206d60358324ea785368305cdf238e192f5e36ba6a1a4dfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/bundle.json","state_url":"https://pith.science/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/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-26T01:14:39Z","links":{"resolver":"https://pith.science/pith/FNCZ3RK5LWARAASAIDBG7AJLBF","bundle":"https://pith.science/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/bundle.json","state":"https://pith.science/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNCZ3RK5LWARAASAIDBG7AJLBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FNCZ3RK5LWARAASAIDBG7AJLBF","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":"ae34f6a36967478c8e291311e0baa51af17d18832b650753efb98303f4124842","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-22T04:44:30Z","title_canon_sha256":"307551baa6b6ea97e5f849838451ee3a1ec039a944dab9543ce1218d26fbc392"},"schema_version":"1.0","source":{"id":"1404.5378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5378","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5378v2","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5378","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"FNCZ3RK5LWAR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNCZ3RK5LWARAASA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNCZ3RK5","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:3b6247e1fe0a0abd206d60358324ea785368305cdf238e192f5e36ba6a1a4dfa","target":"graph","created_at":"2026-05-18T02:32:30Z","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":"The objective of this paper is to design an efficient and convergent alternating direction method of multipliers (ADMM) for finding a solution of medium accuracy to conic programming problems whose constraints consist of linear equalities, linear inequalities, a non-polyhedral cone and a polyhedral cone. For this class of problems, one may apply the directly extended ADMM to their dual, which can be written in the form of convex programming with four separable blocks in the objective function and a coupling linear equation constraint. Indeed, the directly extended ADMM, though may diverge in t","authors_text":"Defeng Sun, Kim-Chuan Toh, Liuqin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-22T04:44:30Z","title":"A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5378","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:147ee3a21e292bcc87fb24c0441172359735efb466f3b247f09fa677b73e7d17","target":"record","created_at":"2026-05-18T02:32:30Z","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":"ae34f6a36967478c8e291311e0baa51af17d18832b650753efb98303f4124842","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-22T04:44:30Z","title_canon_sha256":"307551baa6b6ea97e5f849838451ee3a1ec039a944dab9543ce1218d26fbc392"},"schema_version":"1.0","source":{"id":"1404.5378","kind":"arxiv","version":2}},"canonical_sha256":"2b459dc55d5d8110024040c26f812b096a294d8b12312d11d83a1294c28e262d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b459dc55d5d8110024040c26f812b096a294d8b12312d11d83a1294c28e262d","first_computed_at":"2026-05-18T02:32:30.833397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:30.833397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Qp3kEroH79THnoyKT9SHFk6UCp/V0JzGqPhlYWFS0cLGJ2hJQ3XqjJRbksEvvxgBZUIkb4Dteu0K3ZLCWF9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:30.833807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:147ee3a21e292bcc87fb24c0441172359735efb466f3b247f09fa677b73e7d17","sha256:3b6247e1fe0a0abd206d60358324ea785368305cdf238e192f5e36ba6a1a4dfa"],"state_sha256":"3bcf912a8f26fe38dd91f5c301e17f529f8df21877d8f1ba682565ce18663c31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioRkdqGgxRglCjM7CODQ/ytSrUcIf1aEAHC03ElLeUDB/F+PxLp/1179fyqnNEYOv4g8xoXnNspz5K6+OtJoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:14:39.897063Z","bundle_sha256":"f0e6640f05ffc18fc4d7e596598334d0180214bfc0b5ecbe2579dc2ffc57b50c"}}