{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LZYILYPJE2PTXWZNJ26YI5NNRC","short_pith_number":"pith:LZYILYPJ","canonical_record":{"source":{"id":"1503.08381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-29T03:41:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"13c6e441e2052893454648f19a01cead6ccf6d30218094f5319686a4d70562be","abstract_canon_sha256":"9322006995c4193f170dcc418653f04b5ed5b32a5ad53dc59999386364799e0b"},"schema_version":"1.0"},"canonical_sha256":"5e7085e1e9269f3bdb2d4ebd8475ad8892db98239cee7ebf0e321622e7aa8f1b","source":{"kind":"arxiv","id":"1503.08381","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08381","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08381v4","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08381","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"LZYILYPJE2PT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZYILYPJE2PTXWZN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZYILYPJ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LZYILYPJE2PTXWZNJ26YI5NNRC","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-29T03:41:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"13c6e441e2052893454648f19a01cead6ccf6d30218094f5319686a4d70562be","abstract_canon_sha256":"9322006995c4193f170dcc418653f04b5ed5b32a5ad53dc59999386364799e0b"},"schema_version":"1.0"},"canonical_sha256":"5e7085e1e9269f3bdb2d4ebd8475ad8892db98239cee7ebf0e321622e7aa8f1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.068303Z","signature_b64":"i3eyx2p1m/rRVDOdLv495xJlwzYrZKM3CP6VJIm/yGyAU17ruRVVV4xsLaT90jwHnO8xVFc7xFx/4E+K9gLuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7085e1e9269f3bdb2d4ebd8475ad8892db98239cee7ebf0e321622e7aa8f1b","last_reissued_at":"2026-05-18T00:00:33.067826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.067826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08381","source_version":4,"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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwrINGuM88uQ7MpkEMdjdb4joBTnINsyxqZ4cvr4ZqyX0cTjaGw5B8zSz9gr9EGO9Sk0xf6tANzsvB7922s9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:21:05.018811Z"},"content_sha256":"a472a042888356e321f4624291b793f5d89dfa6085b09ab66a739b64258608f0","schema_version":"1.0","event_id":"sha256:a472a042888356e321f4624291b793f5d89dfa6085b09ab66a739b64258608f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LZYILYPJE2PTXWZNJ26YI5NNRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Easier and Faster Sequence Labeling for Natural Language Processing: A Search-based Probabilistic Online Learning Framework (SAPO)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Shuming Ma, Xuancheng Ren, Xu Sun, Yi Zhang","submitted_at":"2015-03-29T03:41:03Z","abstract_excerpt":"There are two major approaches for sequence labeling. One is the probabilistic gradient-based methods such as conditional random fields (CRF) and neural networks (e.g., RNN), which have high accuracy but drawbacks: slow training, and no support of search-based optimization (which is important in many cases). The other is the search-based learning methods such as structured perceptron and margin infused relaxed algorithm (MIRA), which have fast training but also drawbacks: low accuracy, no probabilistic information, and non-convergence in real-world tasks. We propose a novel and \"easy\" solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08381","kind":"arxiv","version":4},"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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9QkdheaD5iItWeyjvWtYuFW9Ax+5DCaBbK1D6ogkLh6JdSAbZzp3p7y6KnLxACkq6Xr1emQWfSN0SEbjmue+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:21:05.019153Z"},"content_sha256":"3c9b604c8e54b58d9a3a70ffa8d39f0aa71e1d47485b50a479982f236e1dd545","schema_version":"1.0","event_id":"sha256:3c9b604c8e54b58d9a3a70ffa8d39f0aa71e1d47485b50a479982f236e1dd545"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/bundle.json","state_url":"https://pith.science/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/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-06-02T22:21:05Z","links":{"resolver":"https://pith.science/pith/LZYILYPJE2PTXWZNJ26YI5NNRC","bundle":"https://pith.science/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/bundle.json","state":"https://pith.science/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZYILYPJE2PTXWZNJ26YI5NNRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LZYILYPJE2PTXWZNJ26YI5NNRC","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":"9322006995c4193f170dcc418653f04b5ed5b32a5ad53dc59999386364799e0b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-29T03:41:03Z","title_canon_sha256":"13c6e441e2052893454648f19a01cead6ccf6d30218094f5319686a4d70562be"},"schema_version":"1.0","source":{"id":"1503.08381","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08381","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08381v4","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08381","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"LZYILYPJE2PT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZYILYPJE2PTXWZN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZYILYPJ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:3c9b604c8e54b58d9a3a70ffa8d39f0aa71e1d47485b50a479982f236e1dd545","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"There are two major approaches for sequence labeling. One is the probabilistic gradient-based methods such as conditional random fields (CRF) and neural networks (e.g., RNN), which have high accuracy but drawbacks: slow training, and no support of search-based optimization (which is important in many cases). The other is the search-based learning methods such as structured perceptron and margin infused relaxed algorithm (MIRA), which have fast training but also drawbacks: low accuracy, no probabilistic information, and non-convergence in real-world tasks. We propose a novel and \"easy\" solution","authors_text":"Shuming Ma, Xuancheng Ren, Xu Sun, Yi Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-29T03:41:03Z","title":"Towards Easier and Faster Sequence Labeling for Natural Language Processing: A Search-based Probabilistic Online Learning Framework (SAPO)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08381","kind":"arxiv","version":4},"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:a472a042888356e321f4624291b793f5d89dfa6085b09ab66a739b64258608f0","target":"record","created_at":"2026-05-18T00:00:33Z","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":"9322006995c4193f170dcc418653f04b5ed5b32a5ad53dc59999386364799e0b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-29T03:41:03Z","title_canon_sha256":"13c6e441e2052893454648f19a01cead6ccf6d30218094f5319686a4d70562be"},"schema_version":"1.0","source":{"id":"1503.08381","kind":"arxiv","version":4}},"canonical_sha256":"5e7085e1e9269f3bdb2d4ebd8475ad8892db98239cee7ebf0e321622e7aa8f1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e7085e1e9269f3bdb2d4ebd8475ad8892db98239cee7ebf0e321622e7aa8f1b","first_computed_at":"2026-05-18T00:00:33.067826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.067826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i3eyx2p1m/rRVDOdLv495xJlwzYrZKM3CP6VJIm/yGyAU17ruRVVV4xsLaT90jwHnO8xVFc7xFx/4E+K9gLuCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.068303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08381","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a472a042888356e321f4624291b793f5d89dfa6085b09ab66a739b64258608f0","sha256:3c9b604c8e54b58d9a3a70ffa8d39f0aa71e1d47485b50a479982f236e1dd545"],"state_sha256":"3f9a535e4a05396106ee15c702e4c6cd529651bb366ab626c7aea3346ef4b6cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qsnfxAR33MBkPoC4JjifrxHEY0RPj8l8iobkXpxMZxmHekLGZpWeqVM9ugSntZUCavuzrUsTC98zlza815ECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:21:05.021160Z","bundle_sha256":"636fb7c9ec30e86760a0fe86c6c1322afee9f79221223f0f1e36e9d35ef3738d"}}