{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DWMXXMA5BM7RIX2QLKNBPUUUID","short_pith_number":"pith:DWMXXMA5","schema_version":"1.0","canonical_sha256":"1d997bb01d0b3f145f505a9a17d29440e6fb1cd25674a35288f9b694d14fb19c","source":{"kind":"arxiv","id":"1211.3907","version":5},"attestation_state":"computed","paper":{"title":"Distance Majorization and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Eric C. Chi, Hua Zhou, Kenneth Lange","submitted_at":"2012-11-16T14:47:43Z","abstract_excerpt":"The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton's method such as the interior point method are viable for small to medium-scale problems. However, modern applications in statistics, engineering, and machine learning are posing problems with potentially tens of thousands of parameters or more. We revisit this convex programming proble"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.3907","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-16T14:47:43Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"51daacefa572067cbd47b5c7a2b71e0925d59d57dd1e4ee8ec9dc97261045b5f","abstract_canon_sha256":"add795e0cd34f132e72b3d5a0460f92d99e9992dae4332701566869a672d708c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:56.070378Z","signature_b64":"reOYg5O0Vwc7xUv7G9XvsyBosEqEccV31uY9SnSeJPhKdfr7JRHIHZ11Oup0HgYxHzKKhuq34tgp8M3YPc35AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d997bb01d0b3f145f505a9a17d29440e6fb1cd25674a35288f9b694d14fb19c","last_reissued_at":"2026-05-18T02:45:56.069690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:56.069690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance Majorization and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Eric C. Chi, Hua Zhou, Kenneth Lange","submitted_at":"2012-11-16T14:47:43Z","abstract_excerpt":"The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton's method such as the interior point method are viable for small to medium-scale problems. However, modern applications in statistics, engineering, and machine learning are posing problems with potentially tens of thousands of parameters or more. We revisit this convex programming proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3907","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.3907","created_at":"2026-05-18T02:45:56.069811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3907v5","created_at":"2026-05-18T02:45:56.069811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3907","created_at":"2026-05-18T02:45:56.069811+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWMXXMA5BM7R","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWMXXMA5BM7RIX2Q","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWMXXMA5","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID","json":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID.json","graph_json":"https://pith.science/api/pith-number/DWMXXMA5BM7RIX2QLKNBPUUUID/graph.json","events_json":"https://pith.science/api/pith-number/DWMXXMA5BM7RIX2QLKNBPUUUID/events.json","paper":"https://pith.science/paper/DWMXXMA5"},"agent_actions":{"view_html":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID","download_json":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID.json","view_paper":"https://pith.science/paper/DWMXXMA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3907&json=true","fetch_graph":"https://pith.science/api/pith-number/DWMXXMA5BM7RIX2QLKNBPUUUID/graph.json","fetch_events":"https://pith.science/api/pith-number/DWMXXMA5BM7RIX2QLKNBPUUUID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID/action/storage_attestation","attest_author":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID/action/author_attestation","sign_citation":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID/action/citation_signature","submit_replication":"https://pith.science/pith/DWMXXMA5BM7RIX2QLKNBPUUUID/action/replication_record"}},"created_at":"2026-05-18T02:45:56.069811+00:00","updated_at":"2026-05-18T02:45:56.069811+00:00"}