{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HKL7V6NSFIYBGXPD2IX3GIXBUC","short_pith_number":"pith:HKL7V6NS","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"},"canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","source":{"kind":"arxiv","id":"1406.7321","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7321","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7321v2","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7321","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"pith_short_12","alias_value":"HKL7V6NSFIYB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKL7V6NSFIYBGXPD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKL7V6NS","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HKL7V6NSFIYBGXPD2IX3GIXBUC","target":"record","payload":{"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"},"canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","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"},"source_kind":"arxiv","source_id":"1406.7321","source_version":2,"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-18T02:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRMBMv60KImFAHPUb/orcWTPhMgFsUduEs/zs4NJAyuZ+GLJNsqQrct8Eq11arxiVKoBF/sxTWLMVwC27Tb3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:50:52.468749Z"},"content_sha256":"35f586656fd5926334cae647f0084fb6c22db1307a8147f8d79360e3a8877a15","schema_version":"1.0","event_id":"sha256:35f586656fd5926334cae647f0084fb6c22db1307a8147f8d79360e3a8877a15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HKL7V6NSFIYBGXPD2IX3GIXBUC","target":"graph","payload":{"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"},"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-18T02:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTW5vz4HTRlT8fdfO7fb+K/teLOLJK+rPke02B2aJph0R6wuEIHOvPYX5SEi070+p1/9AKtxyeTRJvmgNTwKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:50:52.469094Z"},"content_sha256":"59e5b745fb3d3bf215f7be5d5330ae56087e9b7c12aefcad7e982be8fd2e9123","schema_version":"1.0","event_id":"sha256:59e5b745fb3d3bf215f7be5d5330ae56087e9b7c12aefcad7e982be8fd2e9123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/bundle.json","state_url":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/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-05-30T18:50:52Z","links":{"resolver":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC","bundle":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/bundle.json","state":"https://pith.science/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKL7V6NSFIYBGXPD2IX3GIXBUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HKL7V6NSFIYBGXPD2IX3GIXBUC","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":"9ec1a1b73d61c9a3f6393ef2d8071904dd79987d3f9becb2eea95f0dbf00bc7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T21:29:17Z","title_canon_sha256":"754eebb805aebf0ba5e87fd798b402c394df9709fd29f63b0deb5a9d9492fa1c"},"schema_version":"1.0","source":{"id":"1406.7321","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7321","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7321v2","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7321","created_at":"2026-05-18T02:28:53Z"},{"alias_kind":"pith_short_12","alias_value":"HKL7V6NSFIYB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKL7V6NSFIYBGXPD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKL7V6NS","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:59e5b745fb3d3bf215f7be5d5330ae56087e9b7c12aefcad7e982be8fd2e9123","target":"graph","created_at":"2026-05-18T02:28: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":"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.","authors_text":"Ian E.H. Yen, Inderjit S. Dhillon, Kai Zhong, Pradeep Ravikumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T21:29:17Z","title":"Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7321","kind":"arxiv","version":2},"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:35f586656fd5926334cae647f0084fb6c22db1307a8147f8d79360e3a8877a15","target":"record","created_at":"2026-05-18T02:28: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":"9ec1a1b73d61c9a3f6393ef2d8071904dd79987d3f9becb2eea95f0dbf00bc7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T21:29:17Z","title_canon_sha256":"754eebb805aebf0ba5e87fd798b402c394df9709fd29f63b0deb5a9d9492fa1c"},"schema_version":"1.0","source":{"id":"1406.7321","kind":"arxiv","version":2}},"canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a97faf9b22a30135de3d22fb322e1a09a865fa4e470af6ba39562feac2cba83","first_computed_at":"2026-05-18T02:28:53.975009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:53.975009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QWHqf4Q8s1PCN8DW9JXOFjed53V0ddfnDrjVwj22pn68OOYOP76KTd5WybqVRjJ+k9a5ss5A1h4mHGqHY2RSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:53.975425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7321","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35f586656fd5926334cae647f0084fb6c22db1307a8147f8d79360e3a8877a15","sha256:59e5b745fb3d3bf215f7be5d5330ae56087e9b7c12aefcad7e982be8fd2e9123"],"state_sha256":"a16435261ae47501f58ba9dce31f12895967b8062beb78262e2a2800c9f23566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+sLMHUvYBGHIj1LFWATWapNGTx1/nGlQODcDnid0lfzItAx4NavjEfkO9B9jQ745vJ4PAIl6WTEKWbc98W/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:50:52.471125Z","bundle_sha256":"aa751452047e1d28b8c3c23b532e7d1d968c19f7a69237d454dcca11be814ff4"}}