{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GQAT6XDFV5YAYATI7ZQM3Q6M7G","short_pith_number":"pith:GQAT6XDF","canonical_record":{"source":{"id":"2206.13090","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-27T07:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"bcccbe2b512004445db48d0de58c9c913b894de644b561b45aade1a6482a9d61","abstract_canon_sha256":"b6ddbecf60356a09de12df873ba76788fca67322365433dc0765c8ea0f077968"},"schema_version":"1.0"},"canonical_sha256":"34013f5c65af700c0268fe60cdc3ccf99af9edbe3c8999a289e072a62846f7ea","source":{"kind":"arxiv","id":"2206.13090","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.13090","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2206.13090v3","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13090","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"GQAT6XDFV5YA","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"GQAT6XDFV5YAYATI","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"GQAT6XDF","created_at":"2026-07-05T08:04:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GQAT6XDFV5YAYATI7ZQM3Q6M7G","target":"record","payload":{"canonical_record":{"source":{"id":"2206.13090","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-27T07:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"bcccbe2b512004445db48d0de58c9c913b894de644b561b45aade1a6482a9d61","abstract_canon_sha256":"b6ddbecf60356a09de12df873ba76788fca67322365433dc0765c8ea0f077968"},"schema_version":"1.0"},"canonical_sha256":"34013f5c65af700c0268fe60cdc3ccf99af9edbe3c8999a289e072a62846f7ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:30.343458Z","signature_b64":"5V2G1NFHoo3mBRMs25fMH4NzVSsbdKSKCuca3ut+NIrSsXmHLKYYfVNztF80ynIsto5Z09AQu26+1RLfvjwRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34013f5c65af700c0268fe60cdc3ccf99af9edbe3c8999a289e072a62846f7ea","last_reissued_at":"2026-07-05T08:04:30.342996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:30.342996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.13090","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-07-05T08:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RyA4ev3yxY8tD6/5Zoc/bpiRWejthM4Mqv74i4jTLAjPvBSUxStUMhNtp2jSJ/OPLBup7zfS/tIm+oRY7ZiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:06:45.024682Z"},"content_sha256":"d5dbc8b2fc66026ce439b6eb091d93483898b778fdb441d4f59c70ab1f34337a","schema_version":"1.0","event_id":"sha256:d5dbc8b2fc66026ce439b6eb091d93483898b778fdb441d4f59c70ab1f34337a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GQAT6XDFV5YAYATI7ZQM3Q6M7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variance Reduced Random Relaxed Projection Method for Constrained Finite-sum Minimization Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fu-quan Xia, Kai Tu, Man-Chung Yue, Zhichun Yang","submitted_at":"2022-06-27T07:50:49Z","abstract_excerpt":"For many applications in signal processing and machine learning, we are tasked with minimizing a large sum of convex functions subject to a large number of convex constraints. In this paper, we devise a new random projection method (RPM) to efficiently solve this problem. Compared with existing RPMs, our proposed algorithm features two useful algorithmic ideas. First, at each iteration, instead of projecting onto the subset defined by one of the constraints, our algorithm only requires projecting onto a half-space approximation of the subset, which significantly reduces the computational cost "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13090","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.13090/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-07-05T08:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3xUzMqoM5KMynYHViiS5EvULe/rGX5JkchHd81mpcoX1tWqCxMjTuGk3yNU2LtN01QRyAX+VtuIYD02+zVvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:06:45.025090Z"},"content_sha256":"5e9e34fe569ac6df663e7e7d94aa33c2e419faea566777b0cca105a691eea044","schema_version":"1.0","event_id":"sha256:5e9e34fe569ac6df663e7e7d94aa33c2e419faea566777b0cca105a691eea044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/bundle.json","state_url":"https://pith.science/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/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-08-04T06:06:45Z","links":{"resolver":"https://pith.science/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G","bundle":"https://pith.science/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/bundle.json","state":"https://pith.science/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQAT6XDFV5YAYATI7ZQM3Q6M7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GQAT6XDFV5YAYATI7ZQM3Q6M7G","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":"b6ddbecf60356a09de12df873ba76788fca67322365433dc0765c8ea0f077968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-27T07:50:49Z","title_canon_sha256":"bcccbe2b512004445db48d0de58c9c913b894de644b561b45aade1a6482a9d61"},"schema_version":"1.0","source":{"id":"2206.13090","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.13090","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2206.13090v3","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13090","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"GQAT6XDFV5YA","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"GQAT6XDFV5YAYATI","created_at":"2026-07-05T08:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"GQAT6XDF","created_at":"2026-07-05T08:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:5e9e34fe569ac6df663e7e7d94aa33c2e419faea566777b0cca105a691eea044","target":"graph","created_at":"2026-07-05T08:04: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/2206.13090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For many applications in signal processing and machine learning, we are tasked with minimizing a large sum of convex functions subject to a large number of convex constraints. In this paper, we devise a new random projection method (RPM) to efficiently solve this problem. Compared with existing RPMs, our proposed algorithm features two useful algorithmic ideas. First, at each iteration, instead of projecting onto the subset defined by one of the constraints, our algorithm only requires projecting onto a half-space approximation of the subset, which significantly reduces the computational cost ","authors_text":"Fu-quan Xia, Kai Tu, Man-Chung Yue, Zhichun Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-27T07:50:49Z","title":"Variance Reduced Random Relaxed Projection Method for Constrained Finite-sum Minimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13090","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:d5dbc8b2fc66026ce439b6eb091d93483898b778fdb441d4f59c70ab1f34337a","target":"record","created_at":"2026-07-05T08:04: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":"b6ddbecf60356a09de12df873ba76788fca67322365433dc0765c8ea0f077968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-27T07:50:49Z","title_canon_sha256":"bcccbe2b512004445db48d0de58c9c913b894de644b561b45aade1a6482a9d61"},"schema_version":"1.0","source":{"id":"2206.13090","kind":"arxiv","version":3}},"canonical_sha256":"34013f5c65af700c0268fe60cdc3ccf99af9edbe3c8999a289e072a62846f7ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34013f5c65af700c0268fe60cdc3ccf99af9edbe3c8999a289e072a62846f7ea","first_computed_at":"2026-07-05T08:04:30.342996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:04:30.342996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5V2G1NFHoo3mBRMs25fMH4NzVSsbdKSKCuca3ut+NIrSsXmHLKYYfVNztF80ynIsto5Z09AQu26+1RLfvjwRCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:04:30.343458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.13090","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5dbc8b2fc66026ce439b6eb091d93483898b778fdb441d4f59c70ab1f34337a","sha256:5e9e34fe569ac6df663e7e7d94aa33c2e419faea566777b0cca105a691eea044"],"state_sha256":"16de23066b061796df33f21a301e3d1cfa58c75ee161443858f86e683eaa61b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNLmrE/wBIIq1NAjBA7Uph0XLn7rfFCH2Q3TzfW5NaxlUNSZxokUzeiqSTJIVzYcQ5o1cWCu1nhpZBQAIz+tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:06:45.027485Z","bundle_sha256":"06a6d6efa8f29cd1d1c97eaf01ed7c8aa7e9b73b7cd9bba43853c5d820b73c52"}}