{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QQTDDJVKFFVSPY55WOKVEAGETQ","short_pith_number":"pith:QQTDDJVK","canonical_record":{"source":{"id":"0909.1308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-09-07T18:48:42Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"cc5d638287720259cd8a856c5c01d24127d050a6ffaaf68e63b29e869d5092b9","abstract_canon_sha256":"51228a20a6514f7872d2747baeae8acd5a03b1195033a5c9581669e2bb3fbdab"},"schema_version":"1.0"},"canonical_sha256":"842631a6aa296b27e3bdb3955200c49c25b0348dce23dbec9fb4df115fc09b97","source":{"kind":"arxiv","id":"0909.1308","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1308","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1308v2","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1308","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"QQTDDJVKFFVS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QQTDDJVKFFVSPY55","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QQTDDJVK","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QQTDDJVKFFVSPY55WOKVEAGETQ","target":"record","payload":{"canonical_record":{"source":{"id":"0909.1308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-09-07T18:48:42Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"cc5d638287720259cd8a856c5c01d24127d050a6ffaaf68e63b29e869d5092b9","abstract_canon_sha256":"51228a20a6514f7872d2747baeae8acd5a03b1195033a5c9581669e2bb3fbdab"},"schema_version":"1.0"},"canonical_sha256":"842631a6aa296b27e3bdb3955200c49c25b0348dce23dbec9fb4df115fc09b97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:58.857150Z","signature_b64":"rsewzKIj6dUW3iknUiGpTH9MLZcaRGeQivjOrReqDSPjsClY1GettisrZaMjDQOIRiJGoos/239yxOBL9c8UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"842631a6aa296b27e3bdb3955200c49c25b0348dce23dbec9fb4df115fc09b97","last_reissued_at":"2026-05-18T02:11:58.856362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:58.856362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.1308","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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3xc9CcqtBeg7sLuMfwM+4T2spuJ3Ml9C5beM8j/p2nhvwnKZ2BYvw6w3pD6k0NJYnUnzqKOLg7djy29LbHADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:55:05.396469Z"},"content_sha256":"52f5087a4b7f70a2b349bfefadf3e2c8b73a7407588eaf01f399fde376584505","schema_version":"1.0","event_id":"sha256:52f5087a4b7f70a2b349bfefadf3e2c8b73a7407588eaf01f399fde376584505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QQTDDJVKFFVSPY55WOKVEAGETQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Learning of Sparse Conditional Random Fields for Supervised Sequence Labelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Yvon (LIMSI), Nataliya Sokolovska (LTCI), Olivier Capp\\'e (LTCI), Thomas Lavergne (LIMSI)","submitted_at":"2009-09-07T18:48:42Z","abstract_excerpt":"Conditional Random Fields (CRFs) constitute a popular and efficient approach for supervised sequence labelling. CRFs can cope with large description spaces and can integrate some form of structural dependency between labels. In this contribution, we address the issue of efficient feature selection for CRFs based on imposing sparsity through an L1 penalty. We first show how sparsity of the parameter set can be exploited to significantly speed up training and labelling. We then introduce coordinate descent parameter update schemes for CRFs with L1 regularization. We finally provide some empirica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1308","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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F09hjZJsD7POYPo2ERAFVchx0EeFDm+YAg/foEXF7LntVeYBrmFOlDbVEcy/RIZ+forFIQiBD4T+q5ppIw/rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:55:05.396834Z"},"content_sha256":"b0cf3ab972bef4d41947926f67217caf3265d4b90056fc0d02c525d92df302f5","schema_version":"1.0","event_id":"sha256:b0cf3ab972bef4d41947926f67217caf3265d4b90056fc0d02c525d92df302f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/bundle.json","state_url":"https://pith.science/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/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-27T20:55:05Z","links":{"resolver":"https://pith.science/pith/QQTDDJVKFFVSPY55WOKVEAGETQ","bundle":"https://pith.science/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/bundle.json","state":"https://pith.science/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQTDDJVKFFVSPY55WOKVEAGETQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QQTDDJVKFFVSPY55WOKVEAGETQ","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":"51228a20a6514f7872d2747baeae8acd5a03b1195033a5c9581669e2bb3fbdab","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-09-07T18:48:42Z","title_canon_sha256":"cc5d638287720259cd8a856c5c01d24127d050a6ffaaf68e63b29e869d5092b9"},"schema_version":"1.0","source":{"id":"0909.1308","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1308","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1308v2","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1308","created_at":"2026-05-18T02:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"QQTDDJVKFFVS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QQTDDJVKFFVSPY55","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QQTDDJVK","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:b0cf3ab972bef4d41947926f67217caf3265d4b90056fc0d02c525d92df302f5","target":"graph","created_at":"2026-05-18T02:11:58Z","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":"Conditional Random Fields (CRFs) constitute a popular and efficient approach for supervised sequence labelling. CRFs can cope with large description spaces and can integrate some form of structural dependency between labels. In this contribution, we address the issue of efficient feature selection for CRFs based on imposing sparsity through an L1 penalty. We first show how sparsity of the parameter set can be exploited to significantly speed up training and labelling. We then introduce coordinate descent parameter update schemes for CRFs with L1 regularization. We finally provide some empirica","authors_text":"Fran\\c{c}ois Yvon (LIMSI), Nataliya Sokolovska (LTCI), Olivier Capp\\'e (LTCI), Thomas Lavergne (LIMSI)","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-09-07T18:48:42Z","title":"Efficient Learning of Sparse Conditional Random Fields for Supervised Sequence Labelling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1308","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:52f5087a4b7f70a2b349bfefadf3e2c8b73a7407588eaf01f399fde376584505","target":"record","created_at":"2026-05-18T02:11:58Z","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":"51228a20a6514f7872d2747baeae8acd5a03b1195033a5c9581669e2bb3fbdab","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-09-07T18:48:42Z","title_canon_sha256":"cc5d638287720259cd8a856c5c01d24127d050a6ffaaf68e63b29e869d5092b9"},"schema_version":"1.0","source":{"id":"0909.1308","kind":"arxiv","version":2}},"canonical_sha256":"842631a6aa296b27e3bdb3955200c49c25b0348dce23dbec9fb4df115fc09b97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"842631a6aa296b27e3bdb3955200c49c25b0348dce23dbec9fb4df115fc09b97","first_computed_at":"2026-05-18T02:11:58.856362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:11:58.856362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rsewzKIj6dUW3iknUiGpTH9MLZcaRGeQivjOrReqDSPjsClY1GettisrZaMjDQOIRiJGoos/239yxOBL9c8UAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:11:58.857150Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.1308","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52f5087a4b7f70a2b349bfefadf3e2c8b73a7407588eaf01f399fde376584505","sha256:b0cf3ab972bef4d41947926f67217caf3265d4b90056fc0d02c525d92df302f5"],"state_sha256":"35b3a80d40868d913279cd8ada8888d1f028aca6c79c1297424ef41ec2acbb25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwAm5HTSXcrNLm+o5ss9DMpFdmbayl/nSmxUWBpdFFiAwxx+NNdg98MgzSOI9JOwUR7p1zTYrfXHODFajZdEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:55:05.400014Z","bundle_sha256":"78cbda870a5034fa446a2f485322d95f81072f77419f5dd130647d18c843b64f"}}