{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E52Z4U667LH33CO66BGUCHECUW","short_pith_number":"pith:E52Z4U66","canonical_record":{"source":{"id":"1602.07749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-02-24T23:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"c6c1727b1af3131c928b39fe98575ce612a00421b0cef6f95a143314605db8ff","abstract_canon_sha256":"76769c4b7c84563b3e0cf36cada8914a709891af8d51f62c977de6607a662e64"},"schema_version":"1.0"},"canonical_sha256":"27759e53defacfbd89def04d411c82a586e2ad3f1140bbb453a3911a350e52d6","source":{"kind":"arxiv","id":"1602.07749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07749","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07749v1","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07749","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"E52Z4U667LH3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E52Z4U667LH33CO6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E52Z4U66","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E52Z4U667LH33CO66BGUCHECUW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-02-24T23:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"c6c1727b1af3131c928b39fe98575ce612a00421b0cef6f95a143314605db8ff","abstract_canon_sha256":"76769c4b7c84563b3e0cf36cada8914a709891af8d51f62c977de6607a662e64"},"schema_version":"1.0"},"canonical_sha256":"27759e53defacfbd89def04d411c82a586e2ad3f1140bbb453a3911a350e52d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:00.455283Z","signature_b64":"qIQd/3iJKVuY3mJ6LUsJAHvV7PzqMG/VubFy29eZhAivMP/C+557ZJjFyCiKKURAWjNsMZagg3vGSIZM5gRGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27759e53defacfbd89def04d411c82a586e2ad3f1140bbb453a3911a350e52d6","last_reissued_at":"2026-05-18T01:20:00.454695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:00.454695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07749","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-18T01:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LmyKBF7Bo2TaSIDlF0nPam/ybWrsJh9kMuS60D96RcmCBzN9aot0Pkc69hz8Q4TPOTlEbf2laFO0OZF8yz2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:06:02.066923Z"},"content_sha256":"0cb832577a53d19d2bd3f6c41f603c3670c635732a8459929798e9a113efa5cb","schema_version":"1.0","event_id":"sha256:0cb832577a53d19d2bd3f6c41f603c3670c635732a8459929798e9a113efa5cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E52Z4U667LH33CO66BGUCHECUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward Mention Detection Robustness with Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Avirup Sil, Georgiana Dinu, Radu Florian, Thien Huu Nguyen","submitted_at":"2016-02-24T23:14:01Z","abstract_excerpt":"One of the key challenges in natural language processing (NLP) is to yield good performance across application domains and languages. In this work, we investigate the robustness of the mention detection systems, one of the fundamental tasks in information extraction, via recurrent neural networks (RNNs). The advantage of RNNs over the traditional approaches is their capacity to capture long ranges of context and implicitly adapt the word embeddings, trained on a large corpus, into a task-specific word representation, but still preserve the original semantic generalization to be helpful across "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07749","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-18T01:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQww2SsOQ5K51fqPWtgEvvLx2NFaKTb65grN42pLPY9HrGkesy1Y6KpZBGiPGpv4pM9IuKOwhNNWB3ngJ7PLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:06:02.067564Z"},"content_sha256":"6b1b987486faf9af57a581d053ea8a99f4cf57aa3e7a4d83ea123c80ad007605","schema_version":"1.0","event_id":"sha256:6b1b987486faf9af57a581d053ea8a99f4cf57aa3e7a4d83ea123c80ad007605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E52Z4U667LH33CO66BGUCHECUW/bundle.json","state_url":"https://pith.science/pith/E52Z4U667LH33CO66BGUCHECUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E52Z4U667LH33CO66BGUCHECUW/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-08T02:06:02Z","links":{"resolver":"https://pith.science/pith/E52Z4U667LH33CO66BGUCHECUW","bundle":"https://pith.science/pith/E52Z4U667LH33CO66BGUCHECUW/bundle.json","state":"https://pith.science/pith/E52Z4U667LH33CO66BGUCHECUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E52Z4U667LH33CO66BGUCHECUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E52Z4U667LH33CO66BGUCHECUW","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":"76769c4b7c84563b3e0cf36cada8914a709891af8d51f62c977de6607a662e64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-02-24T23:14:01Z","title_canon_sha256":"c6c1727b1af3131c928b39fe98575ce612a00421b0cef6f95a143314605db8ff"},"schema_version":"1.0","source":{"id":"1602.07749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07749","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07749v1","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07749","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"E52Z4U667LH3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E52Z4U667LH33CO6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E52Z4U66","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:6b1b987486faf9af57a581d053ea8a99f4cf57aa3e7a4d83ea123c80ad007605","target":"graph","created_at":"2026-05-18T01:20:00Z","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":"One of the key challenges in natural language processing (NLP) is to yield good performance across application domains and languages. In this work, we investigate the robustness of the mention detection systems, one of the fundamental tasks in information extraction, via recurrent neural networks (RNNs). The advantage of RNNs over the traditional approaches is their capacity to capture long ranges of context and implicitly adapt the word embeddings, trained on a large corpus, into a task-specific word representation, but still preserve the original semantic generalization to be helpful across ","authors_text":"Avirup Sil, Georgiana Dinu, Radu Florian, Thien Huu Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-02-24T23:14:01Z","title":"Toward Mention Detection Robustness with Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07749","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:0cb832577a53d19d2bd3f6c41f603c3670c635732a8459929798e9a113efa5cb","target":"record","created_at":"2026-05-18T01:20:00Z","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":"76769c4b7c84563b3e0cf36cada8914a709891af8d51f62c977de6607a662e64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-02-24T23:14:01Z","title_canon_sha256":"c6c1727b1af3131c928b39fe98575ce612a00421b0cef6f95a143314605db8ff"},"schema_version":"1.0","source":{"id":"1602.07749","kind":"arxiv","version":1}},"canonical_sha256":"27759e53defacfbd89def04d411c82a586e2ad3f1140bbb453a3911a350e52d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27759e53defacfbd89def04d411c82a586e2ad3f1140bbb453a3911a350e52d6","first_computed_at":"2026-05-18T01:20:00.454695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:00.454695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qIQd/3iJKVuY3mJ6LUsJAHvV7PzqMG/VubFy29eZhAivMP/C+557ZJjFyCiKKURAWjNsMZagg3vGSIZM5gRGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:00.455283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb832577a53d19d2bd3f6c41f603c3670c635732a8459929798e9a113efa5cb","sha256:6b1b987486faf9af57a581d053ea8a99f4cf57aa3e7a4d83ea123c80ad007605"],"state_sha256":"92f0aebf3fde9464ee74bb40d072f0e2973596b11747e4c19920e005c994c6c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuJP+i3whv1AQJQhDgBlxts+hNFbngJLHxkIJH3n+7mYFXTzgjdsGdK3csV+yoR3x/vKLIB2tbPhow3JKDPVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:06:02.071088Z","bundle_sha256":"5052a5502101778a54c282d4a3ba847ce7020a1fe221cf99edd9957014632408"}}