{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X6YBNSU4BCFQNNSPI7HTSJPWAQ","short_pith_number":"pith:X6YBNSU4","canonical_record":{"source":{"id":"1908.08676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-23T05:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"258f1278e99d0c2a7959fcf8f06d50840f8197d14ef7d6078b040529a2b6525f","abstract_canon_sha256":"af777fb7d199f959bffdcccf90ef83786414f2df1ccfe50fc5ae011292248bd8"},"schema_version":"1.0"},"canonical_sha256":"bfb016ca9c088b06b64f47cf3925f6041d172d80edb1b39757841792ee782206","source":{"kind":"arxiv","id":"1908.08676","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08676","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08676v3","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08676","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_12","alias_value":"X6YBNSU4BCFQ","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_16","alias_value":"X6YBNSU4BCFQNNSP","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_8","alias_value":"X6YBNSU4","created_at":"2026-07-05T00:17:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X6YBNSU4BCFQNNSPI7HTSJPWAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-23T05:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"258f1278e99d0c2a7959fcf8f06d50840f8197d14ef7d6078b040529a2b6525f","abstract_canon_sha256":"af777fb7d199f959bffdcccf90ef83786414f2df1ccfe50fc5ae011292248bd8"},"schema_version":"1.0"},"canonical_sha256":"bfb016ca9c088b06b64f47cf3925f6041d172d80edb1b39757841792ee782206","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:39.014887Z","signature_b64":"RhTTmW4k9U9dpo44oyktbkmdFUiSgp+afktDnL/Eqxtd9yB5wtpK1wZs9fIWhdaQP5fobCwlc6NPRdWX9E0MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfb016ca9c088b06b64f47cf3925f6041d172d80edb1b39757841792ee782206","last_reissued_at":"2026-07-05T00:17:39.014405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:39.014405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08676","source_version":3,"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-07-05T00:17:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IInbs2Z4kWD5r1QybEGzpA1MRrQFQQ1pKwJTqI3G3ORY5ftU60yrx+5n4od7DRMGtFyMjiiUVOB/kDhkZN5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:45:44.225525Z"},"content_sha256":"6e8d919dedfc98c04ed19b501080798d3e3c111ec9c168b4c5823300d50bdbb0","schema_version":"1.0","event_id":"sha256:6e8d919dedfc98c04ed19b501080798d3e3c111ec9c168b4c5823300d50bdbb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X6YBNSU4BCFQNNSPI7HTSJPWAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchically-Refined Label Attention Network for Sequence Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Leyang Cui, Yue Zhang","submitted_at":"2019-08-23T05:55:46Z","abstract_excerpt":"CRF has been used as a powerful model for statistical sequence labeling. For neural sequence labeling, however, BiLSTM-CRF does not always lead to better results compared with BiLSTM-softmax local classification. This can be because the simple Markov label transition model of CRF does not give much information gain over strong neural encoding. For better representing label sequences, we investigate a hierarchically-refined label attention network, which explicitly leverages label embeddings and captures potential long-term label dependency by giving each word incrementally refined label distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08676","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08676/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:17:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zrp4K6ypAro0oDTbjxB062D++qXJ5HZM9MieENDoiEGlTqvojCbJE86rG1IdtMmGSXrjbqSz46ourpGVrS8SAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:45:44.226017Z"},"content_sha256":"8823b6cd00bbe356f0409fd8b063c6d8cbb374f5de7da01b2d651493cc56add2","schema_version":"1.0","event_id":"sha256:8823b6cd00bbe356f0409fd8b063c6d8cbb374f5de7da01b2d651493cc56add2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/bundle.json","state_url":"https://pith.science/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/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-08-03T19:45:44Z","links":{"resolver":"https://pith.science/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ","bundle":"https://pith.science/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/bundle.json","state":"https://pith.science/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6YBNSU4BCFQNNSPI7HTSJPWAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X6YBNSU4BCFQNNSPI7HTSJPWAQ","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":"af777fb7d199f959bffdcccf90ef83786414f2df1ccfe50fc5ae011292248bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-23T05:55:46Z","title_canon_sha256":"258f1278e99d0c2a7959fcf8f06d50840f8197d14ef7d6078b040529a2b6525f"},"schema_version":"1.0","source":{"id":"1908.08676","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08676","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08676v3","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08676","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_12","alias_value":"X6YBNSU4BCFQ","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_16","alias_value":"X6YBNSU4BCFQNNSP","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_8","alias_value":"X6YBNSU4","created_at":"2026-07-05T00:17:39Z"}],"graph_snapshots":[{"event_id":"sha256:8823b6cd00bbe356f0409fd8b063c6d8cbb374f5de7da01b2d651493cc56add2","target":"graph","created_at":"2026-07-05T00:17:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08676/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"CRF has been used as a powerful model for statistical sequence labeling. For neural sequence labeling, however, BiLSTM-CRF does not always lead to better results compared with BiLSTM-softmax local classification. This can be because the simple Markov label transition model of CRF does not give much information gain over strong neural encoding. For better representing label sequences, we investigate a hierarchically-refined label attention network, which explicitly leverages label embeddings and captures potential long-term label dependency by giving each word incrementally refined label distri","authors_text":"Leyang Cui, Yue Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-23T05:55:46Z","title":"Hierarchically-Refined Label Attention Network for Sequence Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08676","kind":"arxiv","version":3},"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:6e8d919dedfc98c04ed19b501080798d3e3c111ec9c168b4c5823300d50bdbb0","target":"record","created_at":"2026-07-05T00:17:39Z","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":"af777fb7d199f959bffdcccf90ef83786414f2df1ccfe50fc5ae011292248bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-23T05:55:46Z","title_canon_sha256":"258f1278e99d0c2a7959fcf8f06d50840f8197d14ef7d6078b040529a2b6525f"},"schema_version":"1.0","source":{"id":"1908.08676","kind":"arxiv","version":3}},"canonical_sha256":"bfb016ca9c088b06b64f47cf3925f6041d172d80edb1b39757841792ee782206","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfb016ca9c088b06b64f47cf3925f6041d172d80edb1b39757841792ee782206","first_computed_at":"2026-07-05T00:17:39.014405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:17:39.014405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RhTTmW4k9U9dpo44oyktbkmdFUiSgp+afktDnL/Eqxtd9yB5wtpK1wZs9fIWhdaQP5fobCwlc6NPRdWX9E0MBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:17:39.014887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08676","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e8d919dedfc98c04ed19b501080798d3e3c111ec9c168b4c5823300d50bdbb0","sha256:8823b6cd00bbe356f0409fd8b063c6d8cbb374f5de7da01b2d651493cc56add2"],"state_sha256":"ccf838acb2ed89d1f4941a56674c0b1b615f5672f25fc61ebe1d679aee59fdd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FuG+9OJD4SKc3CpzJ45n+CGPqfPGN/WP6ugi1ua1PW1+xe3mLvyOT6N4KBcUDdPfRnG3CxcQZg+hnzbntsPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:45:44.229261Z","bundle_sha256":"a0771ae7b1915021bc8e63f3551a6d5bf6771e04f90c765b725c9d9c2122dcbf"}}