{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VMHZQKJE7GEVIVWZNJZRJ2PZN2","short_pith_number":"pith:VMHZQKJE","canonical_record":{"source":{"id":"1507.07598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-27T22:53:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0e39f9b2c775a9f0ea46ff5aac66396115679233ebae26983cbaa5e6a33928b","abstract_canon_sha256":"4efa7879443a7ec496dc3401ba55e3b12c7085ce556f03c212320aa12325a223"},"schema_version":"1.0"},"canonical_sha256":"ab0f982924f9895456d96a7314e9f96eb44937c9c689edf54328c34d772cccb1","source":{"kind":"arxiv","id":"1507.07598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07598","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07598v1","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07598","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"VMHZQKJE7GEV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMHZQKJE7GEVIVWZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMHZQKJE","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VMHZQKJE7GEVIVWZNJZRJ2PZN2","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-27T22:53:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0e39f9b2c775a9f0ea46ff5aac66396115679233ebae26983cbaa5e6a33928b","abstract_canon_sha256":"4efa7879443a7ec496dc3401ba55e3b12c7085ce556f03c212320aa12325a223"},"schema_version":"1.0"},"canonical_sha256":"ab0f982924f9895456d96a7314e9f96eb44937c9c689edf54328c34d772cccb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:12.377183Z","signature_b64":"cc0hQsW+SLeQqthbnzP3YSTksrs4VsnEno4OVVB/1+xpIEZv7Ct2eesjv2EBCm7GtaFOCkv8v6n7HGvbYgirCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab0f982924f9895456d96a7314e9f96eb44937c9c689edf54328c34d772cccb1","last_reissued_at":"2026-05-18T01:36:12.376697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:12.376697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07598","source_version":1,"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:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3Gj7L6dbyIFBzKvrqTiorfxxqtjvBjh5jBr0aZKirvFS9P/OTbEIj530txrtm2/gN7zsJCgSCPtGYnBK64FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:55:57.231809Z"},"content_sha256":"9f89ca12d1de75c3b8ce91198d43007b1e11c6d027393e296714e2e2631064ec","schema_version":"1.0","event_id":"sha256:9f89ca12d1de75c3b8ce91198d43007b1e11c6d027393e296714e2e2631064ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VMHZQKJE7GEVIVWZNJZRJ2PZN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The proximal distance algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Kenneth Lange, Kevin L. Keys","submitted_at":"2015-07-27T22:53:01Z","abstract_excerpt":"The MM principle is a device for creating optimization algorithms satisfying the ascent or descent property. The current survey emphasizes the role of the MM principle in nonlinear programming. For smooth functions, one can construct an adaptive interior point method based on scaled Bregmann barriers. This algorithm does not follow the central path. For convex programming subject to nonsmooth constraints, one can combine an exact penalty method with distance majorization to create versatile algorithms that are effective even in discrete optimization. These proximal distance algorithms are high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07598","kind":"arxiv","version":1},"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:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbSSCA1zAaqzHCL7vNIMpYT/H/XzZKpqtSBg44vF0ZeRsGXP/ENaQQJjV6ScjR94E2qJvM4wVBc6fcCWDqfYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:55:57.232158Z"},"content_sha256":"043e1d47a0cb6509ab4fcb429bc71e5b3b937e86c53660bdc0d4d8d10dba62c3","schema_version":"1.0","event_id":"sha256:043e1d47a0cb6509ab4fcb429bc71e5b3b937e86c53660bdc0d4d8d10dba62c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/bundle.json","state_url":"https://pith.science/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/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-06T18:55:57Z","links":{"resolver":"https://pith.science/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2","bundle":"https://pith.science/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/bundle.json","state":"https://pith.science/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMHZQKJE7GEVIVWZNJZRJ2PZN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VMHZQKJE7GEVIVWZNJZRJ2PZN2","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":"4efa7879443a7ec496dc3401ba55e3b12c7085ce556f03c212320aa12325a223","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-27T22:53:01Z","title_canon_sha256":"b0e39f9b2c775a9f0ea46ff5aac66396115679233ebae26983cbaa5e6a33928b"},"schema_version":"1.0","source":{"id":"1507.07598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07598","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07598v1","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07598","created_at":"2026-05-18T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"VMHZQKJE7GEV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMHZQKJE7GEVIVWZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMHZQKJE","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:043e1d47a0cb6509ab4fcb429bc71e5b3b937e86c53660bdc0d4d8d10dba62c3","target":"graph","created_at":"2026-05-18T01:36:12Z","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":"The MM principle is a device for creating optimization algorithms satisfying the ascent or descent property. The current survey emphasizes the role of the MM principle in nonlinear programming. For smooth functions, one can construct an adaptive interior point method based on scaled Bregmann barriers. This algorithm does not follow the central path. For convex programming subject to nonsmooth constraints, one can combine an exact penalty method with distance majorization to create versatile algorithms that are effective even in discrete optimization. These proximal distance algorithms are high","authors_text":"Kenneth Lange, Kevin L. Keys","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-27T22:53:01Z","title":"The proximal distance algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07598","kind":"arxiv","version":1},"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:9f89ca12d1de75c3b8ce91198d43007b1e11c6d027393e296714e2e2631064ec","target":"record","created_at":"2026-05-18T01:36:12Z","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":"4efa7879443a7ec496dc3401ba55e3b12c7085ce556f03c212320aa12325a223","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-27T22:53:01Z","title_canon_sha256":"b0e39f9b2c775a9f0ea46ff5aac66396115679233ebae26983cbaa5e6a33928b"},"schema_version":"1.0","source":{"id":"1507.07598","kind":"arxiv","version":1}},"canonical_sha256":"ab0f982924f9895456d96a7314e9f96eb44937c9c689edf54328c34d772cccb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab0f982924f9895456d96a7314e9f96eb44937c9c689edf54328c34d772cccb1","first_computed_at":"2026-05-18T01:36:12.376697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:12.376697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cc0hQsW+SLeQqthbnzP3YSTksrs4VsnEno4OVVB/1+xpIEZv7Ct2eesjv2EBCm7GtaFOCkv8v6n7HGvbYgirCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:12.377183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f89ca12d1de75c3b8ce91198d43007b1e11c6d027393e296714e2e2631064ec","sha256:043e1d47a0cb6509ab4fcb429bc71e5b3b937e86c53660bdc0d4d8d10dba62c3"],"state_sha256":"bc8ffb8bb5e8d04f0e3dfd9d2451da7640500520262a8f79f694c8713ed7d1b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SroM8MTUun/blo3/6bVn5KS6+HBP66NLX83gx43pyhDN/iJmGz93p5AFrauHPlPS00xBylYZQBsVFuxWx0UvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:55:57.234083Z","bundle_sha256":"79c488073f8bc857ba34ff8149961628fde14306d0df8cd9e7b13da357e34ebe"}}