{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HKL7V6NSFIYBGXPD2IX3GIXBUC","short_pith_number":"pith:HKL7V6NS","schema_version":"1.0","canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","source":{"kind":"arxiv","id":"1406.7321","version":2},"attestation_state":"computed","paper":{"title":"Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ian E.H. Yen, Inderjit S. Dhillon, Kai Zhong, Pradeep Ravikumar","submitted_at":"2014-06-27T21:29:17Z","abstract_excerpt":"We consider the class of optimization problems arising from computationally intensive L1-regularized M-estimators, where the function or gradient values are very expensive to compute. A particular instance of interest is the L1-regularized MLE for learning Conditional Random Fields (CRFs), which are a popular class of statistical models for varied structured prediction problems such as sequence labeling, alignment, and classification with label taxonomy. L1-regularized MLEs for CRFs are particularly expensive to optimize since computing the gradient values requires an expensive inference step."},"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":"1406.7321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T21:29:17Z","cross_cats_sorted":[],"title_canon_sha256":"754eebb805aebf0ba5e87fd798b402c394df9709fd29f63b0deb5a9d9492fa1c","abstract_canon_sha256":"9ec1a1b73d61c9a3f6393ef2d8071904dd79987d3f9becb2eea95f0dbf00bc7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:53.975425Z","signature_b64":"QWHqf4Q8s1PCN8DW9JXOFjed53V0ddfnDrjVwj22pn68OOYOP76KTd5WybqVRjJ+k9a5ss5A1h4mHGqHY2RSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","last_reissued_at":"2026-05-18T02:28:53.975009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:53.975009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ian E.H. Yen, Inderjit S. Dhillon, Kai Zhong, Pradeep Ravikumar","submitted_at":"2014-06-27T21:29:17Z","abstract_excerpt":"We consider the class of optimization problems arising from computationally intensive L1-regularized M-estimators, where the function or gradient values are very expensive to compute. A particular instance of interest is the L1-regularized MLE for learning Conditional Random Fields (CRFs), which are a popular class of statistical models for varied structured prediction problems such as sequence labeling, alignment, and classification with label taxonomy. L1-regularized MLEs for CRFs are particularly expensive to optimize since computing the gradient values requires an expensive inference step."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7321","kind":"arxiv","version":2},"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":"1406.7321","created_at":"2026-05-18T02:28:53.975085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7321v2","created_at":"2026-05-18T02:28:53.975085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7321","created_at":"2026-05-18T02:28:53.975085+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKL7V6NSFIYB","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKL7V6NSFIYBGXPD","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKL7V6NS","created_at":"2026-05-18T12:28:30.664211+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/HKL7V6NSFIYBGXPD2IX3GIXBUC","json":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC.json","graph_json":"https://pith.science/api/pith-number/HKL7V6NSFIYBGXPD2IX3GIXBUC/graph.json","events_json":"https://pith.science/api/pith-number/HKL7V6NSFIYBGXPD2IX3GIXBUC/events.json","paper":"https://pith.science/paper/HKL7V6NS"},"agent_actions":{"view_html":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC","download_json":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC.json","view_paper":"https://pith.science/paper/HKL7V6NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7321&json=true","fetch_graph":"https://pith.science/api/pith-number/HKL7V6NSFIYBGXPD2IX3GIXBUC/graph.json","fetch_events":"https://pith.science/api/pith-number/HKL7V6NSFIYBGXPD2IX3GIXBUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/action/storage_attestation","attest_author":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/action/author_attestation","sign_citation":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/action/citation_signature","submit_replication":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/action/replication_record"}},"created_at":"2026-05-18T02:28:53.975085+00:00","updated_at":"2026-05-18T02:28:53.975085+00:00"}