{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TJIRQ4OWUDDO4BQXKBHDN4N3UV","short_pith_number":"pith:TJIRQ4OW","schema_version":"1.0","canonical_sha256":"9a511871d6a0c6ee0617504e36f1bba554f0c03a59bc5c152c3e8d1aa7718cb8","source":{"kind":"arxiv","id":"1103.3738","version":1},"attestation_state":"computed","paper":{"title":"A Path Algorithm for Constrained Estimation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Hua Zhou, Kenneth Lange","submitted_at":"2011-03-19T01:27:52Z","abstract_excerpt":"Many least squares problems involve affine equality and inequality constraints. Although there are variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current paper proposes a new path following algorithm for quadratic programming based on exact penalization. Similar penalties arise in $l_1$ regularization in model selection. Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to $\\infty$, one recovers the constrai"},"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":"1103.3738","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2011-03-19T01:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"d89249411ab875c1f271540453237f1550e367410b17a81a45002668b9f2f051","abstract_canon_sha256":"d49e30c00f78ab9ccf555985ed2c8d9ce87ea8f688a1bb92b59a4f495f2d54cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:00.735043Z","signature_b64":"tfDaR0RexCFWA60U4NH0Ll81demlt2tA/7VbqQnYb0IiaFBZYPZN3leXJVyW8dahL3g+lfff2Mn/uKiX1U1zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a511871d6a0c6ee0617504e36f1bba554f0c03a59bc5c152c3e8d1aa7718cb8","last_reissued_at":"2026-05-18T03:10:00.734468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:00.734468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Path Algorithm for Constrained Estimation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Hua Zhou, Kenneth Lange","submitted_at":"2011-03-19T01:27:52Z","abstract_excerpt":"Many least squares problems involve affine equality and inequality constraints. Although there are variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current paper proposes a new path following algorithm for quadratic programming based on exact penalization. Similar penalties arise in $l_1$ regularization in model selection. Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to $\\infty$, one recovers the constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3738","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.3738","created_at":"2026-05-18T03:10:00.734533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3738v1","created_at":"2026-05-18T03:10:00.734533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3738","created_at":"2026-05-18T03:10:00.734533+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJIRQ4OWUDDO","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJIRQ4OWUDDO4BQX","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJIRQ4OW","created_at":"2026-05-18T12:26:42.757692+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/TJIRQ4OWUDDO4BQXKBHDN4N3UV","json":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV.json","graph_json":"https://pith.science/api/pith-number/TJIRQ4OWUDDO4BQXKBHDN4N3UV/graph.json","events_json":"https://pith.science/api/pith-number/TJIRQ4OWUDDO4BQXKBHDN4N3UV/events.json","paper":"https://pith.science/paper/TJIRQ4OW"},"agent_actions":{"view_html":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV","download_json":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV.json","view_paper":"https://pith.science/paper/TJIRQ4OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3738&json=true","fetch_graph":"https://pith.science/api/pith-number/TJIRQ4OWUDDO4BQXKBHDN4N3UV/graph.json","fetch_events":"https://pith.science/api/pith-number/TJIRQ4OWUDDO4BQXKBHDN4N3UV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV/action/storage_attestation","attest_author":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV/action/author_attestation","sign_citation":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV/action/citation_signature","submit_replication":"https://pith.science/pith/TJIRQ4OWUDDO4BQXKBHDN4N3UV/action/replication_record"}},"created_at":"2026-05-18T03:10:00.734533+00:00","updated_at":"2026-05-18T03:10:00.734533+00:00"}