{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YKFUQIKRFMQTDKNDGVRRDB4NDA","short_pith_number":"pith:YKFUQIKR","canonical_record":{"source":{"id":"1409.2617","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-09T07:05:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bc38c981acfb9261c750e4586d272025bed2a07c62fb71a1d9f491cb484516be","abstract_canon_sha256":"7ac0a6c4a3e73c135c47a9528d6322c88a4050d30725a0a49918e8fa4083dece"},"schema_version":"1.0"},"canonical_sha256":"c28b4821512b2131a9a3356311878d1815e4b0d23412b4b7489256385e90eb44","source":{"kind":"arxiv","id":"1409.2617","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2617","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2617v5","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2617","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"YKFUQIKRFMQT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKFUQIKRFMQTDKND","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKFUQIKR","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YKFUQIKRFMQTDKNDGVRRDB4NDA","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2617","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-09T07:05:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bc38c981acfb9261c750e4586d272025bed2a07c62fb71a1d9f491cb484516be","abstract_canon_sha256":"7ac0a6c4a3e73c135c47a9528d6322c88a4050d30725a0a49918e8fa4083dece"},"schema_version":"1.0"},"canonical_sha256":"c28b4821512b2131a9a3356311878d1815e4b0d23412b4b7489256385e90eb44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:33.652345Z","signature_b64":"s0as/ZXJRRFCYdofYdtVXkLNKaKiAgzOMkXN1WpD5MfnHQcX8eHsyFRnYPxdrXIQ8IG9H6bNRupJ+nMS5SzxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28b4821512b2131a9a3356311878d1815e4b0d23412b4b7489256385e90eb44","last_reissued_at":"2026-05-18T01:55:33.651655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:33.651655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2617","source_version":5,"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:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKEtvFpsWGdRlKCrFgUzMJcHBm//9S7ashjfJSO8FoaQv3ZIarbLCsTekEWlH1XgUw8OoHP7J4pZZ+R5jgQ1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:40:10.958989Z"},"content_sha256":"fe9f4c3737af410dfdc6944d42ffd93a996508ec227287324fa159f2ce863419","schema_version":"1.0","event_id":"sha256:fe9f4c3737af410dfdc6944d42ffd93a996508ec227287324fa159f2ce863419"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YKFUQIKRFMQTDKNDGVRRDB4NDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-scale randomized-coordinate descent methods with non-separable linear constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Ahmed Hefny, Avinava Dubey, Carlton Downey, Sashank Reddi, Suvrit Sra","submitted_at":"2014-09-09T07:05:19Z","abstract_excerpt":"We develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable, but let them be coupled linearly. To our knowledge, ours is the first CD method that allows linear coupling constraints, without making the global iteration complexity have an exponential dependence on the number of constraints. We present algorithms and analysis for four key problem scenarios: (i) smooth; (ii) smooth + nonsmooth separable; (iii) asynchronous parallel; and (iv) stochastic. We illustrate empirical b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2617","kind":"arxiv","version":5},"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:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8KorrgXEX2QgkXCyMU7AOuNFgJGF+qFgDQVZ9UOgBn9z/b8ErHXsmifMEE3y5knei+2L8UVfUa+KqUzI4nICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:40:10.959477Z"},"content_sha256":"43098eb452b4a2444655a4607872b2b1e0170ce808627cfb1944bf5d2d5b01fe","schema_version":"1.0","event_id":"sha256:43098eb452b4a2444655a4607872b2b1e0170ce808627cfb1944bf5d2d5b01fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/bundle.json","state_url":"https://pith.science/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/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-27T08:40:10Z","links":{"resolver":"https://pith.science/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA","bundle":"https://pith.science/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/bundle.json","state":"https://pith.science/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKFUQIKRFMQTDKNDGVRRDB4NDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YKFUQIKRFMQTDKNDGVRRDB4NDA","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":"7ac0a6c4a3e73c135c47a9528d6322c88a4050d30725a0a49918e8fa4083dece","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-09T07:05:19Z","title_canon_sha256":"bc38c981acfb9261c750e4586d272025bed2a07c62fb71a1d9f491cb484516be"},"schema_version":"1.0","source":{"id":"1409.2617","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2617","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2617v5","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2617","created_at":"2026-05-18T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"YKFUQIKRFMQT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKFUQIKRFMQTDKND","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKFUQIKR","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:43098eb452b4a2444655a4607872b2b1e0170ce808627cfb1944bf5d2d5b01fe","target":"graph","created_at":"2026-05-18T01:55:33Z","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 develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable, but let them be coupled linearly. To our knowledge, ours is the first CD method that allows linear coupling constraints, without making the global iteration complexity have an exponential dependence on the number of constraints. We present algorithms and analysis for four key problem scenarios: (i) smooth; (ii) smooth + nonsmooth separable; (iii) asynchronous parallel; and (iv) stochastic. We illustrate empirical b","authors_text":"Ahmed Hefny, Avinava Dubey, Carlton Downey, Sashank Reddi, Suvrit Sra","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-09T07:05:19Z","title":"Large-scale randomized-coordinate descent methods with non-separable linear constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2617","kind":"arxiv","version":5},"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:fe9f4c3737af410dfdc6944d42ffd93a996508ec227287324fa159f2ce863419","target":"record","created_at":"2026-05-18T01:55:33Z","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":"7ac0a6c4a3e73c135c47a9528d6322c88a4050d30725a0a49918e8fa4083dece","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-09T07:05:19Z","title_canon_sha256":"bc38c981acfb9261c750e4586d272025bed2a07c62fb71a1d9f491cb484516be"},"schema_version":"1.0","source":{"id":"1409.2617","kind":"arxiv","version":5}},"canonical_sha256":"c28b4821512b2131a9a3356311878d1815e4b0d23412b4b7489256385e90eb44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c28b4821512b2131a9a3356311878d1815e4b0d23412b4b7489256385e90eb44","first_computed_at":"2026-05-18T01:55:33.651655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:33.651655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s0as/ZXJRRFCYdofYdtVXkLNKaKiAgzOMkXN1WpD5MfnHQcX8eHsyFRnYPxdrXIQ8IG9H6bNRupJ+nMS5SzxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:33.652345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2617","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe9f4c3737af410dfdc6944d42ffd93a996508ec227287324fa159f2ce863419","sha256:43098eb452b4a2444655a4607872b2b1e0170ce808627cfb1944bf5d2d5b01fe"],"state_sha256":"2b2e5dc496b48890a9da6bde0442382ba750b5760381ab8ef3dc2df415992326"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASRcGI7rUrHHhrh4Tdo7nlZcm1QkfObOTSjmQKRgPMUgKQnJTwbkQZG++CYS2zXLIGkL5gPpvsl/b2Xs/MuwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:40:10.962262Z","bundle_sha256":"33eccd5eae15e93e4d1a4eed75139724524ca60b72f847f28f9329d7477404ee"}}