{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4N3D2B3KJVFCDGYO7AJIBPRZCX","short_pith_number":"pith:4N3D2B3K","schema_version":"1.0","canonical_sha256":"e3763d076a4d4a219b0ef81280be3915c17715b0cdff32e4e299c25db3a88791","source":{"kind":"arxiv","id":"1808.02530","version":1},"attestation_state":"computed","paper":{"title":"Randomized sketch descent methods for non-separable linearly constrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Martin Takac","submitted_at":"2018-08-07T19:26:54Z","abstract_excerpt":"In this paper we consider large-scale smooth optimization problems with multiple linear coupled constraints. Due to the non-separability of the constraints, arbitrary random sketching would not be guaranteed to work. Thus, we first investigate necessary and sufficient conditions for the sketch sampling to have well-defined algorithms. Based on these sampling conditions we developed new sketch descent methods for solving general smooth linearly constrained problems, in particular, random sketch descent and accelerated random sketch descent methods. From our knowledge, this is the first converge"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.02530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T19:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"136e695515210b2adf498b008d05dda915b33f2c1dc5076ef0c669189ed68860","abstract_canon_sha256":"0f9786dc182347883cd2a93d71d7b10bf485a99c0e12c26753c86f171884fbb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:35.121305Z","signature_b64":"3EC/RDitj+K6RH3eFnpalKVo1J4io3DLXZJD3S5Hu3gYLkzk/utREWhtJiaoBQ0uEVSueMRaS1x/fk42jE25Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3763d076a4d4a219b0ef81280be3915c17715b0cdff32e4e299c25db3a88791","last_reissued_at":"2026-05-18T00:08:35.120685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:35.120685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized sketch descent methods for non-separable linearly constrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Martin Takac","submitted_at":"2018-08-07T19:26:54Z","abstract_excerpt":"In this paper we consider large-scale smooth optimization problems with multiple linear coupled constraints. Due to the non-separability of the constraints, arbitrary random sketching would not be guaranteed to work. Thus, we first investigate necessary and sufficient conditions for the sketch sampling to have well-defined algorithms. Based on these sampling conditions we developed new sketch descent methods for solving general smooth linearly constrained problems, in particular, random sketch descent and accelerated random sketch descent methods. From our knowledge, this is the first converge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02530","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.02530","created_at":"2026-05-18T00:08:35.120787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02530v1","created_at":"2026-05-18T00:08:35.120787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02530","created_at":"2026-05-18T00:08:35.120787+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N3D2B3KJVFC","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N3D2B3KJVFCDGYO","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N3D2B3K","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX","json":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX.json","graph_json":"https://pith.science/api/pith-number/4N3D2B3KJVFCDGYO7AJIBPRZCX/graph.json","events_json":"https://pith.science/api/pith-number/4N3D2B3KJVFCDGYO7AJIBPRZCX/events.json","paper":"https://pith.science/paper/4N3D2B3K"},"agent_actions":{"view_html":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX","download_json":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX.json","view_paper":"https://pith.science/paper/4N3D2B3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02530&json=true","fetch_graph":"https://pith.science/api/pith-number/4N3D2B3KJVFCDGYO7AJIBPRZCX/graph.json","fetch_events":"https://pith.science/api/pith-number/4N3D2B3KJVFCDGYO7AJIBPRZCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX/action/storage_attestation","attest_author":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX/action/author_attestation","sign_citation":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX/action/citation_signature","submit_replication":"https://pith.science/pith/4N3D2B3KJVFCDGYO7AJIBPRZCX/action/replication_record"}},"created_at":"2026-05-18T00:08:35.120787+00:00","updated_at":"2026-05-18T00:08:35.120787+00:00"}