{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LGQKZW4BSBMFAIGU4Z4Z3HNTLT","short_pith_number":"pith:LGQKZW4B","canonical_record":{"source":{"id":"1806.00260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T09:59:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"ee357131d140b9c8c594d57da7f7c763babed59c883ec9a91e4725c9509e9504","abstract_canon_sha256":"38f9b9d6bc618f2d7b9721cc1a3440cf43ee8d41296f0ce7ae66518fc683a88f"},"schema_version":"1.0"},"canonical_sha256":"59a0acdb8190585020d4e6799d9db35ce6d9f9c31052c812dc68456161d82f59","source":{"kind":"arxiv","id":"1806.00260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00260","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00260v1","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00260","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"LGQKZW4BSBMF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGQKZW4BSBMFAIGU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGQKZW4B","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LGQKZW4BSBMFAIGU4Z4Z3HNTLT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T09:59:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"ee357131d140b9c8c594d57da7f7c763babed59c883ec9a91e4725c9509e9504","abstract_canon_sha256":"38f9b9d6bc618f2d7b9721cc1a3440cf43ee8d41296f0ce7ae66518fc683a88f"},"schema_version":"1.0"},"canonical_sha256":"59a0acdb8190585020d4e6799d9db35ce6d9f9c31052c812dc68456161d82f59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:24.224532Z","signature_b64":"9hu2ipr09eodH853jLKR3zUYhQUrsbeHNyH3LMdGmMaMZJxij9URR4BJhW3PSBJkKTCBkrfRpH56G8kECGsKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a0acdb8190585020d4e6799d9db35ce6d9f9c31052c812dc68456161d82f59","last_reissued_at":"2026-05-18T00:14:24.223771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:24.223771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00260","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-18T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zd8yQOJVywmbf6jATWHfEfbtfx7X88cSKUGxH6TMrBnpg5Y7ER7ZfH2Ga3xOfdir9az67TQeWqQdwCmcEGoZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:00:10.154951Z"},"content_sha256":"b52cbb7c66cc8c13d9471d0eb94380b0ebd53c21ab6014788b817fd515b3c08d","schema_version":"1.0","event_id":"sha256:b52cbb7c66cc8c13d9471d0eb94380b0ebd53c21ab6014788b817fd515b3c08d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LGQKZW4BSBMFAIGU4Z4Z3HNTLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Proximal Alternating Minimization Algorithm for two-block separable convex optimization problems with linear constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Ern\\\"o Robert Csetnek, Gert Wanka, Radu Ioan Bot, Sandy Bitterlich","submitted_at":"2018-06-01T09:59:09Z","abstract_excerpt":"The Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. The fact that one of the subproblems to be solved within the iteration process of AMA does not usually correspond to the calculation of a proximal operator through a closed formula, affects the implementability of the algorithm. In this paper we allow in each block of the objective a further smooth convex function and propose a proximal ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00260","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-18T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hJ0QPArtS1/hz/OIdclkx7BpOtEhNk18YHXa0ffXBZD9E/8PjaFsYeHrwgUvhWr01YiB9A7qzPUn+AZe828Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:00:10.155291Z"},"content_sha256":"0461b2e53f7fb49b17148ce0aab4ca03404769c86f7f6a35e72379259955a242","schema_version":"1.0","event_id":"sha256:0461b2e53f7fb49b17148ce0aab4ca03404769c86f7f6a35e72379259955a242"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/bundle.json","state_url":"https://pith.science/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/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-20T10:00:10Z","links":{"resolver":"https://pith.science/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT","bundle":"https://pith.science/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/bundle.json","state":"https://pith.science/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGQKZW4BSBMFAIGU4Z4Z3HNTLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LGQKZW4BSBMFAIGU4Z4Z3HNTLT","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":"38f9b9d6bc618f2d7b9721cc1a3440cf43ee8d41296f0ce7ae66518fc683a88f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T09:59:09Z","title_canon_sha256":"ee357131d140b9c8c594d57da7f7c763babed59c883ec9a91e4725c9509e9504"},"schema_version":"1.0","source":{"id":"1806.00260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00260","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00260v1","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00260","created_at":"2026-05-18T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"LGQKZW4BSBMF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGQKZW4BSBMFAIGU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGQKZW4B","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:0461b2e53f7fb49b17148ce0aab4ca03404769c86f7f6a35e72379259955a242","target":"graph","created_at":"2026-05-18T00:14:24Z","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 Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. The fact that one of the subproblems to be solved within the iteration process of AMA does not usually correspond to the calculation of a proximal operator through a closed formula, affects the implementability of the algorithm. In this paper we allow in each block of the objective a further smooth convex function and propose a proximal ver","authors_text":"Ern\\\"o Robert Csetnek, Gert Wanka, Radu Ioan Bot, Sandy Bitterlich","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T09:59:09Z","title":"The Proximal Alternating Minimization Algorithm for two-block separable convex optimization problems with linear constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00260","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:b52cbb7c66cc8c13d9471d0eb94380b0ebd53c21ab6014788b817fd515b3c08d","target":"record","created_at":"2026-05-18T00:14:24Z","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":"38f9b9d6bc618f2d7b9721cc1a3440cf43ee8d41296f0ce7ae66518fc683a88f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T09:59:09Z","title_canon_sha256":"ee357131d140b9c8c594d57da7f7c763babed59c883ec9a91e4725c9509e9504"},"schema_version":"1.0","source":{"id":"1806.00260","kind":"arxiv","version":1}},"canonical_sha256":"59a0acdb8190585020d4e6799d9db35ce6d9f9c31052c812dc68456161d82f59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59a0acdb8190585020d4e6799d9db35ce6d9f9c31052c812dc68456161d82f59","first_computed_at":"2026-05-18T00:14:24.223771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:24.223771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9hu2ipr09eodH853jLKR3zUYhQUrsbeHNyH3LMdGmMaMZJxij9URR4BJhW3PSBJkKTCBkrfRpH56G8kECGsKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:24.224532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b52cbb7c66cc8c13d9471d0eb94380b0ebd53c21ab6014788b817fd515b3c08d","sha256:0461b2e53f7fb49b17148ce0aab4ca03404769c86f7f6a35e72379259955a242"],"state_sha256":"43b9af7ffed3f3a742a92899332fa621c147cecaa4945923a4c62a9b8f1f46d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrKH15/+NAhbTn0oxNFq5gm77ZsKK6Ck14kXXy5BnMqbtmOqlQO/fj/zBWxn7GXrdjqL3TOFHKmliJdSwatmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:00:10.157173Z","bundle_sha256":"ee706ab4ccb9d1873a42c50316bd25e725c07bb091d73217e4530dd66d819084"}}