{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:H2HQ43JZP3PVHPYTMEW7D2GN2G","short_pith_number":"pith:H2HQ43JZ","canonical_record":{"source":{"id":"2601.20076","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-27T21:40:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d849573d09fe39f52abf2b238161de1a63271ef78311a60b05cfaedd96aad616","abstract_canon_sha256":"2e881caa896960ae129a972b6cdf8c56451ebd5d3ce0e7b07a0b0813b093a45b"},"schema_version":"1.0"},"canonical_sha256":"3e8f0e6d397edf53bf13612df1e8cdd1996a9b34e4bcf5e46733b1000529f5fc","source":{"kind":"arxiv","id":"2601.20076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.20076","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.20076v2","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20076","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"H2HQ43JZP3PV","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_16","alias_value":"H2HQ43JZP3PVHPYT","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_8","alias_value":"H2HQ43JZ","created_at":"2026-06-01T01:02:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:H2HQ43JZP3PVHPYTMEW7D2GN2G","target":"record","payload":{"canonical_record":{"source":{"id":"2601.20076","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-27T21:40:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d849573d09fe39f52abf2b238161de1a63271ef78311a60b05cfaedd96aad616","abstract_canon_sha256":"2e881caa896960ae129a972b6cdf8c56451ebd5d3ce0e7b07a0b0813b093a45b"},"schema_version":"1.0"},"canonical_sha256":"3e8f0e6d397edf53bf13612df1e8cdd1996a9b34e4bcf5e46733b1000529f5fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:30.546843Z","signature_b64":"OmngIyUkQ0VuFYkAGJGrzQLDM6jZTj8pPN6gHqTos9lPVKYIfxpZA177HrBClYR/5xHgcBizdrgpt3PwAIIZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e8f0e6d397edf53bf13612df1e8cdd1996a9b34e4bcf5e46733b1000529f5fc","last_reissued_at":"2026-06-01T01:02:30.545841Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:30.545841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.20076","source_version":2,"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-06-01T01:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0ysOIUfJj8ZjtRlEOXrWE6zT9Tfd9iv9SIKGIkMomFRdNmmOJ9+RXDRg/P8lqV194jutlxH1zExTuNeR8JxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:05:53.741484Z"},"content_sha256":"3306795a918b4cd1e888c4b1951f7740eb8516fd7d7ff1f141308a0d4bc2d7a3","schema_version":"1.0","event_id":"sha256:3306795a918b4cd1e888c4b1951f7740eb8516fd7d7ff1f141308a0d4bc2d7a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:H2HQ43JZP3PVHPYTMEW7D2GN2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Abhishek Chakraborty, Angelia Nedi\\'c","submitted_at":"2026-01-27T21:40:10Z","abstract_excerpt":"We consider minimizing an objective function subject to constraints defined by the intersection of lower-level sets of convex functions. We study two cases: (i) strongly convex and Lipschitz-smooth objective function and (ii) convex but possibly nonsmooth objective function. To deal with the constraints that are not easy to project on, we use a randomized feasibility algorithm with Polyak steps and a random number of sampled constraints per iteration, while taking (sub)gradient steps to minimize the objective function. For case (i), we prove linear convergence in expectation of the objective f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20076","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.20076/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-01T01:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6s9SrLe9TZK5SJpfyzud/BIB4KIWjhR/iiB7rIO85aTD55pvzaekv4eksZF5ICYo8A5ysh2pxzU8XrWWNPKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:05:53.741865Z"},"content_sha256":"48db0d342c65fee9556ec4237de3d56d7ed1e55988d4ec60e3c99ed3c2126c7d","schema_version":"1.0","event_id":"sha256:48db0d342c65fee9556ec4237de3d56d7ed1e55988d4ec60e3c99ed3c2126c7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/bundle.json","state_url":"https://pith.science/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/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-02T12:05:53Z","links":{"resolver":"https://pith.science/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G","bundle":"https://pith.science/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/bundle.json","state":"https://pith.science/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2HQ43JZP3PVHPYTMEW7D2GN2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:H2HQ43JZP3PVHPYTMEW7D2GN2G","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":"2e881caa896960ae129a972b6cdf8c56451ebd5d3ce0e7b07a0b0813b093a45b","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-27T21:40:10Z","title_canon_sha256":"d849573d09fe39f52abf2b238161de1a63271ef78311a60b05cfaedd96aad616"},"schema_version":"1.0","source":{"id":"2601.20076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.20076","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"2601.20076v2","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20076","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"H2HQ43JZP3PV","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_16","alias_value":"H2HQ43JZP3PVHPYT","created_at":"2026-06-01T01:02:30Z"},{"alias_kind":"pith_short_8","alias_value":"H2HQ43JZ","created_at":"2026-06-01T01:02:30Z"}],"graph_snapshots":[{"event_id":"sha256:48db0d342c65fee9556ec4237de3d56d7ed1e55988d4ec60e3c99ed3c2126c7d","target":"graph","created_at":"2026-06-01T01:02:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.20076/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider minimizing an objective function subject to constraints defined by the intersection of lower-level sets of convex functions. We study two cases: (i) strongly convex and Lipschitz-smooth objective function and (ii) convex but possibly nonsmooth objective function. To deal with the constraints that are not easy to project on, we use a randomized feasibility algorithm with Polyak steps and a random number of sampled constraints per iteration, while taking (sub)gradient steps to minimize the objective function. For case (i), we prove linear convergence in expectation of the objective f","authors_text":"Abhishek Chakraborty, Angelia Nedi\\'c","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-27T21:40:10Z","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20076","kind":"arxiv","version":2},"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:3306795a918b4cd1e888c4b1951f7740eb8516fd7d7ff1f141308a0d4bc2d7a3","target":"record","created_at":"2026-06-01T01:02:30Z","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":"2e881caa896960ae129a972b6cdf8c56451ebd5d3ce0e7b07a0b0813b093a45b","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-27T21:40:10Z","title_canon_sha256":"d849573d09fe39f52abf2b238161de1a63271ef78311a60b05cfaedd96aad616"},"schema_version":"1.0","source":{"id":"2601.20076","kind":"arxiv","version":2}},"canonical_sha256":"3e8f0e6d397edf53bf13612df1e8cdd1996a9b34e4bcf5e46733b1000529f5fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e8f0e6d397edf53bf13612df1e8cdd1996a9b34e4bcf5e46733b1000529f5fc","first_computed_at":"2026-06-01T01:02:30.545841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:30.545841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OmngIyUkQ0VuFYkAGJGrzQLDM6jZTj8pPN6gHqTos9lPVKYIfxpZA177HrBClYR/5xHgcBizdrgpt3PwAIIZCg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:30.546843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.20076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3306795a918b4cd1e888c4b1951f7740eb8516fd7d7ff1f141308a0d4bc2d7a3","sha256:48db0d342c65fee9556ec4237de3d56d7ed1e55988d4ec60e3c99ed3c2126c7d"],"state_sha256":"f94cd04deb4fa94a7b81f77e057562f692e39247bc5d07870cb6fe91f8bfa391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/cKF3JQjJR8UcHcSX/Yms2CV6VdJGIKiyuXdeEnAgEFF8Hc4qvTvjPjn5saTwvaRUx4xr3ZBIXBwKDxEY9gCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:05:53.744004Z","bundle_sha256":"2f466bbf3f90548d75518e4431d965bb14bd3c7b30b5cbb25aa607d5699777b9"}}