{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4LUZDHLF4BCPXTCGW4N5VMS2TA","short_pith_number":"pith:4LUZDHLF","canonical_record":{"source":{"id":"1409.8444","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T09:12:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ade4a70dd20b77fc33613cd0464063c93ba0ff3e2d44f1699f7faa00c32ad218","abstract_canon_sha256":"0a13727676a050520d0f1a157b8d2cae006ac9b4c4894b6d35083944931f0b1b"},"schema_version":"1.0"},"canonical_sha256":"e2e9919d65e044fbcc46b71bdab25a980c6999835e7a1dfb52dfad198c7ac189","source":{"kind":"arxiv","id":"1409.8444","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8444","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8444v5","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8444","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"4LUZDHLF4BCP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LUZDHLF4BCPXTCG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LUZDHLF","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4LUZDHLF4BCPXTCGW4N5VMS2TA","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8444","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T09:12:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ade4a70dd20b77fc33613cd0464063c93ba0ff3e2d44f1699f7faa00c32ad218","abstract_canon_sha256":"0a13727676a050520d0f1a157b8d2cae006ac9b4c4894b6d35083944931f0b1b"},"schema_version":"1.0"},"canonical_sha256":"e2e9919d65e044fbcc46b71bdab25a980c6999835e7a1dfb52dfad198c7ac189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.270528Z","signature_b64":"1HJbjabWrn8ZnqTpoFj26cVhyv8l+JYbfoyaA3yOBqUfSdV0iKwaSyNrmThSE569ta8gq0f/ueYgqfqkhFHvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e9919d65e044fbcc46b71bdab25a980c6999835e7a1dfb52dfad198c7ac189","last_reissued_at":"2026-05-18T01:26:58.269887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.269887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8444","source_version":5,"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-18T01:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYr7mnlUHMmKjPTnQM8fUNqT7jTajdV7ayyDQrwHmJUqJw3H+tjRiWhkaPmBUd/zRSlIGC8UdB5qPbgV9GSmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:45:13.229161Z"},"content_sha256":"ac6b57361ed610c84ad2d1a744d95d8e0d491b2c0516e9e5d240319b52159bf0","schema_version":"1.0","event_id":"sha256:ac6b57361ed610c84ad2d1a744d95d8e0d491b2c0516e9e5d240319b52159bf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4LUZDHLF4BCPXTCGW4N5VMS2TA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Guoyin Li, Ting Kei Pong","submitted_at":"2014-09-30T09:12:29Z","abstract_excerpt":"We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In this paper, for the direct adaptation of the method to minimize the sum of a proper closed function $g$ and a smooth function $f$ with a Lipschitz continuous gradient, we show that if the step-size parameter is smaller than a computable threshold and the sequence generated has a cluster point, then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8444","kind":"arxiv","version":5},"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-18T01:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ab4wUvNI0/Kjs6QfWgO3aooNBK++tKS+MULKob1n21H2E2kPyFygQgTF8iYHGq8BFE4BGNmy6UBG/DUWRTGyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:45:13.229537Z"},"content_sha256":"cb6eb2694ded6f43ce7fd5d8f6b07ea22259334d3ff745387f9c151a29be96bc","schema_version":"1.0","event_id":"sha256:cb6eb2694ded6f43ce7fd5d8f6b07ea22259334d3ff745387f9c151a29be96bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/bundle.json","state_url":"https://pith.science/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/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-21T13:45:13Z","links":{"resolver":"https://pith.science/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA","bundle":"https://pith.science/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/bundle.json","state":"https://pith.science/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LUZDHLF4BCPXTCGW4N5VMS2TA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4LUZDHLF4BCPXTCGW4N5VMS2TA","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":"0a13727676a050520d0f1a157b8d2cae006ac9b4c4894b6d35083944931f0b1b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T09:12:29Z","title_canon_sha256":"ade4a70dd20b77fc33613cd0464063c93ba0ff3e2d44f1699f7faa00c32ad218"},"schema_version":"1.0","source":{"id":"1409.8444","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8444","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8444v5","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8444","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"4LUZDHLF4BCP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LUZDHLF4BCPXTCG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LUZDHLF","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:cb6eb2694ded6f43ce7fd5d8f6b07ea22259334d3ff745387f9c151a29be96bc","target":"graph","created_at":"2026-05-18T01:26:58Z","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 adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In this paper, for the direct adaptation of the method to minimize the sum of a proper closed function $g$ and a smooth function $f$ with a Lipschitz continuous gradient, we show that if the step-size parameter is smaller than a computable threshold and the sequence generated has a cluster point, then","authors_text":"Guoyin Li, Ting Kei Pong","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T09:12:29Z","title":"Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8444","kind":"arxiv","version":5},"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:ac6b57361ed610c84ad2d1a744d95d8e0d491b2c0516e9e5d240319b52159bf0","target":"record","created_at":"2026-05-18T01:26:58Z","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":"0a13727676a050520d0f1a157b8d2cae006ac9b4c4894b6d35083944931f0b1b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T09:12:29Z","title_canon_sha256":"ade4a70dd20b77fc33613cd0464063c93ba0ff3e2d44f1699f7faa00c32ad218"},"schema_version":"1.0","source":{"id":"1409.8444","kind":"arxiv","version":5}},"canonical_sha256":"e2e9919d65e044fbcc46b71bdab25a980c6999835e7a1dfb52dfad198c7ac189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2e9919d65e044fbcc46b71bdab25a980c6999835e7a1dfb52dfad198c7ac189","first_computed_at":"2026-05-18T01:26:58.269887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.269887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1HJbjabWrn8ZnqTpoFj26cVhyv8l+JYbfoyaA3yOBqUfSdV0iKwaSyNrmThSE569ta8gq0f/ueYgqfqkhFHvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.270528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8444","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac6b57361ed610c84ad2d1a744d95d8e0d491b2c0516e9e5d240319b52159bf0","sha256:cb6eb2694ded6f43ce7fd5d8f6b07ea22259334d3ff745387f9c151a29be96bc"],"state_sha256":"9b4648adb816bf313cf462218209a230aa8dba7f1dd5795b721c5d7c5eafba60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYO+gQZL4xIjfRP4ydgiz9H/+qCV+659tan4zPMM90LJB7DienKyRCfWEYA1KbkcZXo53Z0quHtYa6gpYsjiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T13:45:13.231529Z","bundle_sha256":"965ccfebc336203d4d0936d95cfe222ad6cc31e0d658810fcc1ba336128f17f2"}}