{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BV27KYF7CHWKEHP43M7BZRHC6F","short_pith_number":"pith:BV27KYF7","canonical_record":{"source":{"id":"1306.5918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"2dfde538a022f26dfdc16729bda14441812ee6bb73f065c802e8118f14171da3","abstract_canon_sha256":"071ce77574a7e977ee36250d5e4c23ab647c8c2229fa92ad77eecefa514c8298"},"schema_version":"1.0"},"canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","source":{"kind":"arxiv","id":"1306.5918","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5918","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5918v2","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5918","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"BV27KYF7CHWK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BV27KYF7CHWKEHP4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BV27KYF7","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BV27KYF7CHWKEHP43M7BZRHC6F","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"2dfde538a022f26dfdc16729bda14441812ee6bb73f065c802e8118f14171da3","abstract_canon_sha256":"071ce77574a7e977ee36250d5e4c23ab647c8c2229fa92ad77eecefa514c8298"},"schema_version":"1.0"},"canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:47.804936Z","signature_b64":"Hed64Un3/fwwLYx0+zWry9d1OX9Ur7orxgcOJMae67hFB+CYNmBSVL8CaqqjwnAYaTlGeIdMDgEDVa23a5nZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","last_reissued_at":"2026-05-18T02:20:47.804208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:47.804208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5918","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-18T02:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnMZOuluNDECQCDHs0jqyYNUMqWTMvl1W3bWwWW+A82JJgKD9PcX0h6mAHZ9OpZhEtbNhXxVMHUE6/nKJ4EuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:20:03.242850Z"},"content_sha256":"6b2e0858cbd192bfbe7b999f7f2c64175cdbefc637925fb4f5d962293ab4b7eb","schema_version":"1.0","event_id":"sha256:6b2e0858cbd192bfbe7b999f7f2c64175cdbefc637925fb4f5d962293ab4b7eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BV27KYF7CHWKEHP43M7BZRHC6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Lin Xiao, Zhaosong Lu","submitted_at":"2013-06-25T11:11:42Z","abstract_excerpt":"We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function. At each iteration, this method randomly picks a block according to any prescribed probability distribution and solves typically several associated proximal subproblems that usually have a closed-form solution, until a certain progress on objective value is achieved. In contrast to the usual randomized block coordinate descent method [23,20], our method has a nonmonotone flavor and uses variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5918","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-18T02:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvluh0hRN6oBJIJqYxiC00UmD3Qo8SOG+225ytA2RdtSO/5r+oXRterV8qlGXo18ry1tMpFuGG2uQNN1LRtQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:20:03.243204Z"},"content_sha256":"37c302234db6bcdb653a889df889f531e7f75a7df2dafe2ec4205aac077d6b1c","schema_version":"1.0","event_id":"sha256:37c302234db6bcdb653a889df889f531e7f75a7df2dafe2ec4205aac077d6b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/bundle.json","state_url":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BV27KYF7CHWKEHP43M7BZRHC6F/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-07-02T08:20:03Z","links":{"resolver":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F","bundle":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/bundle.json","state":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BV27KYF7CHWKEHP43M7BZRHC6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BV27KYF7CHWKEHP43M7BZRHC6F","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":"071ce77574a7e977ee36250d5e4c23ab647c8c2229fa92ad77eecefa514c8298","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","title_canon_sha256":"2dfde538a022f26dfdc16729bda14441812ee6bb73f065c802e8118f14171da3"},"schema_version":"1.0","source":{"id":"1306.5918","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5918","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5918v2","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5918","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"BV27KYF7CHWK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BV27KYF7CHWKEHP4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BV27KYF7","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:37c302234db6bcdb653a889df889f531e7f75a7df2dafe2ec4205aac077d6b1c","target":"graph","created_at":"2026-05-18T02:20:47Z","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":"We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function. At each iteration, this method randomly picks a block according to any prescribed probability distribution and solves typically several associated proximal subproblems that usually have a closed-form solution, until a certain progress on objective value is achieved. In contrast to the usual randomized block coordinate descent method [23,20], our method has a nonmonotone flavor and uses variable","authors_text":"Lin Xiao, Zhaosong Lu","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","title":"A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5918","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:6b2e0858cbd192bfbe7b999f7f2c64175cdbefc637925fb4f5d962293ab4b7eb","target":"record","created_at":"2026-05-18T02:20:47Z","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":"071ce77574a7e977ee36250d5e4c23ab647c8c2229fa92ad77eecefa514c8298","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","title_canon_sha256":"2dfde538a022f26dfdc16729bda14441812ee6bb73f065c802e8118f14171da3"},"schema_version":"1.0","source":{"id":"1306.5918","kind":"arxiv","version":2}},"canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","first_computed_at":"2026-05-18T02:20:47.804208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:47.804208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hed64Un3/fwwLYx0+zWry9d1OX9Ur7orxgcOJMae67hFB+CYNmBSVL8CaqqjwnAYaTlGeIdMDgEDVa23a5nZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:47.804936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5918","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b2e0858cbd192bfbe7b999f7f2c64175cdbefc637925fb4f5d962293ab4b7eb","sha256:37c302234db6bcdb653a889df889f531e7f75a7df2dafe2ec4205aac077d6b1c"],"state_sha256":"885d5f03de36ebfa58db6341f615b77fcae3d8cacc6c68b3ce7cd0ece6716fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6p7To8LYVNn8RrpgZLPX2xft8CpVuhPsnq1e7vDgdcFyodfdoNSFIJqWgnh7/hWRy+Pr7xOLPU2gBM51wWSfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:20:03.246372Z","bundle_sha256":"41be212b6ca914dcbcd97b21cdc186ba9fde1aa88f516b920d88496d8af14e73"}}