{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XMICWMICYQW2YJQQBOJYCOF66V","short_pith_number":"pith:XMICWMIC","canonical_record":{"source":{"id":"1810.00428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-30T17:31:52Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"899e94147330d202902649fb6be68bce1a642f2ac959355ca40056cc0fdea9aa","abstract_canon_sha256":"878b8d2a2f3006188fbe1f521aa21371058a635d077d4282018b549518d172e9"},"schema_version":"1.0"},"canonical_sha256":"bb102b3102c42dac26100b938138bef544847bcd1ce774c718a7106b9864054d","source":{"kind":"arxiv","id":"1810.00428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00428","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00428v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00428","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"XMICWMICYQW2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMICWMICYQW2YJQQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMICWMIC","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XMICWMICYQW2YJQQBOJYCOF66V","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-30T17:31:52Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"899e94147330d202902649fb6be68bce1a642f2ac959355ca40056cc0fdea9aa","abstract_canon_sha256":"878b8d2a2f3006188fbe1f521aa21371058a635d077d4282018b549518d172e9"},"schema_version":"1.0"},"canonical_sha256":"bb102b3102c42dac26100b938138bef544847bcd1ce774c718a7106b9864054d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:27.900672Z","signature_b64":"SgC6iwtwDJA7ucjP/Ixx61EpAkn/8/KUF4oTUlSPFz1bDYsFmJj9oX9jdKlZpQFUwS/HTkvEHr+x2eJ9VsGeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb102b3102c42dac26100b938138bef544847bcd1ce774c718a7106b9864054d","last_reissued_at":"2026-05-18T00:04:27.900166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:27.900166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00428","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-18T00:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Tq39C8HoTLq51xnSL0fnwAcFmpE9MxPymrVYLh9PZWdROcsR1cc885ncALB5Ru/dTz7OMXqG9SD4cBCctWQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:13:25.196462Z"},"content_sha256":"c532a81c37560364a5f444c56e69c1a6b345d4578190bd29e8e628a1d7dae6bc","schema_version":"1.0","event_id":"sha256:c532a81c37560364a5f444c56e69c1a6b345d4578190bd29e8e628a1d7dae6bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XMICWMICYQW2YJQQBOJYCOF66V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Sequence Labeling with Actor-Critic Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Colin Cherry, Grzegorz Kondrak, Saeed Najafi","submitted_at":"2018-09-30T17:31:52Z","abstract_excerpt":"Neural approaches to sequence labeling often use a Conditional Random Field (CRF) to model their output dependencies, while Recurrent Neural Networks (RNN) are used for the same purpose in other tasks. We set out to establish RNNs as an attractive alternative to CRFs for sequence labeling. To do so, we address one of the RNN's most prominent shortcomings, the fact that it is not exposed to its own errors with the maximum-likelihood training. We frame the prediction of the output sequence as a sequential decision-making process, where we train the network with an adjusted actor-critic algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00428","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-18T00:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtD1yV+rBrHHukRCIeVBYwlnPSEEK4gequfxPka4Wc+LcfmIXJEmWQwjqbN94Q6fgBaEc2qYo6Amut8JXpfqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:13:25.196820Z"},"content_sha256":"2e94877b6078b3e452acad2a00683a3da276da6e59be110a691730c7fc517644","schema_version":"1.0","event_id":"sha256:2e94877b6078b3e452acad2a00683a3da276da6e59be110a691730c7fc517644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMICWMICYQW2YJQQBOJYCOF66V/bundle.json","state_url":"https://pith.science/pith/XMICWMICYQW2YJQQBOJYCOF66V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMICWMICYQW2YJQQBOJYCOF66V/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-01T04:13:25Z","links":{"resolver":"https://pith.science/pith/XMICWMICYQW2YJQQBOJYCOF66V","bundle":"https://pith.science/pith/XMICWMICYQW2YJQQBOJYCOF66V/bundle.json","state":"https://pith.science/pith/XMICWMICYQW2YJQQBOJYCOF66V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMICWMICYQW2YJQQBOJYCOF66V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XMICWMICYQW2YJQQBOJYCOF66V","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":"878b8d2a2f3006188fbe1f521aa21371058a635d077d4282018b549518d172e9","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-30T17:31:52Z","title_canon_sha256":"899e94147330d202902649fb6be68bce1a642f2ac959355ca40056cc0fdea9aa"},"schema_version":"1.0","source":{"id":"1810.00428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00428","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00428v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00428","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"XMICWMICYQW2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMICWMICYQW2YJQQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMICWMIC","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2e94877b6078b3e452acad2a00683a3da276da6e59be110a691730c7fc517644","target":"graph","created_at":"2026-05-18T00:04:27Z","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":"Neural approaches to sequence labeling often use a Conditional Random Field (CRF) to model their output dependencies, while Recurrent Neural Networks (RNN) are used for the same purpose in other tasks. We set out to establish RNNs as an attractive alternative to CRFs for sequence labeling. To do so, we address one of the RNN's most prominent shortcomings, the fact that it is not exposed to its own errors with the maximum-likelihood training. We frame the prediction of the output sequence as a sequential decision-making process, where we train the network with an adjusted actor-critic algorithm","authors_text":"Colin Cherry, Grzegorz Kondrak, Saeed Najafi","cross_cats":["cs.AI","cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-30T17:31:52Z","title":"Efficient Sequence Labeling with Actor-Critic Training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00428","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:c532a81c37560364a5f444c56e69c1a6b345d4578190bd29e8e628a1d7dae6bc","target":"record","created_at":"2026-05-18T00:04:27Z","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":"878b8d2a2f3006188fbe1f521aa21371058a635d077d4282018b549518d172e9","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-30T17:31:52Z","title_canon_sha256":"899e94147330d202902649fb6be68bce1a642f2ac959355ca40056cc0fdea9aa"},"schema_version":"1.0","source":{"id":"1810.00428","kind":"arxiv","version":1}},"canonical_sha256":"bb102b3102c42dac26100b938138bef544847bcd1ce774c718a7106b9864054d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb102b3102c42dac26100b938138bef544847bcd1ce774c718a7106b9864054d","first_computed_at":"2026-05-18T00:04:27.900166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:27.900166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgC6iwtwDJA7ucjP/Ixx61EpAkn/8/KUF4oTUlSPFz1bDYsFmJj9oX9jdKlZpQFUwS/HTkvEHr+x2eJ9VsGeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:27.900672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c532a81c37560364a5f444c56e69c1a6b345d4578190bd29e8e628a1d7dae6bc","sha256:2e94877b6078b3e452acad2a00683a3da276da6e59be110a691730c7fc517644"],"state_sha256":"ffd2659997e0fad55e09b5e9e7136caaf4bcda77b521690d22b175f2c0c688ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQhM4bTPglPxWwihE/Dne/yo0koB3wQPzAioU7LEnXckGzLt59RUXGFnQWn82FluBFJaLyg7duetlgkN5+fmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:13:25.199023Z","bundle_sha256":"44b589061be8c3734978bdef8036eb1228ea121da52ac0c0cd35fe52727b9d5d"}}