{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TYQEHNERRK7YTKEUIJMFEUSUS2","short_pith_number":"pith:TYQEHNER","canonical_record":{"source":{"id":"1312.4092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-12-14T21:48:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a653ac92d9b16d49de29df3eb68d890a8048c498c410c23bf143c3f95f20e286","abstract_canon_sha256":"a9c25a4b1a319960727cd75f63d596a45353c9d213e8a578d167c55dbe2cd8ea"},"schema_version":"1.0"},"canonical_sha256":"9e2043b4918abf89a894425852525496be745bc1c1fbb2724c84c7fe5e1c4ccf","source":{"kind":"arxiv","id":"1312.4092","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4092","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4092v1","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4092","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"TYQEHNERRK7Y","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYQEHNERRK7YTKEU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYQEHNER","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TYQEHNERRK7YTKEUIJMFEUSUS2","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-12-14T21:48:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a653ac92d9b16d49de29df3eb68d890a8048c498c410c23bf143c3f95f20e286","abstract_canon_sha256":"a9c25a4b1a319960727cd75f63d596a45353c9d213e8a578d167c55dbe2cd8ea"},"schema_version":"1.0"},"canonical_sha256":"9e2043b4918abf89a894425852525496be745bc1c1fbb2724c84c7fe5e1c4ccf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:35.792858Z","signature_b64":"ybDiC4z+8dYMVD/cBTrvtdPtYRQ3qI1S0mtMXfj8RQKE4rr6bK0IZ8Cf+hFGR/sTZibvPkwMwMHt7cfvd0HCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e2043b4918abf89a894425852525496be745bc1c1fbb2724c84c7fe5e1c4ccf","last_reissued_at":"2026-05-18T03:04:35.792100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:35.792100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4092","source_version":1,"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-18T03:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"As0l9CiSA962kW6JKvZxnS7aD9tcGHTY/W5UEJUNRdlVYcSYmDLkX7XCcidoQv4g8LOrmiP+IsWIEzAyWmf0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:14:40.753804Z"},"content_sha256":"52fcb83233783565c6421ae26d64814be4cf3706f1b16101909e5f4467901a26","schema_version":"1.0","event_id":"sha256:52fcb83233783565c6421ae26d64814be4cf3706f1b16101909e5f4467901a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TYQEHNERRK7YTKEUIJMFEUSUS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Domain adaptation for sequence labeling using hidden Markov models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Edouard Grave (LIENS, Francis Bach (LIENS, Guillaume Obozinski (LIGM), INRIA Paris - Rocquencourt)","submitted_at":"2013-12-14T21:48:49Z","abstract_excerpt":"Most natural language processing systems based on machine learning are not robust to domain shift. For example, a state-of-the-art syntactic dependency parser trained on Wall Street Journal sentences has an absolute drop in performance of more than ten points when tested on textual data from the Web. An efficient solution to make these methods more robust to domain shift is to first learn a word representation using large amounts of unlabeled data from both domains, and then use this representation as features in a supervised learning algorithm. In this paper, we propose to use hidden Markov m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4092","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"},"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-18T03:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IF5g3/Q38tHkIGqCHK7zvE8Bs4jgoi1qGwMoF2p8MidIKQAmU2D5yeZeAH3v3JPhqt8qvckQjEpuugrm8s22Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:14:40.754146Z"},"content_sha256":"90f704db2a4264383f225bcd4eff2613916be1abb6ea81f913b8c025f71bdcc0","schema_version":"1.0","event_id":"sha256:90f704db2a4264383f225bcd4eff2613916be1abb6ea81f913b8c025f71bdcc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/bundle.json","state_url":"https://pith.science/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/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-27T09:14:40Z","links":{"resolver":"https://pith.science/pith/TYQEHNERRK7YTKEUIJMFEUSUS2","bundle":"https://pith.science/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/bundle.json","state":"https://pith.science/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYQEHNERRK7YTKEUIJMFEUSUS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TYQEHNERRK7YTKEUIJMFEUSUS2","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":"a9c25a4b1a319960727cd75f63d596a45353c9d213e8a578d167c55dbe2cd8ea","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-12-14T21:48:49Z","title_canon_sha256":"a653ac92d9b16d49de29df3eb68d890a8048c498c410c23bf143c3f95f20e286"},"schema_version":"1.0","source":{"id":"1312.4092","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4092","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4092v1","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4092","created_at":"2026-05-18T03:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"TYQEHNERRK7Y","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYQEHNERRK7YTKEU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYQEHNER","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:90f704db2a4264383f225bcd4eff2613916be1abb6ea81f913b8c025f71bdcc0","target":"graph","created_at":"2026-05-18T03:04:35Z","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":"Most natural language processing systems based on machine learning are not robust to domain shift. For example, a state-of-the-art syntactic dependency parser trained on Wall Street Journal sentences has an absolute drop in performance of more than ten points when tested on textual data from the Web. An efficient solution to make these methods more robust to domain shift is to first learn a word representation using large amounts of unlabeled data from both domains, and then use this representation as features in a supervised learning algorithm. In this paper, we propose to use hidden Markov m","authors_text":"Edouard Grave (LIENS, Francis Bach (LIENS, Guillaume Obozinski (LIGM), INRIA Paris - Rocquencourt)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-12-14T21:48:49Z","title":"Domain adaptation for sequence labeling using hidden Markov models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4092","kind":"arxiv","version":1},"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:52fcb83233783565c6421ae26d64814be4cf3706f1b16101909e5f4467901a26","target":"record","created_at":"2026-05-18T03:04:35Z","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":"a9c25a4b1a319960727cd75f63d596a45353c9d213e8a578d167c55dbe2cd8ea","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-12-14T21:48:49Z","title_canon_sha256":"a653ac92d9b16d49de29df3eb68d890a8048c498c410c23bf143c3f95f20e286"},"schema_version":"1.0","source":{"id":"1312.4092","kind":"arxiv","version":1}},"canonical_sha256":"9e2043b4918abf89a894425852525496be745bc1c1fbb2724c84c7fe5e1c4ccf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e2043b4918abf89a894425852525496be745bc1c1fbb2724c84c7fe5e1c4ccf","first_computed_at":"2026-05-18T03:04:35.792100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:35.792100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ybDiC4z+8dYMVD/cBTrvtdPtYRQ3qI1S0mtMXfj8RQKE4rr6bK0IZ8Cf+hFGR/sTZibvPkwMwMHt7cfvd0HCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:35.792858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4092","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52fcb83233783565c6421ae26d64814be4cf3706f1b16101909e5f4467901a26","sha256:90f704db2a4264383f225bcd4eff2613916be1abb6ea81f913b8c025f71bdcc0"],"state_sha256":"b29e180db36f490d5ce589a3e8f4bfdab62282d7ff492374f96a2874592cc92a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkiTRs4aeujgA1OSsOBm34h5FZIv+cOIKqCN5swMsiOHLhwyEjChlzhYVITeyPqkZJIhwUOzLTLFpS6KAyoTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:14:40.756040Z","bundle_sha256":"7fae71d961b15c8d351a9068c50315de40ddf021af2268fd124265752d55f842"}}