{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMYVEG4JZLCPNLURS5UETVCUL4","short_pith_number":"pith:DMYVEG4J","canonical_record":{"source":{"id":"1604.05694","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"311ccb37c791efb10223813b82902df0c720d9ed33fdd47c728fcda176a8c507","abstract_canon_sha256":"93e1a4af9e5000e3dcd97887b463aef33c8d45586124f4ebde3422d075cfc424"},"schema_version":"1.0"},"canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","source":{"kind":"arxiv","id":"1604.05694","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05694","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05694v3","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05694","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"DMYVEG4JZLCP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMYVEG4JZLCPNLUR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMYVEG4J","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMYVEG4JZLCPNLURS5UETVCUL4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05694","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"311ccb37c791efb10223813b82902df0c720d9ed33fdd47c728fcda176a8c507","abstract_canon_sha256":"93e1a4af9e5000e3dcd97887b463aef33c8d45586124f4ebde3422d075cfc424"},"schema_version":"1.0"},"canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:53.701158Z","signature_b64":"JiQKPrETECpePxE4dBYZj/Dcl4ihd1jShgYJ48BgGz1ZM8RhSTNEvE9V8B4zGNau74lcQ9Qbe4O/2/4dIaW6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","last_reissued_at":"2026-05-17T23:45:53.700752Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:53.700752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05694","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-05-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/vPvkgzkhXqd/68hVqKhenAGGx3PIQrz3ibEsS10LZu1q3ZdBmvNiSjDHPmxPynuwrFHLM/y3mD+u0OST1HHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:33:51.348301Z"},"content_sha256":"ed0ce9ea7f3c555c2ae20a3b2a80f0349b8274078f94eaafdc8cec5409eaeba4","schema_version":"1.0","event_id":"sha256:ed0ce9ea7f3c555c2ae20a3b2a80f0349b8274078f94eaafdc8cec5409eaeba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMYVEG4JZLCPNLURS5UETVCUL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Distance Algorithms: Theory and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hua Zhou, Kenneth Lange, Kevin L. Keys","submitted_at":"2016-04-19T19:05:28Z","abstract_excerpt":"Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If $f(\\boldsymbol{x})$ is the loss function, and $C$ is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss $f(\\boldsymbol{x})+\\frac{\\rho}{2}\\mathop{dist}(x,C)^2$ and following the solution $\\boldsymbol{x}_{\\rho}$ to its limit as $\\rho$ tends to $\\infty$. At each iteration the squared Euclidean distance $\\mathop{dist}(\\boldsymbol{x},C)^2$ is majorized by the spherical quadratic $\\| \\boldsymbol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05694","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":""},"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-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIK8KBrXYbWh1a9ko/u9+q25REyLN5njMPerzMqCPOIYKxJhdncMJvccBJxVGH6qX1J/CRZ9W61IQa+czMctDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:33:51.348745Z"},"content_sha256":"61b9a2a19c5a0997633728b973aab35c37f951abab697b156e2e22bcace910ad","schema_version":"1.0","event_id":"sha256:61b9a2a19c5a0997633728b973aab35c37f951abab697b156e2e22bcace910ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/bundle.json","state_url":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMYVEG4JZLCPNLURS5UETVCUL4/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-06T15:33:51Z","links":{"resolver":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4","bundle":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/bundle.json","state":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMYVEG4JZLCPNLURS5UETVCUL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMYVEG4JZLCPNLURS5UETVCUL4","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":"93e1a4af9e5000e3dcd97887b463aef33c8d45586124f4ebde3422d075cfc424","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","title_canon_sha256":"311ccb37c791efb10223813b82902df0c720d9ed33fdd47c728fcda176a8c507"},"schema_version":"1.0","source":{"id":"1604.05694","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05694","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05694v3","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05694","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"DMYVEG4JZLCP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMYVEG4JZLCPNLUR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMYVEG4J","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:61b9a2a19c5a0997633728b973aab35c37f951abab697b156e2e22bcace910ad","target":"graph","created_at":"2026-05-17T23:45:53Z","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":"Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If $f(\\boldsymbol{x})$ is the loss function, and $C$ is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss $f(\\boldsymbol{x})+\\frac{\\rho}{2}\\mathop{dist}(x,C)^2$ and following the solution $\\boldsymbol{x}_{\\rho}$ to its limit as $\\rho$ tends to $\\infty$. At each iteration the squared Euclidean distance $\\mathop{dist}(\\boldsymbol{x},C)^2$ is majorized by the spherical quadratic $\\| \\boldsymbol","authors_text":"Hua Zhou, Kenneth Lange, Kevin L. Keys","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","title":"Proximal Distance Algorithms: Theory and Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05694","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:ed0ce9ea7f3c555c2ae20a3b2a80f0349b8274078f94eaafdc8cec5409eaeba4","target":"record","created_at":"2026-05-17T23:45:53Z","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":"93e1a4af9e5000e3dcd97887b463aef33c8d45586124f4ebde3422d075cfc424","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","title_canon_sha256":"311ccb37c791efb10223813b82902df0c720d9ed33fdd47c728fcda176a8c507"},"schema_version":"1.0","source":{"id":"1604.05694","kind":"arxiv","version":3}},"canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","first_computed_at":"2026-05-17T23:45:53.700752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:53.700752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiQKPrETECpePxE4dBYZj/Dcl4ihd1jShgYJ48BgGz1ZM8RhSTNEvE9V8B4zGNau74lcQ9Qbe4O/2/4dIaW6Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:53.701158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05694","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0ce9ea7f3c555c2ae20a3b2a80f0349b8274078f94eaafdc8cec5409eaeba4","sha256:61b9a2a19c5a0997633728b973aab35c37f951abab697b156e2e22bcace910ad"],"state_sha256":"4a59be83c1247d1d04d2e76b369a205b7f0d21423c74a9f68937e992ef96b55c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z67bo+8ttIRunYSFQjnulMwQLHSol0k+PW2n/cIuxXvSZPc1iRNqsVmn93od3KOw/MJCzj1VNQu6Q+sCFUozCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:33:51.351247Z","bundle_sha256":"131afc35e473325558949935a6d6f5b6354134dea4e4a4670d069be87611a799"}}