{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7ZR6Q2ONQRZT3XTT2F6WABMVPH","short_pith_number":"pith:7ZR6Q2ON","canonical_record":{"source":{"id":"1807.08023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-20T20:47:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"79c3cd69fd3ec52408f5d9025ff58feb6f63683515ba732fb0baa2c45bea4f27","abstract_canon_sha256":"a5d17062194b43d6485c594ee36a972a628a222b6d4a71a095080f050a86ac77"},"schema_version":"1.0"},"canonical_sha256":"fe63e869cd84733dde73d17d60059579ff7abcbfd65e409246f8fa02c8c4eaa1","source":{"kind":"arxiv","id":"1807.08023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08023","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08023v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08023","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"7ZR6Q2ONQRZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7ZR6Q2ONQRZT3XTT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7ZR6Q2ON","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7ZR6Q2ONQRZT3XTT2F6WABMVPH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-20T20:47:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"79c3cd69fd3ec52408f5d9025ff58feb6f63683515ba732fb0baa2c45bea4f27","abstract_canon_sha256":"a5d17062194b43d6485c594ee36a972a628a222b6d4a71a095080f050a86ac77"},"schema_version":"1.0"},"canonical_sha256":"fe63e869cd84733dde73d17d60059579ff7abcbfd65e409246f8fa02c8c4eaa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.838126Z","signature_b64":"RCubaQock59blSSDO+glOSPZvvHhn0gAs3mubS1IPeFdsrjsSpQj+ex57I9l50UL3CVCa5hxGxbeP7wI3o3jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe63e869cd84733dde73d17d60059579ff7abcbfd65e409246f8fa02c8c4eaa1","last_reissued_at":"2026-05-18T00:02:24.837572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.837572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08023","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-05-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkOfzAPyv1U20kgk7QtsWng9/tB9I6xiM60Z3kE0JlexBeMT3PZnielqOFD4c5JcNMMxu7n5sHpjP23kvHwOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:00:26.076276Z"},"content_sha256":"ee8050d50744218066614c81a5a562ca19e47d7303266fde0cd788f8a822200e","schema_version":"1.0","event_id":"sha256:ee8050d50744218066614c81a5a562ca19e47d7303266fde0cd788f8a822200e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7ZR6Q2ONQRZT3XTT2F6WABMVPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"signProx: One-Bit Proximal Algorithm for Nonconvex Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ulugbek S. Kamilov, Xiaojian Xu","submitted_at":"2018-07-20T20:47:32Z","abstract_excerpt":"Stochastic gradient descent (SGD) is one of the most widely used optimization methods for parallel and distributed processing of large datasets. One of the key limitations of distributed SGD is the need to regularly communicate the gradients between different computation nodes. To reduce this communication bottleneck, recent work has considered a one-bit variant of SGD, where only the sign of each gradient element is used in optimization. In this paper, we extend this idea by proposing a stochastic variant of the proximal-gradient method that also uses one-bit per update element. We prove the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08023","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":""},"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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+6kraAqEsK5ZBDUYJ0sQs9CCH9gjzVZvqqpFL/4yrSHJwqhKnB13D5Jz8VLIPHmejm3Wye2bpSZrCfNmCH4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:00:26.076636Z"},"content_sha256":"a87a644c7392ee700b9dc03d9e0ac5fd593d3a9be166a5f63719cf77d221bdfc","schema_version":"1.0","event_id":"sha256:a87a644c7392ee700b9dc03d9e0ac5fd593d3a9be166a5f63719cf77d221bdfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/bundle.json","state_url":"https://pith.science/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/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-03T01:00:26Z","links":{"resolver":"https://pith.science/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH","bundle":"https://pith.science/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/bundle.json","state":"https://pith.science/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZR6Q2ONQRZT3XTT2F6WABMVPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7ZR6Q2ONQRZT3XTT2F6WABMVPH","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":"a5d17062194b43d6485c594ee36a972a628a222b6d4a71a095080f050a86ac77","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-20T20:47:32Z","title_canon_sha256":"79c3cd69fd3ec52408f5d9025ff58feb6f63683515ba732fb0baa2c45bea4f27"},"schema_version":"1.0","source":{"id":"1807.08023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08023","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08023v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08023","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"7ZR6Q2ONQRZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7ZR6Q2ONQRZT3XTT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7ZR6Q2ON","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a87a644c7392ee700b9dc03d9e0ac5fd593d3a9be166a5f63719cf77d221bdfc","target":"graph","created_at":"2026-05-18T00:02:24Z","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":"Stochastic gradient descent (SGD) is one of the most widely used optimization methods for parallel and distributed processing of large datasets. One of the key limitations of distributed SGD is the need to regularly communicate the gradients between different computation nodes. To reduce this communication bottleneck, recent work has considered a one-bit variant of SGD, where only the sign of each gradient element is used in optimization. In this paper, we extend this idea by proposing a stochastic variant of the proximal-gradient method that also uses one-bit per update element. We prove the ","authors_text":"Ulugbek S. Kamilov, Xiaojian Xu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-20T20:47:32Z","title":"signProx: One-Bit Proximal Algorithm for Nonconvex Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08023","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:ee8050d50744218066614c81a5a562ca19e47d7303266fde0cd788f8a822200e","target":"record","created_at":"2026-05-18T00:02:24Z","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":"a5d17062194b43d6485c594ee36a972a628a222b6d4a71a095080f050a86ac77","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-20T20:47:32Z","title_canon_sha256":"79c3cd69fd3ec52408f5d9025ff58feb6f63683515ba732fb0baa2c45bea4f27"},"schema_version":"1.0","source":{"id":"1807.08023","kind":"arxiv","version":2}},"canonical_sha256":"fe63e869cd84733dde73d17d60059579ff7abcbfd65e409246f8fa02c8c4eaa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe63e869cd84733dde73d17d60059579ff7abcbfd65e409246f8fa02c8c4eaa1","first_computed_at":"2026-05-18T00:02:24.837572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.837572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RCubaQock59blSSDO+glOSPZvvHhn0gAs3mubS1IPeFdsrjsSpQj+ex57I9l50UL3CVCa5hxGxbeP7wI3o3jCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.838126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee8050d50744218066614c81a5a562ca19e47d7303266fde0cd788f8a822200e","sha256:a87a644c7392ee700b9dc03d9e0ac5fd593d3a9be166a5f63719cf77d221bdfc"],"state_sha256":"e9b3841442f4bb1d165ae4df418c4123f4399ecb6197c9db304bb243195225bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFqALgiL9aPt1//f0qYTv6NiP7tuTCr9EIqjlAxip5Bcr/BifKcHU9fIRdIuG8PTAAh0QKnP1vQKU7c0zghPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:00:26.078586Z","bundle_sha256":"572d99471b3cf03ab230c25c8c8dcc8bcd1bdd5ac7138ef2ef5f91e0200936e5"}}