{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QDVT7OEP5USRJXA6WQ6M4CZHYO","short_pith_number":"pith:QDVT7OEP","canonical_record":{"source":{"id":"1806.07826","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-20T16:19:50Z","cross_cats_sorted":[],"title_canon_sha256":"f1bde4dd8949ab4d71c6c234ecb97b55b0fb7674ee3a127f44be4186d91fa9ed","abstract_canon_sha256":"8ea2de027acfd7f6eccc0a66475476ed71740a32864a6df99f5ebdb593e9acc1"},"schema_version":"1.0"},"canonical_sha256":"80eb3fb88fed2514dc1eb43cce0b27c3957aeb310861ed81cb249cdacd83a930","source":{"kind":"arxiv","id":"1806.07826","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07826","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07826v3","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07826","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"QDVT7OEP5USR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDVT7OEP5USRJXA6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDVT7OEP","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QDVT7OEP5USRJXA6WQ6M4CZHYO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07826","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-20T16:19:50Z","cross_cats_sorted":[],"title_canon_sha256":"f1bde4dd8949ab4d71c6c234ecb97b55b0fb7674ee3a127f44be4186d91fa9ed","abstract_canon_sha256":"8ea2de027acfd7f6eccc0a66475476ed71740a32864a6df99f5ebdb593e9acc1"},"schema_version":"1.0"},"canonical_sha256":"80eb3fb88fed2514dc1eb43cce0b27c3957aeb310861ed81cb249cdacd83a930","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:07.483039Z","signature_b64":"GbDxZm1LyZQQV+wOZv5cU75QzThUpAjGe+pLkX61A98tAj5PMijU89YO5InwUCLWekt0tBbXSmTsP/D9FTB/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80eb3fb88fed2514dc1eb43cce0b27c3957aeb310861ed81cb249cdacd83a930","last_reissued_at":"2026-05-17T23:52:07.482654Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:07.482654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07826","source_version":3,"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:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPurU2Hmro7I3I3a2ETJPTzezSMNxJLCffDXpl1eCR5kn03uxAv/X57tYIAye1IkA6Q9zwjER2DfOGYDkBRqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:23:21.114586Z"},"content_sha256":"e6e4d4b3c466bcc792f82fa695e30e05f1b2ac0609c83bd29dd84679946f291e","schema_version":"1.0","event_id":"sha256:e6e4d4b3c466bcc792f82fa695e30e05f1b2ac0609c83bd29dd84679946f291e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QDVT7OEP5USRJXA6WQ6M4CZHYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An almost cyclic 2-coordinate descent method for singly linearly constrained problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari","submitted_at":"2018-06-20T16:19:50Z","abstract_excerpt":"A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a pair of coordinates according to an almost cyclic strategy that does not use first-order information, allowing us not to compute the whole gradient of the objective function during the algorithm. Using first-order search directions to update each pair of coordinates, global convergence to stationary points is established for different choices of the stepsize un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07826","kind":"arxiv","version":3},"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:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaNCRE+q2O3MRa8ICmt+bO+b7VRcKHayiyDV4gRaO4isQSPV9e9ssKqeh097OBCg4H700aKlyeDSRmGK/zWgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:23:21.114920Z"},"content_sha256":"de968eee03144fc95269abe6870c84598c90d1f3064e7d631b6044b8479c9424","schema_version":"1.0","event_id":"sha256:de968eee03144fc95269abe6870c84598c90d1f3064e7d631b6044b8479c9424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/bundle.json","state_url":"https://pith.science/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/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-29T07:23:21Z","links":{"resolver":"https://pith.science/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO","bundle":"https://pith.science/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/bundle.json","state":"https://pith.science/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDVT7OEP5USRJXA6WQ6M4CZHYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QDVT7OEP5USRJXA6WQ6M4CZHYO","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":"8ea2de027acfd7f6eccc0a66475476ed71740a32864a6df99f5ebdb593e9acc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-20T16:19:50Z","title_canon_sha256":"f1bde4dd8949ab4d71c6c234ecb97b55b0fb7674ee3a127f44be4186d91fa9ed"},"schema_version":"1.0","source":{"id":"1806.07826","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07826","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07826v3","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07826","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"QDVT7OEP5USR","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDVT7OEP5USRJXA6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDVT7OEP","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:de968eee03144fc95269abe6870c84598c90d1f3064e7d631b6044b8479c9424","target":"graph","created_at":"2026-05-17T23:52:07Z","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":"A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a pair of coordinates according to an almost cyclic strategy that does not use first-order information, allowing us not to compute the whole gradient of the objective function during the algorithm. Using first-order search directions to update each pair of coordinates, global convergence to stationary points is established for different choices of the stepsize un","authors_text":"Andrea Cristofari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-20T16:19:50Z","title":"An almost cyclic 2-coordinate descent method for singly linearly constrained problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07826","kind":"arxiv","version":3},"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:e6e4d4b3c466bcc792f82fa695e30e05f1b2ac0609c83bd29dd84679946f291e","target":"record","created_at":"2026-05-17T23:52:07Z","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":"8ea2de027acfd7f6eccc0a66475476ed71740a32864a6df99f5ebdb593e9acc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-20T16:19:50Z","title_canon_sha256":"f1bde4dd8949ab4d71c6c234ecb97b55b0fb7674ee3a127f44be4186d91fa9ed"},"schema_version":"1.0","source":{"id":"1806.07826","kind":"arxiv","version":3}},"canonical_sha256":"80eb3fb88fed2514dc1eb43cce0b27c3957aeb310861ed81cb249cdacd83a930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80eb3fb88fed2514dc1eb43cce0b27c3957aeb310861ed81cb249cdacd83a930","first_computed_at":"2026-05-17T23:52:07.482654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:07.482654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GbDxZm1LyZQQV+wOZv5cU75QzThUpAjGe+pLkX61A98tAj5PMijU89YO5InwUCLWekt0tBbXSmTsP/D9FTB/Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:07.483039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07826","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6e4d4b3c466bcc792f82fa695e30e05f1b2ac0609c83bd29dd84679946f291e","sha256:de968eee03144fc95269abe6870c84598c90d1f3064e7d631b6044b8479c9424"],"state_sha256":"8e312fdb8c7de7b8b158d3c267906b57a3c2a15b480c88cb852a556725af2c58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEMiCaxLlcGH9Sih+GcKjhif9XUAuSYpVUo8mOagEwyZCtRBKuUHvy/LiVNbMKNs1uytK4JQQ1vlXIR199EADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:23:21.116829Z","bundle_sha256":"6aeb23ed1a9287c1fe5fc420d585e41b4130a6eb7a461b80ac473eeaeaa17258"}}