{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JR5LZNSZHB6R6S5FGP6CVGOKBA","short_pith_number":"pith:JR5LZNSZ","canonical_record":{"source":{"id":"1612.06475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c961ffaa72545139e68e8d6ce983ee8528c972a26a917fbb0c1fbfca9532ad02","abstract_canon_sha256":"b343370073d2a30322d32e206fabecf9c6f997bfea17881d4e1416ff6cdd7be5"},"schema_version":"1.0"},"canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","source":{"kind":"arxiv","id":"1612.06475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06475","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06475v1","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06475","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"JR5LZNSZHB6R","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR5LZNSZHB6R6S5F","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR5LZNSZ","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JR5LZNSZHB6R6S5FGP6CVGOKBA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c961ffaa72545139e68e8d6ce983ee8528c972a26a917fbb0c1fbfca9532ad02","abstract_canon_sha256":"b343370073d2a30322d32e206fabecf9c6f997bfea17881d4e1416ff6cdd7be5"},"schema_version":"1.0"},"canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:25.733001Z","signature_b64":"KS+N8PgT7V9NoR+jUOfozUvbNL6fgfyvTAKPSxA2NvBk0KniWdV9rI2gCgbUEW6ph74Fl+p933sRCQp5HV17Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","last_reissued_at":"2026-05-18T00:54:25.732386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:25.732386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06475","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:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7W4QodcUuTd28/9Fj6IVzPjk5yvkDdtbdoE7/1xWuOo99Vs9yRw6KJAuJuEelSQccm9pE7J3a1Q3gvNioS/tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:18:53.306652Z"},"content_sha256":"2745ab4f8c998aa0b2c434e05897e2863a8f5bec88e9a5717e0247574708aec4","schema_version":"1.0","event_id":"sha256:2745ab4f8c998aa0b2c434e05897e2863a8f5bec88e9a5717e0247574708aec4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JR5LZNSZHB6R6S5FGP6CVGOKBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"James Cross, Liang Huang","submitted_at":"2016-12-20T01:23:00Z","abstract_excerpt":"Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed state-of-the-art approaches in constituency parsing. To remedy this, we introduce a new shift-reduce system whose stack contains merely sentence spans, represented by a bare minimum of LSTM features. We also design the first provably optimal dynamic oracle for constituency parsing, which runs in amortized O(1) time, compared to O(n^3) oracles for standard dependency parsing. Trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06475","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:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVWssUXnqQBNaFgyfm1DyFeRC7b+i98jeSk59bhLc3tgB6AaFhhleWhrwtN+2BT/roycprHxgG7jQZAFmFZOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:18:53.307007Z"},"content_sha256":"e878f9f1a51a0ed407686c52e900b8287d4297a1bc0ab49e53db2d64b7fa4eaa","schema_version":"1.0","event_id":"sha256:e878f9f1a51a0ed407686c52e900b8287d4297a1bc0ab49e53db2d64b7fa4eaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/bundle.json","state_url":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/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-07-02T04:18:53Z","links":{"resolver":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA","bundle":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/bundle.json","state":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JR5LZNSZHB6R6S5FGP6CVGOKBA","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":"b343370073d2a30322d32e206fabecf9c6f997bfea17881d4e1416ff6cdd7be5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","title_canon_sha256":"c961ffaa72545139e68e8d6ce983ee8528c972a26a917fbb0c1fbfca9532ad02"},"schema_version":"1.0","source":{"id":"1612.06475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06475","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06475v1","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06475","created_at":"2026-05-18T00:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"JR5LZNSZHB6R","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR5LZNSZHB6R6S5F","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR5LZNSZ","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:e878f9f1a51a0ed407686c52e900b8287d4297a1bc0ab49e53db2d64b7fa4eaa","target":"graph","created_at":"2026-05-18T00:54:25Z","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":"Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed state-of-the-art approaches in constituency parsing. To remedy this, we introduce a new shift-reduce system whose stack contains merely sentence spans, represented by a bare minimum of LSTM features. We also design the first provably optimal dynamic oracle for constituency parsing, which runs in amortized O(1) time, compared to O(n^3) oracles for standard dependency parsing. Trai","authors_text":"James Cross, Liang Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","title":"Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06475","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:2745ab4f8c998aa0b2c434e05897e2863a8f5bec88e9a5717e0247574708aec4","target":"record","created_at":"2026-05-18T00:54:25Z","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":"b343370073d2a30322d32e206fabecf9c6f997bfea17881d4e1416ff6cdd7be5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","title_canon_sha256":"c961ffaa72545139e68e8d6ce983ee8528c972a26a917fbb0c1fbfca9532ad02"},"schema_version":"1.0","source":{"id":"1612.06475","kind":"arxiv","version":1}},"canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","first_computed_at":"2026-05-18T00:54:25.732386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:25.732386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KS+N8PgT7V9NoR+jUOfozUvbNL6fgfyvTAKPSxA2NvBk0KniWdV9rI2gCgbUEW6ph74Fl+p933sRCQp5HV17Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:25.733001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2745ab4f8c998aa0b2c434e05897e2863a8f5bec88e9a5717e0247574708aec4","sha256:e878f9f1a51a0ed407686c52e900b8287d4297a1bc0ab49e53db2d64b7fa4eaa"],"state_sha256":"33edbcd39e79da9e938533305206336a5f5ec6e2dcf06f03a3d60f107a9c7209"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+R4/Fi0vpBal+p6xg2h1/9Szmgl1UOcPdPPu9Di8ycobcuwbw6iqJgLal/LVbhA75rnP32Uj0ZwwsIWxZyklAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T04:18:53.309162Z","bundle_sha256":"c0f00a279a73a03075aeac4675bd39c4916b89af6ec694485cba54728d4c4e59"}}