{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M2RBA6AIGEJTETFXSYZUYWSE24","short_pith_number":"pith:M2RBA6AI","canonical_record":{"source":{"id":"1302.3074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"e0d439a8ba3bffa16daf86a632bcb1278ade512960ace26e484a475d5d88f488","abstract_canon_sha256":"ef11bf2c6ee45df7fd47616d45efba421b150a1b4d0ff9e768ff31f5190e0162"},"schema_version":"1.0"},"canonical_sha256":"66a21078083113324cb796334c5a44d716f7e8a935c48d0101dc543da47492c4","source":{"kind":"arxiv","id":"1302.3074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3074","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3074v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3074","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"M2RBA6AIGEJT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M2RBA6AIGEJTETFX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M2RBA6AI","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M2RBA6AIGEJTETFXSYZUYWSE24","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"e0d439a8ba3bffa16daf86a632bcb1278ade512960ace26e484a475d5d88f488","abstract_canon_sha256":"ef11bf2c6ee45df7fd47616d45efba421b150a1b4d0ff9e768ff31f5190e0162"},"schema_version":"1.0"},"canonical_sha256":"66a21078083113324cb796334c5a44d716f7e8a935c48d0101dc543da47492c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.832217Z","signature_b64":"s5YvD4bTjkC5P09DGMNH7b0hetX6OjqsQBBz24qj0xky5CZvMbrbo7i7F4CIbUUtjH6ax1Eb00pJTPUwwOgPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a21078083113324cb796334c5a44d716f7e8a935c48d0101dc543da47492c4","last_reissued_at":"2026-05-18T03:33:48.831492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.831492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3074","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-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrsPDlaw0DeOHCGc264meGPf2KoNDprq2CLZWZ40cKNcPaHO6slpbFXaota0qulaN3uvZnqgUnuGBwolC0ACCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:33.271510Z"},"content_sha256":"fd7e0ce942b31185f83ad647685fd3119d9e62ca991f83246e3d8f5c58b5e230","schema_version":"1.0","event_id":"sha256:fd7e0ce942b31185f83ad647685fd3119d9e62ca991f83246e3d8f5c58b5e230"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M2RBA6AIGEJTETFXSYZUYWSE24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2013-02-13T13:15:47Z","abstract_excerpt":"In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz continuous gradient, then we prove that our method obtains an $\\epsilon$-optimal solution in ${\\cal O}(N^2/\\epsilon)$ iterations, where $N$ is the number of blocks. For the class of problems with cheap coordinate derivatives we show that the new method is faster than methods based on full-gradient information. Analysis for the rate of convergence in probability is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3074","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-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwpIjcYb8u+w0llMZmRZbSROD2SmrdsPNspY71yPHkASxbDAwMku02ROeTbeqchOWmZK6w/PvhyUX2DlwR88Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:33.272050Z"},"content_sha256":"88638db2352c97dd9432300a9717a59f850c831bd3fa35840c3fab199b6ae4d2","schema_version":"1.0","event_id":"sha256:88638db2352c97dd9432300a9717a59f850c831bd3fa35840c3fab199b6ae4d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2RBA6AIGEJTETFXSYZUYWSE24/bundle.json","state_url":"https://pith.science/pith/M2RBA6AIGEJTETFXSYZUYWSE24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2RBA6AIGEJTETFXSYZUYWSE24/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-26T21:22:33Z","links":{"resolver":"https://pith.science/pith/M2RBA6AIGEJTETFXSYZUYWSE24","bundle":"https://pith.science/pith/M2RBA6AIGEJTETFXSYZUYWSE24/bundle.json","state":"https://pith.science/pith/M2RBA6AIGEJTETFXSYZUYWSE24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2RBA6AIGEJTETFXSYZUYWSE24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M2RBA6AIGEJTETFXSYZUYWSE24","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":"ef11bf2c6ee45df7fd47616d45efba421b150a1b4d0ff9e768ff31f5190e0162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:15:47Z","title_canon_sha256":"e0d439a8ba3bffa16daf86a632bcb1278ade512960ace26e484a475d5d88f488"},"schema_version":"1.0","source":{"id":"1302.3074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3074","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3074v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3074","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"M2RBA6AIGEJT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M2RBA6AIGEJTETFX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M2RBA6AI","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:88638db2352c97dd9432300a9717a59f850c831bd3fa35840c3fab199b6ae4d2","target":"graph","created_at":"2026-05-18T03:33:48Z","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":"In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz continuous gradient, then we prove that our method obtains an $\\epsilon$-optimal solution in ${\\cal O}(N^2/\\epsilon)$ iterations, where $N$ is the number of blocks. For the class of problems with cheap coordinate derivatives we show that the new method is faster than methods based on full-gradient information. Analysis for the rate of convergence in probability is a","authors_text":"Andrei Patrascu, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:15:47Z","title":"A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3074","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:fd7e0ce942b31185f83ad647685fd3119d9e62ca991f83246e3d8f5c58b5e230","target":"record","created_at":"2026-05-18T03:33:48Z","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":"ef11bf2c6ee45df7fd47616d45efba421b150a1b4d0ff9e768ff31f5190e0162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:15:47Z","title_canon_sha256":"e0d439a8ba3bffa16daf86a632bcb1278ade512960ace26e484a475d5d88f488"},"schema_version":"1.0","source":{"id":"1302.3074","kind":"arxiv","version":1}},"canonical_sha256":"66a21078083113324cb796334c5a44d716f7e8a935c48d0101dc543da47492c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66a21078083113324cb796334c5a44d716f7e8a935c48d0101dc543da47492c4","first_computed_at":"2026-05-18T03:33:48.831492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:48.831492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5YvD4bTjkC5P09DGMNH7b0hetX6OjqsQBBz24qj0xky5CZvMbrbo7i7F4CIbUUtjH6ax1Eb00pJTPUwwOgPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:48.832217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd7e0ce942b31185f83ad647685fd3119d9e62ca991f83246e3d8f5c58b5e230","sha256:88638db2352c97dd9432300a9717a59f850c831bd3fa35840c3fab199b6ae4d2"],"state_sha256":"fbf3267f79cbd68be8ec365b198e80b48f4a05d4c082d426f819b05e5f88e86f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LecetKDNbigDo3ckmeiGOOflYH7KD6OmDZjQlI9A+HLRFN7NAIS5QB3WvwWKrpncFpF57gZCt9TIwG3VlzPQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:22:33.274352Z","bundle_sha256":"d3fdfb55a602938e9a5b64f9f61e9c1bebc2c80a8756b9f908c718ed1c45cf18"}}