{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MMQ67DTRPL3P65BRIT4HE7KCLG","short_pith_number":"pith:MMQ67DTR","canonical_record":{"source":{"id":"1805.01087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-03T02:23:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"87ac738dacac2aed584e3d177959f1c41bf9b3cd4b26bc6dc681f34fd1a51eb2","abstract_canon_sha256":"08e2ec5fa3db536c3db60ada12343c8288826963ce65c4a8ab61c1d0320cafa9"},"schema_version":"1.0"},"canonical_sha256":"6321ef8e717af6ff743144f8727d4259a6e2da1c0a15d07a8186f5e0e2fffa48","source":{"kind":"arxiv","id":"1805.01087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01087","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01087v1","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01087","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"MMQ67DTRPL3P","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMQ67DTRPL3P65BR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMQ67DTR","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MMQ67DTRPL3P65BRIT4HE7KCLG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-03T02:23:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"87ac738dacac2aed584e3d177959f1c41bf9b3cd4b26bc6dc681f34fd1a51eb2","abstract_canon_sha256":"08e2ec5fa3db536c3db60ada12343c8288826963ce65c4a8ab61c1d0320cafa9"},"schema_version":"1.0"},"canonical_sha256":"6321ef8e717af6ff743144f8727d4259a6e2da1c0a15d07a8186f5e0e2fffa48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:52.606688Z","signature_b64":"DAUpoJLGB/3ZvAbyMVnYF43tV8U87LYxT1pHuLYCCV9II3h0HrjHsyiGFyHgmaKlvEtviLOYqXym+ug8Rb1nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6321ef8e717af6ff743144f8727d4259a6e2da1c0a15d07a8186f5e0e2fffa48","last_reissued_at":"2026-05-18T00:16:52.606125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:52.606125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01087","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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJ7z7z+5a5WlX2E6KewrKiF9dMzkpP4Z1N8nv3W4CyiCm+cflSjhaprZ+JGn+14R9k/8heTyyQK5tdRQK8h2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:00:12.978081Z"},"content_sha256":"65edb1db0168d372caeda457df44663af75e770a78c3316d509150647ceb3f19","schema_version":"1.0","event_id":"sha256:65edb1db0168d372caeda457df44663af75e770a78c3316d509150647ceb3f19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MMQ67DTRPL3P65BRIT4HE7KCLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stack-Pointer Networks for Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Eduard Hovy, Graham Neubig, Jingzhou Liu, Nanyun Peng, Xuezhe Ma, Zecong Hu","submitted_at":"2018-05-03T02:23:28Z","abstract_excerpt":"We introduce a novel architecture for dependency parsing: \\emph{stack-pointer networks} (\\textbf{\\textsc{StackPtr}}). Combining pointer networks~\\citep{vinyals2015pointer} with an internal stack, the proposed model first reads and encodes the whole sentence, then builds the dependency tree top-down (from root-to-leaf) in a depth-first fashion. The stack tracks the status of the depth-first search and the pointer networks select one child for the word at the top of the stack at each step. The \\textsc{StackPtr} parser benefits from the information of the whole sentence and all previously derived"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01087","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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZNIlfi17KKkTaSm/1UaohjC4nq43pwwZXh6mCa1NJCD3BxC6EEMJOMWdTa7ap4Or9hEZzNei18Y2QDIh1u7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:00:12.978440Z"},"content_sha256":"fefb4a95639734c11579166ecd7771577bfcf532d478d329501de73df6623e1d","schema_version":"1.0","event_id":"sha256:fefb4a95639734c11579166ecd7771577bfcf532d478d329501de73df6623e1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/bundle.json","state_url":"https://pith.science/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/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-23T20:00:12Z","links":{"resolver":"https://pith.science/pith/MMQ67DTRPL3P65BRIT4HE7KCLG","bundle":"https://pith.science/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/bundle.json","state":"https://pith.science/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMQ67DTRPL3P65BRIT4HE7KCLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MMQ67DTRPL3P65BRIT4HE7KCLG","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":"08e2ec5fa3db536c3db60ada12343c8288826963ce65c4a8ab61c1d0320cafa9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-03T02:23:28Z","title_canon_sha256":"87ac738dacac2aed584e3d177959f1c41bf9b3cd4b26bc6dc681f34fd1a51eb2"},"schema_version":"1.0","source":{"id":"1805.01087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01087","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01087v1","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01087","created_at":"2026-05-18T00:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"MMQ67DTRPL3P","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMQ67DTRPL3P65BR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMQ67DTR","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:fefb4a95639734c11579166ecd7771577bfcf532d478d329501de73df6623e1d","target":"graph","created_at":"2026-05-18T00:16:52Z","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":"We introduce a novel architecture for dependency parsing: \\emph{stack-pointer networks} (\\textbf{\\textsc{StackPtr}}). Combining pointer networks~\\citep{vinyals2015pointer} with an internal stack, the proposed model first reads and encodes the whole sentence, then builds the dependency tree top-down (from root-to-leaf) in a depth-first fashion. The stack tracks the status of the depth-first search and the pointer networks select one child for the word at the top of the stack at each step. The \\textsc{StackPtr} parser benefits from the information of the whole sentence and all previously derived","authors_text":"Eduard Hovy, Graham Neubig, Jingzhou Liu, Nanyun Peng, Xuezhe Ma, Zecong Hu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-03T02:23:28Z","title":"Stack-Pointer Networks for Dependency Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01087","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:65edb1db0168d372caeda457df44663af75e770a78c3316d509150647ceb3f19","target":"record","created_at":"2026-05-18T00:16:52Z","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":"08e2ec5fa3db536c3db60ada12343c8288826963ce65c4a8ab61c1d0320cafa9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-03T02:23:28Z","title_canon_sha256":"87ac738dacac2aed584e3d177959f1c41bf9b3cd4b26bc6dc681f34fd1a51eb2"},"schema_version":"1.0","source":{"id":"1805.01087","kind":"arxiv","version":1}},"canonical_sha256":"6321ef8e717af6ff743144f8727d4259a6e2da1c0a15d07a8186f5e0e2fffa48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6321ef8e717af6ff743144f8727d4259a6e2da1c0a15d07a8186f5e0e2fffa48","first_computed_at":"2026-05-18T00:16:52.606125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:52.606125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAUpoJLGB/3ZvAbyMVnYF43tV8U87LYxT1pHuLYCCV9II3h0HrjHsyiGFyHgmaKlvEtviLOYqXym+ug8Rb1nDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:52.606688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65edb1db0168d372caeda457df44663af75e770a78c3316d509150647ceb3f19","sha256:fefb4a95639734c11579166ecd7771577bfcf532d478d329501de73df6623e1d"],"state_sha256":"42611be50b43b6c8d0b3e10e0692767812bd2da0c819fea54de5fa3aee9fff7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0NAc7ZXvOUnt/c/CB9lxwqKj6O49/2YDSt3soIpIfiaiDNDFy34/Qi5+Z2JU705kK8C9Ye0S4uHkJQ1aLGHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:00:12.980369Z","bundle_sha256":"401c369bee47418fba678601cdcee4c0aaad404205d712235befd871a5c44fcb"}}