{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N7QXVBKASPXIKS2M36WASBGMBA","short_pith_number":"pith:N7QXVBKA","canonical_record":{"source":{"id":"1605.07843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-25T12:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"29034c2108ecee735e4906c8080d13b1d321492ac676eac1cda61c0fdae492e5","abstract_canon_sha256":"521b131e210000d924cb4c72e895cc75b62f188995f1c72bd17dfca2cf51b8c8"},"schema_version":"1.0"},"canonical_sha256":"6fe17a854093ee854b4cdfac0904cc081d857dbab56a4aa5c2cb6a3ecde769d6","source":{"kind":"arxiv","id":"1605.07843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07843","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07843v1","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07843","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"N7QXVBKASPXI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N7QXVBKASPXIKS2M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N7QXVBKA","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N7QXVBKASPXIKS2M36WASBGMBA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-25T12:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"29034c2108ecee735e4906c8080d13b1d321492ac676eac1cda61c0fdae492e5","abstract_canon_sha256":"521b131e210000d924cb4c72e895cc75b62f188995f1c72bd17dfca2cf51b8c8"},"schema_version":"1.0"},"canonical_sha256":"6fe17a854093ee854b4cdfac0904cc081d857dbab56a4aa5c2cb6a3ecde769d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:38.966645Z","signature_b64":"Ap9D3rDxKEOQqjoLosl7ct+8vd11kedTxnUzBVE+A9uh80nhzvDYFoXZbcYtYUiGoUjrgqRUlL+VO8X0sOiNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fe17a854093ee854b4cdfac0904cc081d857dbab56a4aa5c2cb6a3ecde769d6","last_reissued_at":"2026-05-18T01:13:38.966096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:38.966096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07843","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dib3RwRawydAsc9qC9ozqn4f2/QPkKoQddJBJv4a9fXsw6zaUumrVzZGK/1urpiDZdNBeOhgdPSCRAAKVcWhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:42.739593Z"},"content_sha256":"189b271eca2f8526c21d0a901546a3ca3a2164229eb03b3e77e23cdeb463e729","schema_version":"1.0","event_id":"sha256:189b271eca2f8526c21d0a901546a3ca3a2164229eb03b3e77e23cdeb463e729"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N7QXVBKASPXIKS2M36WASBGMBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Word and Dependency Path Embeddings for Aspect Term Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Furu Wei, Kaimeng Xu, Li Dong, Ming Zhang, Ming Zhou, Yichun Yin","submitted_at":"2016-05-25T12:01:46Z","abstract_excerpt":"In this paper, we develop a novel approach to aspect term extraction based on unsupervised learning of distributed representations of words and dependency paths. The basic idea is to connect two words (w1 and w2) with the dependency path (r) between them in the embedding space. Specifically, our method optimizes the objective w1 + r = w2 in the low-dimensional space, where the multi-hop dependency paths are treated as a sequence of grammatical relations and modeled by a recurrent neural network. Then, we design the embedding features that consider linear context and dependency context informat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07843","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fsloXJj3HFmrcnYRLFMAUDsikHtfF9IWL+9sGcnETY8Y+dPds6S4uT0zMayGv+lOBZicnxLc8lUoRcJO96TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:42.739936Z"},"content_sha256":"097ede208720dafeeda59787fc0244c3e32e1611c024fce3ca6413097a2d48e4","schema_version":"1.0","event_id":"sha256:097ede208720dafeeda59787fc0244c3e32e1611c024fce3ca6413097a2d48e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7QXVBKASPXIKS2M36WASBGMBA/bundle.json","state_url":"https://pith.science/pith/N7QXVBKASPXIKS2M36WASBGMBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7QXVBKASPXIKS2M36WASBGMBA/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-02T19:26:42Z","links":{"resolver":"https://pith.science/pith/N7QXVBKASPXIKS2M36WASBGMBA","bundle":"https://pith.science/pith/N7QXVBKASPXIKS2M36WASBGMBA/bundle.json","state":"https://pith.science/pith/N7QXVBKASPXIKS2M36WASBGMBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7QXVBKASPXIKS2M36WASBGMBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N7QXVBKASPXIKS2M36WASBGMBA","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":"521b131e210000d924cb4c72e895cc75b62f188995f1c72bd17dfca2cf51b8c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-25T12:01:46Z","title_canon_sha256":"29034c2108ecee735e4906c8080d13b1d321492ac676eac1cda61c0fdae492e5"},"schema_version":"1.0","source":{"id":"1605.07843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07843","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07843v1","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07843","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"N7QXVBKASPXI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N7QXVBKASPXIKS2M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N7QXVBKA","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:097ede208720dafeeda59787fc0244c3e32e1611c024fce3ca6413097a2d48e4","target":"graph","created_at":"2026-05-18T01:13:38Z","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":"In this paper, we develop a novel approach to aspect term extraction based on unsupervised learning of distributed representations of words and dependency paths. The basic idea is to connect two words (w1 and w2) with the dependency path (r) between them in the embedding space. Specifically, our method optimizes the objective w1 + r = w2 in the low-dimensional space, where the multi-hop dependency paths are treated as a sequence of grammatical relations and modeled by a recurrent neural network. Then, we design the embedding features that consider linear context and dependency context informat","authors_text":"Furu Wei, Kaimeng Xu, Li Dong, Ming Zhang, Ming Zhou, Yichun Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-25T12:01:46Z","title":"Unsupervised Word and Dependency Path Embeddings for Aspect Term Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07843","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:189b271eca2f8526c21d0a901546a3ca3a2164229eb03b3e77e23cdeb463e729","target":"record","created_at":"2026-05-18T01:13:38Z","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":"521b131e210000d924cb4c72e895cc75b62f188995f1c72bd17dfca2cf51b8c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-25T12:01:46Z","title_canon_sha256":"29034c2108ecee735e4906c8080d13b1d321492ac676eac1cda61c0fdae492e5"},"schema_version":"1.0","source":{"id":"1605.07843","kind":"arxiv","version":1}},"canonical_sha256":"6fe17a854093ee854b4cdfac0904cc081d857dbab56a4aa5c2cb6a3ecde769d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fe17a854093ee854b4cdfac0904cc081d857dbab56a4aa5c2cb6a3ecde769d6","first_computed_at":"2026-05-18T01:13:38.966096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:38.966096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ap9D3rDxKEOQqjoLosl7ct+8vd11kedTxnUzBVE+A9uh80nhzvDYFoXZbcYtYUiGoUjrgqRUlL+VO8X0sOiNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:38.966645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:189b271eca2f8526c21d0a901546a3ca3a2164229eb03b3e77e23cdeb463e729","sha256:097ede208720dafeeda59787fc0244c3e32e1611c024fce3ca6413097a2d48e4"],"state_sha256":"cd89b1d480bd08ebc2e8bcba9e3ac446edee3504dd5b0d5bac90d8f260a1ee0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DY6jnUaP71cf98ClemX9sKCMefG6Hqba97G6ptkzRnF1EbaCkFs6Ep53i3QufXX8XxPex5dfd7CCRaojHkH3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:26:42.741797Z","bundle_sha256":"ac8c882e46b18e5788cd1bc1b18d5a3f4b06e72b20094fb6ff6c81751acbd94b"}}